Nested Quantum Annealing Correction
arXiv:1511.07084 · doi:10.1038/npjqi.2016.17
Abstract
We present a general error-correcting scheme for quantum annealing that allows for the encoding of a logical qubit into an arbitrarily large number of physical qubits. Given any Ising model optimization problem, the encoding replaces each logical qubit by a complete graph of degree , representing the distance of the error-correcting code. A subsequent minor-embedding step then implements the encoding on the underlying hardware graph of the quantum annealer. We demonstrate experimentally that the performance of a D-Wave Two quantum annealing device improves as grows. We show that the performance improvement can be interpreted as arising from an effective increase in the energy scale of the problem Hamiltonian, or equivalently, an effective reduction in the temperature at which the device operates. The number thus allows us to control the amount of protection against thermal and control errors, and in particular, to trade qubits for a lower effective temperature that scales as , with . This effective temperature reduction is an important step towards scalable quantum annealing.
arXiv comment19 pages; 12 figures
References in corpus (46)
- 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
- Quantum Annealing and Analog Quantum Computation
- Quantum Search by Local Adiabatic Evolution
- 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 Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
- Classical and quantum shortcuts to adiabaticity for scale-invariant driving
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Adiabatic Quantum Computation in Open Systems
- Quantum Optimization of Fully-Connected Spin Glasses
- Error corrected quantum annealing with hundreds of qubits
- Quantum Speedup by Quantum Annealing
- A scalable control system for a superconducting adiabatic quantum optimization processor
- Decoherence in adiabatic quantum computation
- Error correcting codes for adiabatic quantum computation
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Towards Fault Tolerant Adiabatic Quantum Computation
- Tunable Quantum Tunneling of Magnetic Domain Walls
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- A scalable readout system for a superconducting adiabatic quantum optimization system
- Thermally assisted adiabatic quantum computation
- Quantum annealing correction for random Ising problems
- Reexamining classical and quantum models for the D-Wave One processor
- Quantum Annealing Correction with Minor Embedding
- Adiabaticity in open quantum systems
- Decoherence in adiabatic quantum computation
- Improved Error-Scaling for Adiabatic Quantum State Transfer
- Adiabatic theorems for generators of contracting evolutions
- Unraveling Quantum Annealers using Classical Hardness
- Adiabatic quantum optimization with the wrong Hamiltonian
- Quantum annealing: the fastest route to quantum computation?
- Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
- Error suppression and error correction in adiabatic quantum computation II: non-equilibrium dynamics
- Performance of two different quantum annealing correction codes
- Mean Field Analysis of Quantum Annealing Correction
- High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
- Period Finding with Adiabatic Quantum Computation
- Quantum and Classical in Adiabatic Computation
- Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer
- Adiabatic and Hamiltonian computing on a 2D lattice with simple 2-qubit interactions
- A family of [[6k, 2k, 2]] codes for practical, scalable adiabatic quantum computation
Cited by in corpus (31)
- Perspectives of quantum annealing: Methods and implementations
- Reverse Quantum Annealing Approach to Portfolio Optimization Problems
- Dynamical decoupling for superconducting qubits: a performance survey
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Temperature scaling law for quantum annealing optimizers
- Quantum annealing correction at finite temperature: ferromagnetic -spin models
- Analog Errors in Ising Machines
- An energetic perspective on rapid quenches in quantum annealing
- Why and when is pausing beneficial in quantum annealing?
- Improved Boltzmann machines with error corrected quantum annealing
- Scaling Advantage in Approximate Optimization with Quantum Annealing
- Scalable effective temperature reduction for quantum annealers via nested quantum annealing correction
- Nested Quantum Annealing Correction at Finite Temperature: -spin models
- Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
- Error suppression in adiabatic quantum computing with qubit ensembles
- Error Suppression for Hamiltonian Quantum Computing in Markovian Environments
- Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits
- Mediator assisted cooling in quantum annealing
- Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes
- 4-clique Network Minor Embedding for Quantum Annealers
- Quantum annealing with a nonvanishing final value of the transverse field
- Noise-tolerant quantum speedups in quantum annealing without fine tuning
- Influence of long-range interaction on degeneracy of eigenvalues of connection matrix of d-dimensional Ising system
- Gauge-Symmetry Protection Using Single-Body Terms
- Demonstration of error-suppressed quantum annealing via boundary cancellation
- Using copies to improve precision in continuous-time quantum computing
- Impact of Fixing Spins in a Quantum Annealer with Energy Rescaling
- Analog Errors in Quantum Annealing: Doom and Hope
- Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking
- Frustration-enhanced quantum annealing correction models with additional inter-replica interactions
- Structural Comparison of Error Mitigation Methods for Ising Machines: Penalty-Spin Model versus Stacked Model