Quantum Error Correction Implementation after Multiple Gates

Abstract

Correcting errors is a vital but expensive component of fault tolerant quantum computation. Standard fault tolerant protocol assumes the implementation of error correction, via syndrome measurements and possible recovery operations, after every quantum gate. In fact, this is not necessary. Here we demonstrate that error correction should be applied more sparingly. We simulate encoded single-qubit rotations within the [[7,1,3]] code and show via fidelity measures that applying error correction after every gate is not desirable.

updated - 5 pages, 2 figures

References in corpus (6)

• Fault-tolerant quantum computation against biased noise
• Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
• Local Fault-tolerant Quantum Computation
• A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
• Optimising the Solovay-Kitaev algorithm
• Non-Fault Tolerant T-Gates for the [7,1,3] Quantum Error Correction Code

Cited by in corpus (4)

• Using quantum routers to implement quantum message authentication and Bell-state manipulation
• Quantum Error Correction During 50 Gates
• Optimizing the Frequency of Quantum Error Correction using the [[7,1,3]] Steane Code
• Syndrome Measurement Order for the [[7,1,3]] Quantum Error Correction Code