Using copies to improve precision in continuous-time quantum computing

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.

15 pages, 12 figures

References in corpus (16)

• Spatial search by quantum walk
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Controllable coupling of superconducting flux qubits
• Towards Fault Tolerant Adiabatic Quantum Computation
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Quantum annealing correction for random Ising problems
• Quantum annealing correction at finite temperature: ferromagnetic $p$-spin models
• 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
• High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
• Improved Boltzmann machines with error corrected quantum annealing
• Quantum error suppression with commuting Hamiltonians: Two-local is too local
• Continuous quantum error correction for evolution under time-dependent Hamiltonians
• Error suppression in adiabatic quantum computing with qubit ensembles
• Error measurements for a quantum annealer using the one-dimensional Ising model with twisted boundaries
• Robust universal Hamiltonian quantum computing using two-body interactions

Cited by in corpus (2)

• 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