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.
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.
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 two-local constructions for protection against local errors of the swap gate of adiabatic gate teleportation and the Ising chain in a transverse field.
Achieving noise resilience is an outstanding challenge in Hamiltonian-based quantum computation. To this end, energy-gap protection provides a promising approach, where the desired quantum dynamics are encoded into the ground space of a penalty Hamiltonian that suppresses unwanted noise processes. However, existing approaches either explicitly require high-weight penalty terms that are not directly accessible in current hardware, or utilize non-commuting 2-local Hamiltonians, which typically leads to an exponentially small energy gap. In this work, we provide a general recipe for designing error-resilient Hamiltonian simulations, making use of an excited encoding subspace stabilized by solely 2-local commuting Hamiltonians. Our results thus overcome a no-go theorem previously derived for ground-space encoding that prevents noise suppression schemes with such Hamiltonians. Importantly, our method is scalable as it only requires penalty terms that scale polynomially with system size. To illustrate the utility of our approach, we further apply this method to a variety of 1- and 2-dimensional many-body spin models, potentially extending the duration of high-fidelity simulation by orders of magnitude in current hardware.
We consider the use of quantum error-detecting codes, together with energy penalties against leaving the code space, as a method for suppressing environmentally induced errors in Hamiltonian-based quantum computation. This method was introduced in Jordan et al. [Phys. Rev. A 74, 052322 (2006)] in the context of quantum adiabatic computation, but we consider it more generally. Specifically, we consider a computational Hamiltonian, which has been encoded using the logical qubits of a single-qubit error-detecting code, coupled to an environment of qubits by interaction terms that act one-locally on the system. Additional energy penalty terms penalize states outside of the code space. We prove that in the limit of infinitely large penalties, one-local errors are completely suppressed, and we derive some bounds for the finite penalty case. Our proof technique involves exact integration of the Schrodinger equation, making no use of master equations or their assumptions. We perform long time numerical simulations on a small (one logical qubit) computational system coupled to an environment and the results suggest that the energy penalty method achieves even greater protection than our bounds indicate.
In the absence of fault tolerant quantum error correction for analog, Hamiltonian quantum computation, error suppression via energy penalties is an effective alternative. We construct families of distance- 2 stabilizer subsystem codes we call “trapezoid codes'', that are tailored for energy-penalty schemes. We identify a family of codes achieving the maximum code rate, and by slightly relaxing this constraint, uncover a broader range of codes with enhanced physical locality, thus increasing their practical applicability. Additionally, we provide an algorithm to map the required qubit connectivity graph into graphs compatible with the locality constraints of quantum hardware. Finally, we provide a systematic framework to evaluate the performance of these codes in terms of code rate, physical locality, graph properties, and penalty gap, enabling an informed selection of error-suppression codes for specific quantum computing applications. We identify the [[4k+2,2k,g,2]] family of subsystem codes as optimal in terms of code rate and penalty gap scaling.
We propose a scheme for a ground-code measurement-based quantum computer, which enjoys two major advantages. First, every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body interactions, so that it equips built-in robustness against noise. Second, computation is processed by single-spin measurements along multiple chains dynamically coupled on demand, so as to keep teleporting only logical information into a gap-protected ground state of the residual chains after the interactions with spins to be measured are turned off. We describe implementations using trapped atoms or polar molecules in an optical lattice, where the gap is expected to be as large as 0.2 or 4.8 kHz, respectively.
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 two-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 Hamiltonian 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. The main reason that two-local commuting Hamiltonians cannot be used for quantum error suppression is that their ground subspaces have only short-range (two-body) entanglement.