Error Suppression for Hamiltonian-Based Quantum Computation Using Subsystem Codes

Milad Marvian and Daniel A. Lidar

Phys. Rev. Lett. 118, 030504 – Published 20 January 2017

Abstract

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.

Received 6 July 2016

DOI:https://doi.org/10.1103/PhysRevLett.118.030504

Physics Subject Headings (PhySH)

Quantum computation Quantum error correction

Quantum Information, Science & Technology

Authors & Affiliations

Milad Marvian^1,2 and Daniel A. Lidar^1,4,2,3

¹Department of Electrical Engineering, University of Southern California, Los Angeles, California 90089, USA
²Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, California 90089, USA
³Department of Physics and Astronomy, University of Southern California, Los Angeles, California 90089, USA
⁴Department of Chemistry, University of Southern California, Los Angeles, California 90089, USA