Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1407.1485 · Physical Review A

Error suppression in Hamiltonian-based quantum computation using energy penalties

Adam D. Bookatz, Edward Farhi, Leo Zhou

Published Aug 10, 2015• 47 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.92.022317

Related papers

Control, gates, and error suppression with Hamiltonians in quantum computation

Adam D. Bookatz

In this thesis we are primarily interested in studying how to suppress errors, perform simulation, and implement logic gates in quantum computation within the context of using Hamiltonian controls. We also study the complexity class QMA-complete. We first investigate a method (introduced by Jordan, Farhi, and Shor) for suppressing environmentally induced errors in Hamiltonian-based quantum computation, involving encoding the system with a quantum error-detecting code and enforcing energy penalties against leaving the codespace. We prove that this method does work in principle: in the limit of infinitely large penalties, local errors are completely suppressed. We further derive bounds for the finite-penalty case and present numerical simulations suggesting that the method achieves even greater protection than these bounds indicate. We next consider the task of Hamiltonian simulation, i.e. effectively changing a system Hamiltonian to some other desired Hamiltonian by applying external time-dependent controls. We propose protocols for this task that rely solely on realistic bounded-strength control Hamiltonians. For systems coupled to an uncontrollable environment, our approach may be used to perform simulation while simultaneously suppressing unwanted decoherence. We also consider the scenario of removing unwanted couplings in many-body quantum systems obeying local system Hamiltonians and local environmental interactions. We present protocols for efficiently switching off the Hamiltonian of a system, i.e. simulating the zero Hamiltonian, using bounded-strength controls. To this end, we introduce the combinatorial concept of balanced-cycle orthogonal arrays, show how to construct them from classical error-correcting codes, and show how to use them to decouple n-qudit l-local Hamiltonians using protocols of length at most O(l-1 log n). We then present a scheme for implementing high-fidelity quantum gates using a few interacting bosons obeying a Bose-Hubbard Hamiltonian on a line. We find high-fidelity logic operations for a gate set (including the CNOT gate) that is universal for quantum information processing. Lastly, we discuss the quantum complexity class QMA-complete, surveying all known such problems, and we introduce the "quantum non-expander" problem, proving that it is QMA-complete. A quantum expander is a type of rapidly-mixing quantum channel; we show that estimating its mixing time is a co-QMA-complete problem.

•Jan 1, 2016•0 citations

Error suppression for Hamiltonian quantum computing in Markovian environments

Milad Marvian, Daniel A. Lidar

Hamiltonian quantum computing, such as the adiabatic and holonomic models, can be protected against decoherence using an encoding into stabilizer subspace codes for error detection and the addition of energy penalty terms. This method has been widely studied since it was first introduced by Jordan, Farhi, and Shor (JFS) in the context of adiabatic quantum computing. Here, we extend the original result to general Markovian environments, not necessarily in Lindblad form. We show that the main conclusion of the original JFS study holds under these general circumstances: Assuming a physically reasonable bath model, it is possible to suppress the initial decay out of the encoded ground state with an energy penalty strength that grows only logarithmically in the system size, at a fixed temperature.

arXiv:1612.01633•Physical Review A•Mar 3, 2017•17 citations

Error Suppression for Hamiltonian-Based Quantum Computation Using Subsystem Codes

Milad Marvian, Daniel A. Lidar

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.

arXiv:1606.03795•Physical Review Letters•Jan 20, 2017•34 citations

Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes

Daniel A. Lidar

Adiabatic quantum computing (AQC) can be protected against thermal excitations via an encoding into error-detecting codes, supplemented with an energy penalty formed from a sum of commuting Hamiltonian terms. Earlier work showed that it is possible to suppress the initial thermally induced excitation out of the encoded ground state, in the case of local Markovian environments, by using an energy-penalty strength that grows only logarithmically in system size, at a fixed temperature. The question of whether this result applies beyond the initial time was left open. Here we answer this in the affirmative. We show that thermal excitations out of the encoded ground state can be suppressed at arbitrary times under the additional assumption that the total evolution time is polynomial in the system size. Thus, computational problems that can be solved efficiently by using AQC in a closed system setting can still be solved efficiently subject to coupling to a thermal environment. Our construction uses stabilizer subspace codes, which require at least 4-local interactions to achieve this result.

arXiv:1904.12028•Physical Review A•Aug 20, 2019•10 citations

Exponential suppression of decoherence and relaxation of quantum systems using energy penalty

Iman Marvian

One of the main methods for protecting quantum information against decoherence is to encode information in the ground subspace (or the low energy sector) of a Hamiltonian with a large energy gap which penalizes errors from environment. The protecting Hamiltonian is chosen such that its degenerate ground subspace is an error detecting code for the errors caused by the interaction with the environment. We consider environments with arbitrary number of local sites, e.g. spins, whose interactions among themselves are local and bounded. Then, assuming the system is interacting with a finite number of sites in the environment, we prove that, up to second order with respect to the coupling constant, decoherence and relaxation are suppressed by a factor which grows exponentially fast with the ratio of energy penalty to the norm of local interactions in the environment. The state may, however, still evolve unitarily inside the code subspace due to the Lamb shift effect. In the context of adiabatic quantum computation, this means that the evolution inside the code subspace is effectively governed by a renormalized Hamiltonian. The result is derived from first principles, without use of master equations or their assumptions, and holds even in the infinite temperature limit. We also prove that unbounded or non-local interactions in the environment at sites far from the system do not considerably modify the exponential suppression. Our main technical tool is a new bound on the decay of power spectral density at high frequencies for local observables and many-body Hamiltonians with bounded and local interactions in a neighborhood around the support of the observable.

arXiv:1602.03251•APS March Meeting Abstracts•Feb 10, 2016•11 citations

Robust analog quantum simulators by quantum error-detecting codes

Yingkang Cao, Liu, Suying, Haowei Deng +3 more

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.

arXiv:2412.07764•Dec 10, 2024•5 citations
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 this thesis we are primarily interested in studying how to suppress errors, perform simulation, and implement logic gates in quantum computation within the context of using Hamiltonian controls. We also study the complexity class QMA-complete. We first investigate a method (introduced by Jordan, Farhi, and Shor) for suppressing environmentally induced errors in Hamiltonian-based quantum computation, involving encoding the system with a quantum error-detecting code and enforcing energy penalties against leaving the codespace. We prove that this method does work in principle: in the limit of infinitely large penalties, local errors are completely suppressed. We further derive bounds for the finite-penalty case and present numerical simulations suggesting that the method achieves even greater protection than these bounds indicate. We next consider the task of Hamiltonian simulation, i.e. effectively changing a system Hamiltonian to some other desired Hamiltonian by applying external time-dependent controls. We propose protocols for this task that rely solely on realistic bounded-strength control Hamiltonians. For systems coupled to an uncontrollable environment, our approach may be used to perform simulation while simultaneously suppressing unwanted decoherence. We also consider the scenario of removing unwanted couplings in many-body quantum systems obeying local system Hamiltonians and local environmental interactions. We present protocols for efficiently switching off the Hamiltonian of a system, i.e. simulating the zero Hamiltonian, using bounded-strength controls. To this end, we introduce the combinatorial concept of balanced-cycle orthogonal arrays, show how to construct them from classical error-correcting codes, and show how to use them to decouple n-qudit l-local Hamiltonians using protocols of length at most O(l-1 log n). We then present a scheme for implementing high-fidelity quantum gates using a few interacting bosons obeying a Bose-Hubbard Hamiltonian on a line. We find high-fidelity logic operations for a gate set (including the CNOT gate) that is universal for quantum information processing. Lastly, we discuss the quantum complexity class QMA-complete, surveying all known such problems, and we introduce the "quantum non-expander" problem, proving that it is QMA-complete. A quantum expander is a type of rapidly-mixing quantum channel; we show that estimating its mixing time is a co-QMA-complete problem.
Hamiltonian quantum computing, such as the adiabatic and holonomic models, can be protected against decoherence using an encoding into stabilizer subspace codes for error detection and the addition of energy penalty terms. This method has been widely studied since it was first introduced by Jordan, Farhi, and Shor (JFS) in the context of adiabatic quantum computing. Here, we extend the original result to general Markovian environments, not necessarily in Lindblad form. We show that the main conclusion of the original JFS study holds under these general circumstances: Assuming a physically reasonable bath model, it is possible to suppress the initial decay out of the encoded ground state with an energy penalty strength that grows only logarithmically in the system size, at a fixed temperature.
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.
Adiabatic quantum computing (AQC) can be protected against thermal excitations via an encoding into error-detecting codes, supplemented with an energy penalty formed from a sum of commuting Hamiltonian terms. Earlier work showed that it is possible to suppress the initial thermally induced excitation out of the encoded ground state, in the case of local Markovian environments, by using an energy-penalty strength that grows only logarithmically in system size, at a fixed temperature. The question of whether this result applies beyond the initial time was left open. Here we answer this in the affirmative. We show that thermal excitations out of the encoded ground state can be suppressed at arbitrary times under the additional assumption that the total evolution time is polynomial in the system size. Thus, computational problems that can be solved efficiently by using AQC in a closed system setting can still be solved efficiently subject to coupling to a thermal environment. Our construction uses stabilizer subspace codes, which require at least 4-local interactions to achieve this result.
One of the main methods for protecting quantum information against decoherence is to encode information in the ground subspace (or the low energy sector) of a Hamiltonian with a large energy gap which penalizes errors from environment. The protecting Hamiltonian is chosen such that its degenerate ground subspace is an error detecting code for the errors caused by the interaction with the environment. We consider environments with arbitrary number of local sites, e.g. spins, whose interactions among themselves are local and bounded. Then, assuming the system is interacting with a finite number of sites in the environment, we prove that, up to second order with respect to the coupling constant, decoherence and relaxation are suppressed by a factor which grows exponentially fast with the ratio of energy penalty to the norm of local interactions in the environment. The state may, however, still evolve unitarily inside the code subspace due to the Lamb shift effect. In the context of adiabatic quantum computation, this means that the evolution inside the code subspace is effectively governed by a renormalized Hamiltonian. The result is derived from first principles, without use of master equations or their assumptions, and holds even in the infinite temperature limit. We also prove that unbounded or non-local interactions in the environment at sites far from the system do not considerably modify the exponential suppression. Our main technical tool is a new bound on the decay of power spectral density at high frequencies for local observables and many-body Hamiltonians with bounded and local interactions in a neighborhood around the support of the observable.
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 222-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 222-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 111- and 222-dimensional many-body spin models, potentially extending the duration of high-fidelity simulation by orders of magnitude in current hardware.