Quantum error suppression with commuting Hamiltonians: Two-local is too local

Abstract

We consider error suppression schemes in which quantum information is encoded into the ground subspace of a Hamiltonian comprising a sum of commuting terms. Since such Hamiltonians are gapped they are considered natural candidates for protection of quantum information and topological or adiabatic quantum computation. However, we prove that they cannot be used to this end in the 2-local case. By making the favorable assumption that the gap is infinite we show that single-site perturbations can generate a degeneracy splitting in the ground subspace of this type of Hamiltonians which is of the same order as the magnitude of the perturbation, and is independent of the number of interacting sites and their Hilbert space dimensions, just as in the absence of the protecting Hamiltonian. This splitting results in decoherence of the ground subspace, and we demonstrate that for natural noise models the coherence time is proportional to the inverse of the degeneracy splitting. Our proof involves a new version of the no-hiding theorem which shows that quantum information cannot be approximately hidden in the correlations between two quantum systems, and should be of independent interest. The main reason that 2-local commuting Hamiltonians cannot be used for quantum error suppression is that their ground subspaces have only short-range (two-body) entanglement.

4 pages+5 pages supplementary material, Minor clean up in the appendix and references in v2

References in corpus (32)

• Fault-tolerant quantum computation by anyons
• Topological quantum memory
• Encoding a qubit in an oscillator
• How to share a quantum secret
• A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
• Holonomic Quantum Computation
• Local stabilizer codes in three dimensions without string logical operators
• Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
• Virtual Quantum Subsystems
• A Unified and Generalized Approach to Quantum Error Correction
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• Quantum information cannot be completely hidden in correlations: implications for the black-hole information paradox
• Tradeoffs for reliable quantum information storage in 2D systems
• Topological Order at Non-zero Temperature
• Error correcting codes for adiabatic quantum computation
• Towards Fault Tolerant Adiabatic Quantum Computation
• General conditions for approximate quantum error correction and near-optimal recovery channels
• Combining dynamical decoupling with fault-tolerant quantum computation
• Optimum Quantum Error Recovery using Semidefinite Programming
• On Random Unitary Channels
• A simple approach to approximate quantum error correction based on the transpose channel
• Feasibility of self-correcting quantum memory and thermal stability of topological order
• Structure of 2D Topological Stabilizer Codes
• Topological Protection and Quantum Noiseless Subsystems
• Robust Quantum Error Correction via Convex Optimization
• Unification and limitations of error suppression techniques for adiabatic quantum computing
• Error suppression and error correction in adiabatic quantum computation I: techniques and challenges
• Thermodynamic stability criteria for a quantum memory based on stabilizer and subsystem codes
• Logical operator tradeoff for local quantum codes
• Complementarity of Private and Correctable Subsystems in Quantum Cryptography and Error Correction
• Self-Correcting Quantum Memories Beyond the Percolation Threshold
• A family of [[6k, 2k, 2]] codes for practical, scalable adiabatic quantum computation

Cited by in corpus (18)

• Decoherence in adiabatic quantum computation
• Quantum Annealing Correction with Minor Embedding
• Quantum speed limits for leakage and decoherence
• Quantum annealing correction at finite temperature: ferromagnetic $p$-spin models
• Performance of two different quantum annealing correction codes
• Error suppression for Hamiltonian-based quantum computation using subsystem codes
• Quantum storage in quantum ferromagnets
• 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: $p$-spin models
• Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes
• Quantum annealing with a nonvanishing final value of the transverse field
• Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians
• 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
• Suppressing decoherence in quantum state transfer with unitary operations
• Families of $d=2$ 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions