Using copies to improve precision in continuous-time quantum computing
arXiv:2206.02545 · doi:10.1088/2058-9565/acdcb5
Abstract
In the quantum optimisation setting, we build on a scheme introduced by Young et al [PRA 88, 062314, 2013], where physical qubits in multiple copies of a problem encoded into an Ising spin Hamiltonian are linked together to increase the logical system's robustness to error. We introduce several innovations that improve this scheme significantly. First, we note that only one copy needs to be correct by the end of the computation, since solution quality can be checked efficiently. Second, we find that ferromagnetic links do not generally help in this "one correct copy" setting, but anti-ferromagnetic links do help on average, by suppressing the chance of the same error being present on all of the copies. Third, we find that minimum-strength anti-ferromagnetic links perform best, by counteracting the spin-flips induced by the errors. We have numerically tested our innovations on small instances of spin glasses from Callison et al [NJP 21, 123022, 2019], and we find improved error tolerance for three or more copies in configurations that include frustration. Interpreted as an effective precision increase, we obtain several extra bits of precision for three copies connected in a triangle. This provides proof-of-concept of a method for scaling quantum annealing beyond the precision limits of hardware, a step towards fault tolerance in this setting.
arXiv comment15 pages, 12 figures
References in corpus (51)
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum Computation and Decision Trees
- Spatial search by quantum walk
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Surface code quantum computing by lattice surgery
- Quantum Computation by Adiabatic Evolution
- What is the Computational Value of Finite Range Tunneling?
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- Fault-tolerant quantum computation with long-range correlated noise
- Computational Role of Multiqubit Tunneling in a Quantum Annealer
- Error corrected quantum annealing with hundreds of qubits
- Entanglement in a quantum annealing processor
- Controllable coupling of superconducting flux qubits
- Error correcting codes for adiabatic quantum computation
- Towards Fault Tolerant Adiabatic Quantum Computation
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Fault-tolerant quantum computation
- Zeno effect for quantum computation and control
- Quantum annealing correction for random Ising problems
- Quantum Annealing Correction with Minor Embedding
- Coherence-Preserving Quantum Bits
- Continuous quantum error correction by cooling
- 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
- Nested Quantum Annealing Correction
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Error suppression and error correction in adiabatic quantum computation II: non-equilibrium dynamics
- Finding spin-glass ground states using quantum walks
- Quantum annealing correction at finite temperature: ferromagnetic -spin models
- Performance of two different quantum annealing correction codes
- Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
- An energetic perspective on rapid quenches in quantum annealing
- Mean Field Analysis of Quantum Annealing Correction
- Error suppression for Hamiltonian-based quantum computation using subsystem codes
- High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
- Improved Boltzmann machines with error corrected quantum annealing
- Non-commuting two-local Hamiltonians for quantum error suppression
- Scalable effective temperature reduction for quantum annealers via nested quantum annealing correction
- Nested Quantum Annealing Correction at Finite Temperature: -spin models
- Quantum error suppression with commuting Hamiltonians: Two-local is too local
- A family of [[6k, 2k, 2]] codes for practical, scalable adiabatic quantum computation
- Continuous quantum error correction for evolution under time-dependent Hamiltonians
- Error suppression in adiabatic quantum computing with qubit ensembles
- Error Suppression for Hamiltonian Quantum Computing in Markovian Environments
- Retrieving the ground state of spin glasses using thermal noise: Performance of quantum annealing at finite temperatures
- Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes
- Error measurements for a quantum annealer using the one-dimensional Ising model with twisted boundaries
- Exponential suppression of decoherence and relaxation of quantum systems using energy penalty
- Robust universal Hamiltonian quantum computing using two-body interactions