[This seminar will be at the Marriott Conference Center] Error suppression for Hamiltonian quantum computation
This seminar will be at the Marriott Conference Center, at the QEC Conference
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 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. We illustrate the power of subsystem-based error suppression with several examples of two-local constructions for protection against local errors, which circumvent an earlier no-go theorem about two-local commuting Hamiltonians. We also discuss the generalization of the quantum error suppression results of Jordan, Farhi, and Shor to arbitrary Markovian dynamics. In this setting we show that 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.
Joint work with Milad Marvian:
PRL 118, 030504 (2017)
PRA 95, 032302 (2017)
*THERE WILL BE NO LUNCH OR TEA*
Subscribe to A Quantum Bit
Quantum physics began with revolutionary discoveries in the early twentieth century and continues to be central in today’s physics research. Learn about quantum physics, bit by bit. From definitions to the latest research, this is your portal. Subscribe to receive regular emails from the quantum world. Previous Issues...
Sign Up Now
Sign up to receive A Quantum Bit in your email!