Performance of two different quantum annealing correction codes
arXiv:1508.02785 · doi:10.1007/s11128-015-1201-z
Abstract
Quantum annealing is a promising approach for solving optimization problems, but like all other quantum information processing methods, it requires error correction to ensure scalability. In this work we experimentally compare two quantum annealing correction codes in the setting of antiferromagnetic chains, using two different quantum annealing processors. The lower temperature processor gives rise to higher success probabilities. The two codes differ in a number of interesting and important ways, but both require four physical qubits per encoded qubit. We find significant performance differences, which we explain in terms of the effective energy boost provided by the respective redundantly encoded logical operators of the two codes. The code with the higher energy boost results in improved performance, at the expense of a lower degree encoded graph. Therefore, we find that there exists an important tradeoff between encoded connectivity and performance for quantum annealing correction codes.
6 pages main text, 1 page appendix, 23 figures. v2 - Updated manuscript to match published version
References in corpus (14)
- An Open-System Quantum Simulator with Trapped Ions
- Detecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code
- Bounds for the adiabatic approximation with applications to quantum computation
- Quantum Error Correction
- Decoherence in adiabatic quantum computation
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Towards Fault Tolerant Adiabatic Quantum Computation
- Quantum annealing correction for random Ising problems
- Noise resistance of adiabatic quantum computation using random matrix theory
- Quantum Annealing Correction with Minor Embedding
- The quantum adiabatic search with decoherence in the instantaneous energy eigenbasis
- Mean Field Analysis of Quantum Annealing Correction
- High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
- Quantum error suppression with commuting Hamiltonians: Two-local is too local
Cited by in corpus (20)
- Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
- Probing the Universality of Topological Defect Formation in a Quantum Annealer: Kibble-Zurek Mechanism and Beyond
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Nested Quantum Annealing Correction
- Quantum annealing correction at finite temperature: ferromagnetic -spin models
- Mean Field Analysis of Quantum Annealing Correction
- 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
- Error suppression in adiabatic quantum computing with qubit ensembles
- 4-clique Network Minor Embedding for Quantum Annealers
- Quantum annealing with a nonvanishing final value of the transverse field
- Demonstration of error-suppressed quantum annealing via boundary cancellation
- Mapping State Transition Susceptibility in Quantum Annealing
- Using copies to improve precision in continuous-time quantum computing
- Benchmarking Embedded Chain Breaking in Quantum Annealing
- Analog Errors in Quantum Annealing: Doom and Hope
- Frustration-enhanced quantum annealing correction models with additional inter-replica interactions