Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
arXiv:2105.02208 · doi:10.1007/s11128-022-03476-y
Abstract
We benchmark the quantum processing units of the largest quantum annealers to date, the 5000+ qubit quantum annealer Advantage and its 2000+ qubit predecessor D-Wave 2000Q, using tail assignment and exact cover problems from aircraft scheduling scenarios. The benchmark set contains small, intermediate, and large problems with both sparsely connected and almost fully connected instances. We find that Advantage outperforms D-Wave 2000Q for almost all problems, with a notable increase in success rate and problem size. In particular, Advantage is also able to solve the largest problems with 120 logical qubits that D-Wave 2000Q cannot solve anymore. Furthermore, problems that can still be solved by D-Wave 2000Q are solved faster by Advantage. We find, however, that D-Wave 2000Q can achieve better success rates for sparsely connected problems that do not require the many new couplers present on Advantage, so improving the connectivity of a quantum annealer does not per se improve its performance.
new experiments to test the conjecture about unused couplers (appendix B)
References in corpus (12)
- A Quantum Approximate Optimization Algorithm
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- Reexamining classical and quantum models for the D-Wave One processor
- SU(2) lattice gauge theory on a quantum annealer
- Next-Generation Topology of D-Wave Quantum Processors
- Gate-error analysis in simulations of quantum computers with transmon qubits
- GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
- ZZ freedom in two qubit gates
- Larger Sparse Quadratic Assignment Problem Optimization Using Quantum Annealing and a Bit-Flip Heuristic Algorithm
- Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines
- Performance benefits of increased qubit connectivity in quantum annealing 3-dimensional spin glasses
- Numerical analysis of effective models for flux-tunable transmon systems
Cited by in corpus (27)
- Quantum Annealing for Industry Applications: Introduction and Review
- Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
- GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
- Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems
- GCS-Q: Quantum Graph Coalition Structure Generation
- Networked Quantum Services
- Quantum support vector machines for aerodynamic classification
- Garden optimization problems for benchmarking quantum annealers
- Guided quantum walk
- Improving Performance in Combinatorial Optimization Problems with Inequality Constraints: An Evaluation of the Unbalanced Penalization Method on D-Wave Advantage
- Combinatorial Optimization with Quantum Computers
- A quantum annealing-sequential quadratic programming assisted finite element simulation for non-linear and history-dependent mechanical problems
- Scalable Connectivity for Ising Machines: Dense to Sparse
- Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing
- Unraveling Reverse Annealing: A Study of D-Wave Quantum Annealers
- Quantum Annealers Chain Strengths: A Simple Heuristic to Set Them All
- Performance of quantum annealing for 2-SAT problems with multiple satisfying assignments
- Quantum Annealing with chaotic driver Hamiltonians
- Boosting quantum annealing performance through direct polynomial unconstrained binary optimization
- Learning-Driven Annealing with Adaptive Hamiltonian Modification for Solving Large-Scale Problems on Quantum Devices
- Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking
- Range dependent Hamiltonian Algorithm for numerical QUBO formulation
- Calculating Nash Equilibrium on Quantum Annealers
- Statistical quality assessment of Ising-based annealer outputs
- Folding lattice proteins with quantum annealing
- Modified Multiple Sequence Alignment Algorithm on Quantum Annealers (MAQ)
- Quantitative analysis of the effectiveness of mid-anneal measurement in quantum annealing