Optimizing the Frequency of Quantum Error Correction using the [[7,1,3]] Steane Code

Abstract

A common assumption in analyses of error thresholds and quantum computing in general is that one applies fault-tolerant quantum error correction (FTQEC) after every gate. This, however, is known not to always be optimal if the FTQEC procedure itself can introduce errors. We investigate the effect of varying the number of logical gates between FTQEC operations, and in particular the case where failure of a postselection condition in FTQEC may cause FTQEC to be skipped with high probability. By using a simplified model of errors induced in FTQEC, we derive an expression for the logical error rate as a function of error-correction frequency, and show that in this model the optimal frequency is relatively insensitive to postselection failure probability for a large range of such probabilities. We compare the model to data derived from Monte Carlo simulation for the $[[7,1,3]]$ Steane code.

9 pages, 6 figures

References in corpus (9)

• Surface codes: Towards practical large-scale quantum computation
• Quantum Error Correction for Quantum Memories
• Optimum Quantum Error Recovery using Semidefinite Programming
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
• Quantum Error Correction via Convex Optimization
• Quantum Error Correction During 50 Gates
• Quantum Error Correction Implementation after Multiple Gates
• Relative performance of ancilla verification and decoding in the [[7,1,3]] Steane code

Cited by in corpus (1)

• An integrity measure to benchmark quantum error correcting memories