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

Bulletin of the American Physical Society

Error suppression for Hamiltonian-based quantum computation

Milad Marvian

Published Mar 9, 2018• 0 citations
OpenAlex

Related papers

Master Equations for Error-Suppressed Hamiltonian Quantum Computing

Humberto Munoz-Bauza, Daniel A. Lidar

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

Error Suppression in Continuous-time Quantum Computing

Jemma Bennett, Tom O’Leary, Mia West +2 more

Bulletin of the American Physical Society•Mar 16, 2021•0 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

Error suppression in Hamiltonian-based quantum computation using energy penalties

Adam D. Bookatz, Edward Farhi, Leo Zhou

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.

arXiv:1407.1485•Physical Review A•Aug 10, 2015•47 citations

Dynamical error suppression for quantum information processing

Kaveh Khodjasteh

•Jan 1, 2007•0 citations

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
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.
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.