Performance of quantum annealing hardware

  title={Performance of quantum annealing hardware},
  author={Damian S. Steiger and Bettina Heim and Troels F. Ronnow and Matthias Troyer},
  booktitle={SPIE Security + Defence},
In this paper, we provide an introduction to quantum annealers, which are analogue quantum computing devices, and their potential application to solve hard optimisation problems. We summarise our benchmarks performed on a "Wave Two" machine by Canadian company D-Wave Systems Inc. 
Many Known Quantum Algorithms Are Optimal: Symmetry-Based Proofs
Many quantum algorithms have been proposed which are drastically more efficient that 1 the best of the non-quantum algorithms for solving the same problems. A natural question is: are 2 these quantum
What Is the Optimal Annealing Schedule in Quantum Annealing
  • Oscar Galindo, V. Kreinovich
  • Computer Science, Materials Science
    2020 IEEE Symposium Series on Computational Intelligence (SSCI)
  • 2020
A theoretical explanation for empirical successes of quantum annealing is provided, by proving that these two schedules are indeed optimal (in some reasonable sense).
Many Known Quantum Algorithms Are Optimal: Proofs
Copyright: c © 2021 by the authors. Submitted to Symmetry for possible open access publication under the terms and conditions of the Creative Commons Attribution (CC BY) license
Blockchain platform with proof-of-work based on analog Hamiltonian optimisers
This work reconsider the basis of blockchain encryption and suggests to move from currently used proof-of-work schemes to the proof- of-work performed by analog Hamiltonian optimisers, which has a potential to significantly increase decentralisation of the existing blockchains and to help achieve faster transaction times.
Nonlinear systems for unconventional computing
This chapter reviews some of the systems and physically-inspired algorithms that show such promise and how they can be combined to form a hybrid architecture that may one day compete with conventional computing.
Synthesis meets theory: Past, present and future of rational chemistry
Abstract Chemical synthesis has its roots in the empirical approach of alchemy. Nonetheless, the birth of the scientific method, the technical and technological advances (exploiting revolutionary


Evidence for quantum annealing with more than one hundred qubits
Quantum annealing is expected to solve certain optimization problems more efficiently, but there are still open questions regarding the functioning of devices such as D-Wave One. A numerical and
How "Quantum" is the D-Wave Machine?
Recently there has been intense interest in claims about the performance of the D-Wave machine. In this paper, we outline a simple classical model, and show that it achieves excellent correlation
Quantum versus classical annealing of Ising spin glasses
The question of when quantum speedup may be expected is revisited and it is shown that the results depend on how the problem is described and how the optimization routine is implemented, which implies that care must be taken when using QMC simulations to assess the potential for quantum speed up.
Searching for quantum speedup in quasistatic quantum annealers
We argue that a quantum annealer at very long annealing times is likely to experience a quasistatic evolution, returning a final population that is close to a Boltzmann distribution of the
Defining and detecting quantum speedup
Here, it is shown how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup, and the subtle nature of the quantum speed up question is illustrated.
14-Qubit entanglement: creation and coherence.
We report the creation of Greenberger-Horne-Zeilinger states with up to 14 qubits. By investigating the coherence of up to 8 ions over time, we observe a decay proportional to the square of the
Theory of Quantum Annealing of an Ising Spin Glass
By comparing classical and quantum Monte Carlo annealing protocols on the two-dimensional random Ising model (a prototype spin glass), this work confirms the superiority of quantumAnnealing relative to classical annealed and proposes a theory of quantum annealer based on a cascade of Landau-Zener tunneling events.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • P. Shor
  • Computer Science, Mathematics
    SIAM Rev.
  • 1999
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems.
Optimization by Simulated Annealing
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
Heavy Tails in the Distribution of Time to Solution for Classical and Quantum Annealing.
It is found that fast, nonadiabatic, annealing schedules can improve the performance of simulated quantum annealed for very hard instances by many orders of magnitude.