Quantum Computing Seminar: Limitations of Tensor Network Approaches for Optimisation and Sampling
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F25%3A10260224" target="_blank" >RIV/61989100:27740/25:10260224 - isvavai.cz</a>
Result on the web
<a href="https://events.it4i.cz/event/326/" target="_blank" >https://events.it4i.cz/event/326/</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Quantum Computing Seminar: Limitations of Tensor Network Approaches for Optimisation and Sampling
Original language description
The course addressed the NP-hard problem of finding the ground state of the Ising model, closely related to Quadratic Unconstrained Binary Optimization (QUBO). It briefly introduced quantum annealers and classical Ising machines before presenting SpinGlassPEPS, a tensor-network-based heuristic algorithm designed to uncover the low-energy spectrum of Ising-like problems with connectivity structures relevant to current quantum annealers. The deterministic approach combined branch-and-bound search with approximate marginal calculations via tensor-network contractions. Benchmark results were presented, focusing on ground state search and solution diversity, followed by a discussion of the method’s limitations and a short hands-on tutorial on the Julia implementation, SpinGlassPEPS.jl.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
—
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů