Error suppression for Hamiltonian-based quantum computation using subsystem codes

Understand

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.