A family of [[6k, 2k, 2]] codes for practical, scalable adiabatic quantum computation

Abstract

In this work, we introduce a new family of [[6k, 2k, 2]] codes designed specifically to be compatible with adiabatic quantum computation. These codes support computationally universal sets of weight-two logical operators and are particularly well-suited for implementing dynamical decoupling error suppression. For Hamiltonians embeddable on a planar graph of fixed degree, our encoding maintains a planar connectivity graph and increase the graph degree by only two. These codes are the first known to possess these features.

(Changes include clarifying fidelity analysis and adding a new subsection on limitations) 5 pages, 3 figures

References in corpus (6)

• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• Realizable Hamiltonians for Universal Adiabatic Quantum Computers
• Towards Fault Tolerant Adiabatic Quantum Computation
• Error suppression and error correction in adiabatic quantum computation I: techniques and challenges
• Error suppression and error correction in adiabatic quantum computation II: non-equilibrium dynamics

Cited by in corpus (17)

• Decoherence in adiabatic quantum computation
• Quantum annealing correction for random Ising problems
• Quantum Annealing Correction with Minor Embedding
• Nested Quantum Annealing Correction
• Quantum annealing correction at finite temperature: ferromagnetic $p$-spin models
• Performance of two different quantum annealing correction codes
• Mean Field Analysis of Quantum Annealing Correction
• Scaling Advantage in Approximate Optimization with Quantum Annealing
• Scalable effective temperature reduction for quantum annealers via nested quantum annealing correction
• Quantum error suppression with commuting Hamiltonians: Two-local is too local
• Nested Quantum Annealing Correction at Finite Temperature: $p$-spin models
• Error Suppression for Hamiltonian Quantum Computing in Markovian Environments
• Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes
• Error measurements for a quantum annealer using the one-dimensional Ising model with twisted boundaries
• Quantum annealing with a nonvanishing final value of the transverse field
• 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