Robust universal Hamiltonian quantum computing using two-body interactions
arXiv:1911.01354
Abstract
We present a new scheme to perform noise resilient universal adiabatic quantum computation using two-body interactions. To achieve this, we introduce a new family of error detecting subsystem codes whose gauge generators and a set of their logical operators - capable of encoding universal Hamiltonian computations - can be implemented using two-body interactions. Logical operators of the code are used to encode any given computational Hamiltonian, and the gauge operators are used to construct a penalty Hamiltonian whose ground subspace is protected against local-errors. In contrast to previous approaches, the constructed penalty Hamiltonian does not necessarily commute with the encoded computational Hamiltonians, but for our construction, the undesirable effect of the penalty Hamiltonian on the computation can be compensated by a simple modification of the implemented Hamiltonians. We also investigate whether a similar scheme can be constructed by encoding the computational Hamiltonian using only bare-logical operators of subsystem codes, to guarantee that computational Hamiltonian commutes with the penalty Hamiltonian. We prove a no-go theorem showing that restricting to two-body interactions and using any general CSS-type subsystem codes, such a construction cannot encode systems beyond an Ising chain in a transverse field. We point out that such a chain is universal for Hamiltonian-based quantum computation, but it is not universal for ground-state quantum computation.
comments welcome
References in corpus (18)
- Adiabatic Quantum Computing
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- Robustness of adiabatic quantum computation
- Stabilizer Formalism for Operator Quantum Error Correction
- Quantum tensor product structures are observable-induced
- Error correcting codes for adiabatic quantum computation
- Quantum approximate optimization is computationally universal
- Subsystem codes with spatially local generators
- Simple Pulses for Universal Quantum Computation with a Heisenberg ABAB Chain
- Error suppression for Hamiltonian-based quantum computation using subsystem codes
- Direct measurement of Bacon-Shor code stabilizers
- Symmetry properties and spectra of the two-dimensional quantum compass model
- Quantum error suppression with commuting Hamiltonians: Two-local is too local
- Error Suppression for Hamiltonian Quantum Computing in Markovian Environments
- Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes
- Optimal quantum subsystem codes in 2-dimensions
- Spectra of Gauge Code Hamiltonians