2016/06/30 by Milad Marvian, Daniel Lidar, Daniel A. Lidar · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Adiabatic process #Adiabatic quantum computation #Algorithm #Computation #Computer science #Hamiltonian (control theory) #Mathematical optimization #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #Quantum computer #Quantum error correction #Quantum mechanics #Subspace topology #quant-ph
paper · pdf · doi:10.1103/physrevlett.118.030504
published as Phys. Rev. Lett. 118, 030504 (2017) · 5+8 pages, 1 figure, results updated to include non-additive codes, published version
openalex publication_date 2017/01/20 · arxiv created 2017/08/12 · arxiv updated 2017/08/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
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.