Non-commuting two-local Hamiltonians for quantum error suppression

Abstract

Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge. Enabling error suppression with two-local Hamiltonians is particularly challenging. A no-go theorem of Marvian and Lidar [Physical Review Letters 113(26), 260504 (2014)] demonstrates that, even allowing particles with high Hilbert-space dimension, it is impossible to protect quantum information from single-site errors by encoding in the ground subspace of any Hamiltonian containing only commuting two-local terms. Here, we get around this no-go result by encoding in the ground subspace of a Hamiltonian consisting of non-commuting two-local terms arising from the gauge operators of a subsystem code. Specifically, we show how to protect stored quantum information against single-qubit errors using a Hamiltonian consisting of sums of the gauge generators from Bacon-Shor codes [Physical Review A 73(1), 012340 (2006)] and generalized-Bacon-Shor code [Physical Review A 83(1), 012320 (2011)]. Our results imply that non-commuting two-local Hamiltonians have more error-suppressing power than commuting two-local Hamiltonians. While far from providing full fault tolerance, this approach improves the robustness achievable in near-term implementable quantum storage and adiabatic quantum computations, reducing the number of higher-order terms required to encode commonly used adiabatic Hamiltonians such as the Ising Hamiltonians common in adiabatic quantum optimization and quantum annealing.

25 pages, 9 figures

References in corpus (6)

• The Quantum Internet
• Subsystem fault tolerance with the Bacon-Shor code
• Error corrected quantum annealing with hundreds of qubits
• Error suppression and error correction in adiabatic quantum computation I: techniques and challenges
• Symmetry properties and spectra of the two-dimensional quantum compass model
• Quantum error suppression with commuting Hamiltonians: Two-local is too local

Cited by in corpus (23)

• Demonstration of a scaling advantage for a quantum annealer over simulated annealing
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Reliability of lattice gauge theories
• Temperature scaling law for quantum annealing optimizers
• Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations
• Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability
• Improved Boltzmann machines with error corrected quantum annealing
• Scaling Advantage in Approximate Optimization with Quantum Annealing
• Nested Quantum Annealing Correction at Finite Temperature: $p$-spin models
• Error correcting Bacon-Shor code with continuous measurement of noncommuting operators
• The three phases of quantum annealing: fast, slow, and very slow
• Error Suppression for Hamiltonian Quantum Computing in Markovian Environments
• Superconducting qubit circuit emulation of a vector spin-1/2
• Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes
• Quantum annealing with twisted fields
• Quantum annealing with a nonvanishing final value of the transverse field
• Investigating the potential for a limited quantum speedup on protein lattice problems
• Demonstration of error-suppressed quantum annealing via boundary cancellation
• Using copies to improve precision in continuous-time quantum computing
• Engineering Precise and Robust Effective Hamiltonians
• Reducing quantum annealing biases for solving the graph partitioning problem
• Families of $d=2$ 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions