Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes

Abstract

Adiabatic quantum computing (AQC) can be protected against thermal excitations via an encoding into error detecting codes, supplemented with an energy penalty formed from a sum of commuting Hamiltonian terms. Earlier work showed that it is possible to suppress the initial thermally induced excitation out of the encoded ground state, in the case of local Markovian environments, by using an energy penalty strength that grows only logarithmically in the system size, at a fixed temperature. The question of whether this result applies beyond the initial time was left open. Here we answer this in the affirmative. We show that thermal excitations out of the encoded ground state can be suppressed at arbitrary times under the additional assumption that the total evolution time is polynomial in the system size. Thus, computational problems that can be solved efficiently using AQC in a closed system setting, can still be solved efficiently subject to coupling to a thermal environment. Our construction uses stabilizer subspace codes, which require at least $4$-local interactions to achieve this result.

10 pages, 1 figure

References in corpus (11)

• Bounds for the adiabatic approximation with applications to quantum computation
• Realizable Hamiltonians for Universal Adiabatic Quantum Computers
• Decoherence in adiabatic quantum computation
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Towards Fault Tolerant Adiabatic Quantum Computation
• Decoherence in a scalable adiabatic quantum computer
• Intrinsic geometry of quantum adiabatic evolution and quantum phase transitions
• The quantum adiabatic search with decoherence in the instantaneous energy eigenbasis
• High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
• Quantum error suppression with commuting Hamiltonians: Two-local is too local
• Decoherence induced deformation of the ground state in adiabatic quantum computation

Cited by in corpus (6)

• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Improved Boltzmann machines with error corrected quantum annealing
• Demonstration of error-suppressed quantum annealing via boundary cancellation
• Robust universal Hamiltonian quantum computing using two-body interactions
• Using copies to improve precision in continuous-time quantum computing
• Families of $d=2$ 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions