Error correction for encoded quantum annealing
arXiv:1511.00004 · doi:10.1103/PhysRevA.93.052325
Abstract
Recently, Lechner, Hauke and Zoller [Science Advances, 1(9)e1500838, (2015)] have proposed a quantum annealing architecture, in which a classical spin glass with all-to-all connectivity is simulated by a spin glass with geometrically local interactions. We interpret this architecture as a classical error-correcting code, which is highly robust against weakly correlated bit-flip noise, and we analyze the code's performance using a belief-propagation decoding algorithm. Our observations may also apply to more general encoding schemes and noise models.
arXiv comment4 pages, 4 figure, We expanded the discussion of LDPC codes and belief propagation decoders to make the paper more self contained
References in corpus (7)
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum annealing with more than one hundred qubits
- Architectural considerations in the design of a superconducting quantum annealing processor
- Error correcting codes for adiabatic quantum computation
- Towards Fault Tolerant 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
Cited by in corpus (25)
- Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
- Autonomous Quantum Error Correction and Application to Quantum Sensing with Trapped Ions
- Energetic cost of Hamiltonian quantum gates
- Building an iterative heuristic solver for a quantum annealer
- Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer
- High-accuracy Ising machine using Kerr-nonlinear parametric oscillators with local four-body interactions
- Scaling overhead of embedding optimization problems in quantum annealing
- Parity Quantum Optimization: Compiler
- 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
- Universal Parity Quantum Computing
- Encoding-Independent Optimization Problem Formulation for Quantum Computing
- Quantum optics and frontiers of physics: The third quantum revolution
- The three phases of quantum annealing: fast, slow, and very slow
- Parity Quantum Optimization: Encoding Constraints
- Universal Quantum Optimization with Cold Atoms in an Optical Cavity
- Applications of Universal Parity Quantum Computation
- Scalable Parity Architecture With a Shuttling-Based Spin Qubit Processor
- Fault-tolerant quantum computing with the parity code and noise-biased qubits
- Assessing the performance of quantum annealing with nonlinear driving
- Four-body coupler for superconducting qubits based on Josephson parametric oscillators
- Practical hybrid decoding scheme for parity-encoded spin systems
- Improving success probability in the LHZ parity embedding by computing with quantum walks
- 2D implementation of quantum annealing algorisms for fourth order binary optimization problems