Error suppression for Hamiltonian-based quantum computation using subsystem codes

Abstract

We present general conditions for quantum error suppression for Hamiltonian-based quantum computation using subsystem codes. This involves encoding the Hamiltonian performing the computation using an error detecting subsystem code and the addition of a penalty term that commutes with the encoded Hamiltonian. The scheme is general and includes the stabilizer formalism of both subspace and subsystem codes as special cases. We derive performance bounds and show that complete error suppression results in the large penalty limit. To illustrate the power of subsystem-based error suppression, we introduce fully 2-local constructions for protection of the swap gate of adiabatic gate teleportation and the Ising chain in a transverse field.

5+8 pages, 1 figure, results updated to include non-additive codes, published version

References in corpus (6)

• Universal computation by multi-particle quantum walk
• Towards Fault Tolerant Adiabatic Quantum Computation
• Codeword Stabilized Quantum Codes
• A simple family of nonadditive quantum codes
• Quantum error suppression with commuting Hamiltonians: Two-local is too local
• Codeword stabilized quantum codes on subsystems

Cited by in corpus (27)

• Perspectives of quantum annealing: Methods and implementations
• Demonstration of a scaling advantage for a quantum annealer over simulated annealing
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Temperature scaling law for quantum annealing optimizers
• Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
• Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability
• Quantum annealing correction at finite temperature: ferromagnetic $p$-spin models
• Handling Leakage with Subsystem Codes
• Improved Boltzmann machines with error corrected quantum annealing
• Scaling Advantage in Approximate Optimization with Quantum Annealing
• Scalable effective temperature reduction for quantum annealers via nested quantum annealing correction
• Nested Quantum Annealing Correction at Finite Temperature: $p$-spin models
• Continuous quantum error correction for evolution under time-dependent Hamiltonians
• The three phases of quantum annealing: fast, slow, and very slow
• Error Suppression for Hamiltonian Quantum Computing in Markovian Environments
• 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
• Demonstration of error-suppressed quantum annealing via boundary cancellation
• Investigating the potential for a limited quantum speedup on protein lattice problems
• Using copies to improve precision in continuous-time quantum computing
• Robust universal Hamiltonian quantum computing using two-body interactions
• Suppressing decoherence in quantum state transfer with unitary operations
• Continuous quantum correction on Markovian and Non-Markovian models
• Suppression of effective noise in Hamiltonian simulations
• Families of $d=2$ 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions