Quantum annealing correction for random Ising problems
arXiv:1408.4382 · doi:10.1103/PhysRevA.91.042302
Abstract
We demonstrate that the performance of a quantum annealer on hard random Ising optimization problems can be substantially improved using quantum annealing correction (QAC). Our error correction strategy is tailored to the D-Wave Two device. We find that QAC provides a statistically significant enhancement in the performance of the device over a classical repetition code, improving as a function of problem size as well as hardness. Moreover, QAC provides a mechanism for overcoming the precision limit of the device, in addition to correcting calibration errors. Performance is robust even to missing qubits. We present evidence for a constructive role played by quantum effects in our experiments by contrasting the experimental results with the predictions of a classical model of the device. Our work demonstrates the importance of error correction in appropriately determining the performance of quantum annealers.
17 pages, 14 figures. v2: updated to published version
References in corpus (37)
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum annealing with more than one hundred qubits
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Annealing and Analog Quantum Computation
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Defining and detecting quantum speedup
- Robustness of adiabatic quantum computation
- Mathematical Foundation of Quantum Annealing
- Bounds for the adiabatic approximation with applications to quantum computation
- Architectural considerations in the design of a superconducting quantum annealing processor
- Experimental signature of programmable quantum annealing
- Quantum Adiabatic Markovian Master Equations
- Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
- Adiabatic Quantum Computation in Open Systems
- Quantum Optimization of Fully-Connected Spin Glasses
- Error corrected quantum annealing with hundreds of qubits
- Entanglement in a quantum annealing processor
- Quantum Speedup by Quantum Annealing
- Error correcting codes for adiabatic quantum computation
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
- Towards Fault Tolerant Adiabatic Quantum Computation
- The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
- Thermally assisted adiabatic quantum computation
- How "Quantum" is the D-Wave Machine?
- Decoherence in adiabatic quantum computation
- Unification and limitations of error suppression techniques for adiabatic quantum computing
- Error suppression and error correction in adiabatic quantum computation I: techniques and challenges
- Adiabatic quantum optimization with the wrong Hamiltonian
- Error suppression and error correction in adiabatic quantum computation II: non-equilibrium dynamics
- Ground State Quantum Computation
- High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
- Comment on: "Classical signature of quantum annealing"
- Fault-Tolerant Quantum Computation with Constant Overhead
- A family of [[6k, 2k, 2]] codes for practical, scalable adiabatic quantum computation
- Comment on "Distinguishing Classical and Quantum Models for the D-Wave Device"
Cited by in corpus (61)
- Quantum information processing with superconducting circuits: a review
- Perspectives of quantum annealing: Methods and implementations
- Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
- Probing for quantum speedup in spin glass problems with planted solutions
- Decoherence in adiabatic quantum computation
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
- Quantum Annealing Correction with Minor Embedding
- Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
- Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities
- Temperature scaling law for quantum annealing optimizers
- Quantum annealing of the -spin model under inhomogeneous transverse field driving
- Energetic cost of Hamiltonian quantum gates
- Parallel Quantum Annealing
- Nested Quantum Annealing Correction
- Building an iterative heuristic solver for a quantum annealer
- Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability
- Uncertain fate of fair sampling in quantum annealing
- Maximum-Entropy Inference with a Programmable Annealer
- Scaling overhead of embedding optimization problems in quantum annealing
- Quantum annealing correction at finite temperature: ferromagnetic -spin models
- Analog Errors in Ising Machines
- Algorithm engineering for a quantum annealing platform
- Performance of two different quantum annealing correction codes
- Mean Field Analysis of Quantum Annealing Correction
- Kibble-Zurek scaling in quantum speed limits for shortcuts to adiabaticity
- An energetic perspective on rapid quenches in quantum annealing
- Schedule path optimization for quantum annealing and adiabatic quantum computing
- Improved Boltzmann machines with error corrected quantum annealing
- Boosting quantum annealer performance via sample persistence
- Simulated Quantum Annealing with Two All-to-All Connectivity Schemes
- Scalable effective temperature reduction for quantum annealers via nested quantum annealing correction
- Nested Quantum Annealing Correction at Finite Temperature: -spin models
- Computational hardness of spin-glass problems with tile-planted solutions
- The three phases of quantum annealing: fast, slow, and very slow
- Fair sampling of ground-state configurations of binary optimization problems
- Retrieving the ground state of spin glasses using thermal noise: Performance of quantum annealing at finite temperatures
- Viewing Vanilla Quantum Annealing Through Spin Glasses
- Exponential capacity of associative memories under quantum annealing recall
- Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits
- Quantum Isomer Search
- Patch-planting spin-glass solution for benchmarking
- 4-clique Network Minor Embedding for Quantum Annealers
- Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
- A QUBO formulation for top- eigencentrality nodes
- Noise-tolerant quantum speedups in quantum annealing without fine tuning
- Quantum annealing with a nonvanishing final value of the transverse field
- Demonstration of error-suppressed quantum annealing via boundary cancellation
- Using copies to improve precision in continuous-time quantum computing
- Mapping State Transition Susceptibility in Quantum Annealing
- Limits of Short-Time Evolution of Local Hamiltonians
- Mapping NP-Hard Problems to Restricted Adiabatic Quantum Architectures
- Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking
- Assessing the performance of quantum annealing with nonlinear driving
- Analog Errors in Quantum Annealing: Doom and Hope
- Benchmarking Embedded Chain Breaking in Quantum Annealing
- Solving Helmholtz problems with finite elements on a quantum annealer
- Lack of a thermodynamic finite-temperature spin-glass phase in the two-dimensional randomly-coupled ferromagnet
- 2D implementation of quantum annealing algorisms for fourth order binary optimization problems
- Structural Comparison of Error Mitigation Methods for Ising Machines: Penalty-Spin Model versus Stacked Model
- Frustration-enhanced quantum annealing correction models with additional inter-replica interactions