Brute-forcing spin-glass problems with CUDA

Jałowiecki, Konrad; Rams, Marek M.; Gardas, Bartłomiej

doi:10.1016/j.cpc.2020.107728

Cited by 7 publications

(11 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the present work, we also use such algorithms, in particular those introduced in Ref. [77] for benchmarking and evaluating our results for smaller examples. This way we can compare the exact spectrum with the results obtained from the D-Wave quantum hardware and the variational algorithms.…”

Section: Classical Algorithms For Solving Ising Problemsmentioning

confidence: 99%

“…216, we set d max = 7, which is considerably larger than the AMCC solution. There are 48 logical quantum bits needed to handle this problem instance, making it suitable for both quantum annealing at the current state of the art, and the GPUbased implementation of the brute-force search for the low-energy spectrum (ground state and subsequent excited state) [77], which is possible with up to 50 quantum bits. The benefit of this possibility is that it provides an exact picture of the spectrum, which can be used as a reference when evaluating the heuristic results of approximate methods (tensor networks) or quantum annealing.…”

Section: B Simple Heuristicsmentioning

confidence: 99%

“…To demonstrate the aforementioned idea, we first present the results of the brute-force numerical calcu-lations performed on a GPU architecture [77]. With this approach, the low-energy spectra of the smallest instances have been calculated exactly, providing some guidance for the understanding of the model behavior and parameter dependence.…”

Section: Exact Calculation Of the Low-energy Spectrummentioning

confidence: 99%

See 2 more Smart Citations

Quantum annealing in the NISQ era: railway conflict management

Domino,

Koniorczyk,

Krawiec

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

We are in the Noisy Intermediate-Scale Quantum (NISQ) devices' era, in which quantum hardware has become available for application in real-world problems. However, demonstrating the usefulness of such NISQ devices are still rare. In this work, we consider a practical railway dispatching problem: delay and conflict management on single-track railway lines. We examine the issue of train dispatching consequences caused by the arrival of an already delayed train to the network segment being considered. This problem is computationally hard and needs to be solved almost in real-time. We introduce a quadratic unconstrained binary optimization (QUBO) model of this problem, compatible with the emerging quantum annealing technology. The model's instances can be executed on present-day quantum annealers. As a proof-of-concept, we solve selected real-life problems from the Polish railway network using D-Wave quantum annealers. As a reference, we also provide solutions calculated with classical methods, including those relevant to the community (linear integer programming) and a sophisticated algorithm based on tensor networks for solving Ising instances. Our preliminary results illustrate the degree of difficulty of real-life railway instances for the current quantum annealing technology. Moreover, our analysis shows that the new generation of quantum annealers (the advantage system) perform much worse on those instances than its predecessor.

show abstract

Section: Classical Algorithms For Solving Ising Problemsmentioning

confidence: 99%

Section: B Simple Heuristicsmentioning

confidence: 99%

Section: Exact Calculation Of the Low-energy Spectrummentioning

confidence: 99%

See 1 more Smart Citation

Quantum annealing in the NISQ era: railway conflict management

Domino,

Koniorczyk,

Krawiec

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…In analyzing the above mentioned issue it is very helpful that for up to 50 variables one can calculate the exact ground states and the excited states closest to it using a brute-force search on the spin configurations with GPUbased high performance computers. In the present work we also use such algorithms, in particular those introduced in [53] for benchmarking and evaluating our results for smaller instances. This way we can compare the exact spectrum with the results obtained from the D-Wave quantum hardware and the variational algorithms.…”

Section: Classical Algorithms For Solving Ising Problemsmentioning

confidence: 99%

“…To put things in perspective, it is worth mentioning that searching through all configurations classically in a reasonable time is only possible for small system sizes (that is, using present-day state of the art technology). Even then, incorporating massive parallelization techniques, it takes roughly two weeks to find the low-energy spectrum of the Ising Hamiltonian with only 50 spins [3]. In comparison, annealers process information on a time scale of 5µs-2ms, roughly independent on the number of qubits [4].…”

Section: Introductionmentioning

confidence: 99%

Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines

Domino,

Koniorczyk,

Krawiec

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

We consider a railway dispatching problem: delay and conflict management on a single-track railway line. We examine the issue of train dispatching consequences caused by the arrival of an already delayed train to the segment being considered. This is a computationally hard problem and its solution is needed in a very short time in practice. We introduce a quadratic unconstrained binary optimization (QUBO) model of the problem that is suitable for solving on quantum annealer devices: an emerging alternative computational hardware technology. These offer a scalability of computationally hard problems better than that of classical computers. We provide a proof-of-principle demonstration of applicability through solving selected real-life problems from the Polish railway network. We carry out the actual calculation on the D-Wave 2000Q machine. We also include solutions of our model using classical algorithms for solving QUBO, including those based on tensor networks. These are of potential practical relevance in case of smaller instances and serve as a comparison for understanding the behavior of the actual quantum device.

show abstract

Omnisolver: An extensible interface to Ising spin–glass and QUBO solvers

Jałowiecki,

Pawela

2023

SoftwareX

View full text Add to dashboard Cite

Brute-forcing spin-glass problems with CUDA

Cited by 7 publications

References 28 publications

Quantum annealing in the NISQ era: railway conflict management

Quantum annealing in the NISQ era: railway conflict management

Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines

Omnisolver: An extensible interface to Ising spin–glass and QUBO solvers

Contact Info

Product

Resources

About