Disorder-assisted graph coloring on quantum annealers

Więckowski, Andrzej; Deffner, Sebastian; Gardas, Bartłomiej

doi:10.1103/physreva.100.062304

Cited by 13 publications

(9 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dimensionless real couplers, , and magnetic fields, , are programmable. In practice, the actual values of those parameters that are sent to the quantum processing unit differ from the ones specified by the user by a small amount , 49 . This is due to various reasons including noise effects which we will neglect in this work (cf.…”

Section: Quantum Annealingmentioning

confidence: 99%

Parallel in time dynamics with quantum annealers

Jałowiecki

Więckowski

Gawron

et al. 2020

Sci Rep

Self Cite

View full text Add to dashboard Cite

Recent years have witnessed an unprecedented increase in experiments and hybrid simulations involving quantum computers. in particular, quantum annealers. there exist a plethora of algorithms promising to outperform classical computers in the near-term future. Here, we propose a parallel in time approach to simulate dynamical systems designed to be executed already on present-day quantum annealers. in essence, purely classical methods for solving dynamics systems are serial. therefore, their parallelization is substantially limited. in the presented approach, however, the time evolution is rephrased as a ground-state search of a classical ising model. Such a problem is solved intrinsically in parallel by quantum computers. The main idea is exemplified by simulating the Rabi oscillations generated by a two-level quantum system (i.e. qubit) experimentally.

show abstract

Section: Quantum Annealingmentioning

confidence: 99%

Parallel in time dynamics with quantum annealers

Jałowiecki

Więckowski

Gawron

et al. 2020

Sci Rep

Self Cite

View full text Add to dashboard Cite

show abstract

“…To date, at least in public domain research, most of the studied " quantum" problems are not directly relevant to a particular industrial application, but rather concern the solution of "classical" generic, computationally hard problems, such as, e.g. the traveling salesman problem or the graph coloring problem [12], see e.g. Ref.…”

Section: Introductionmentioning

confidence: 99%

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

“…Reviews on the subject are available [7,8] and come with alternative names such as adiabatic quantum computation (AQC) and analog quantum computation. Applications include data analysis [9], optimization problems mapped into spin-glasses [10,11], and graph network problems [12,13]. D-Wave annealers and their chimera architecture Ising model spin networks offer the state of the art solutions [14,15].…”

Section: Introductionmentioning

confidence: 99%

Effects of Graph Network Connections on The Efficiency of Quantum Annealing

Ege¹,

Müstecaplıoğlu²

2021

Preprint

View full text Add to dashboard Cite

Graph structure of quantum spin networks plays an important role in the applications of quantum annealing. In this work, we compare the performance results of four basic graph structures. Generally, the interaction model choice for quantum annealing is Ising but we test Hamilton XY and antisymmetric anisotropic models as well. Major findings include that Ising model interactions are the most persistent with the change of graph structure. Heisenberg XY model suffers from performance losses with highly connected square graphs which can be attributed to large entropy built-up. Whereas anisotropic model is impractical with square type graphs as energy gap calculations approach zero during annealing. Furthermore, inhomogeneous couplings and their effects on different models and graph structures show a trade-off between coupling strength and performance especially in the case of the anisotropic model.

show abstract

Disorder-assisted graph coloring on quantum annealers

Cited by 13 publications

References 55 publications

Parallel in time dynamics with quantum annealers

Parallel in time dynamics with quantum annealers

Quantum annealing in the NISQ era: railway conflict management

Effects of Graph Network Connections on The Efficiency of Quantum Annealing

Contact Info

Product

Resources

About