Benchmarking a quantum annealing processor with the time-to-target metric
arXiv:1508.05087
Abstract
In the evaluation of quantum annealers, metrics based on ground state success rates have two major drawbacks. First, evaluation requires computation time for both quantum and classical processors that grows exponentially with problem size. This makes evaluation itself computationally prohibitive. Second, results are heavily dependent on the effects of analog noise on the quantum processors, which is an engineering issue that complicates the study of the underlying quantum annealing algorithm. We introduce a novel "time-to-target" metric which avoids these two issues by challenging software solvers to match the results obtained by a quantum annealer in a short amount of time. We evaluate D-Wave's latest quantum annealer, the D-Wave 2X system, on an array of problem classes and find that it performs well on several input classes relative to state of the art software solvers running single-threaded on a CPU.
29 pages
References in corpus (6)
- Probing for quantum speedup in spin glass problems with planted solutions
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- Heavy tails in the distribution of time-to-solution for classical and quantum annealing
- Performance of a quantum annealer on range-limited constraint satisfaction problems
- Computational Role of Collective Tunneling in a Quantum Annealer
- Efficient subgraph-based sampling of Ising-type models with frustration
Cited by in corpus (37)
- Adiabatic Quantum Computing
- Quantum algorithms: an overview
- Reverse Quantum Annealing Approach to Portfolio Optimization Problems
- Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
- Nonnegative/binary matrix factorization with a D-Wave quantum annealer
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Traffic Signal Optimization on a Square Lattice with Quantum Annealing
- Temperature scaling law for quantum annealing optimizers
- Parallel Quantum Annealing
- Scaling analysis and instantons for thermally-assisted tunneling and Quantum Monte Carlo simulations
- Quantum Shuttle: Traffic Navigation with Quantum Computing
- Fault-tolerance thresholds for the surface code with fabrication errors
- Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods
- Adiabatic optimization versus diffusion Monte Carlo
- A novel design update framework for topology optimization with quantum annealing: Application to truss and continuum structures
- A dissipative environment may improve the quantum annealing performances of the ferromagnetic p-spin model
- FEqa: Finite Element Computations on Quantum Annealers
- Efficient Combinatorial Optimization Using Quantum Annealing
- Degeneracy, degree, and heavy tails in quantum annealing
- Advantages of Unfair Quantum Ground-State Sampling
- Optimizing the spin reversal transform on the D-Wave 2000Q
- Evaluating Ising Processing Units with Integer Programming
- Nested Quantum Annealing Correction at Finite Temperature: -spin models
- Benchmarking Quantum Hardware for Training of Fully Visible Boltzmann Machines
- Realization of Heisenberg models of spin systems with polar molecules in pendular states
- A Hybrid Quantum-Classical Approach to the Electric Mobility Problem
- Multiple Query Optimization on the D-Wave 2X Adiabatic Quantum Computer
- Path-Integral Quantum Monte Carlo simulation with Open-Boundary Conditions
- QUBO.jl: A Julia Ecosystem for Quadratic Unconstrained Binary Optimization
- Finding Maximum Cliques on the D-Wave Quantum Annealer
- Quantum computation using arrays of N polar molecules in pendular states
- Posiform Planting: Generating QUBO Instances for Benchmarking
- A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing---Abridged Version
- Quantum-Inspired Tempering for Ground State Approximation using Artificial Neural Networks
- Benchmarking Embedded Chain Breaking in Quantum Annealing
- Analog Errors in Quantum Annealing: Doom and Hope
- Assessing the quantumness of the annealing dynamics via Leggett Gargs inequalities: a weak measurement approach