Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics

2017/04/30 by Christopher Chamberland, Pavithran Iyer, David Poulin · 2 citations
Physics and Astronomy · #quant-ph

paper · pdf · doi:10.22331/q-2018-01-04-43

published as Quantum 2, 43 (2018) · 11 pages, 6 figures. Comments welcome! v2: Included version accepted to the Quantum journal

arxiv created 2017/12/25 · arxiv updated 2018/01/08

Abstract

We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our scheme offers a few improvements over previously existing solutions, for instance it does not require active error correction and results in a reduced error-correction overhead when error diagnostics is much slower than the gate time. In addition, we adapt our protocol to cases where the underlying error correction strategy chooses the optimal correction amongst all Clifford gates instead of the usual Pauli gates. The resulting Clifford frame protocol is of independent interest as it can increase error thresholds and could find applications in other areas of quantum computation.

Cited by

• Factoring 2048 bit RSA integers with a half-million-qubit modular atomic processor
• Feedforward suppression of readout-induced faults in quantum error correction

Related

• Opportunities and Challenges in Fault-Tolerant Quantum Computation
• Benchmarking the ability of a controller to execute quantum error corrected non-Clifford circuits
• Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
• Error-detection-based quantum fault tolerance against discrete Pauli noise
• Towards Demonstrating Fault Tolerance in Small Circuits Using Bacon-Shor Codes