Optimal correction of concatenated fault-tolerant quantum codes

Abstract

We present a method of concatenated quantum error correction in which improved classical processing is used with existing quantum codes and fault-tolerant circuits to more reliably correct errors. Rather than correcting each level of a concatenated code independently, our method uses information about the likelihood of errors having occurred at lower levels to maximize the probability of correctly interpreting error syndromes. Results of simulations of our method applied to the [[4,1,2]] subsystem code indicate that it can correct a number of discrete errors up to half of the distance of the concatenated code, which is optimal.

7 pages, 2 figures, published version

References in corpus (7)

• Topological fault-tolerance in cluster state quantum computation
• Subsystem fault tolerance with the Bacon-Shor code
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• Quantum accuracy threshold for concatenated distance-3 codes
• The Fibonacci scheme for fault-tolerant quantum computation
• Accuracy threshold for concatenated error detection in one dimension
• Message passing in fault tolerant quantum error correction

Cited by in corpus (5)

• Fault-tolerant thresholds for quantum error correction with the surface code
• A logical qubit in a linear array of semiconductor quantum dots
• High-threshold topological quantum error correction against biased noise
• Quantum codes do not fix isotropic errors
• Performance and Error Analysis of Knill's Postselection Scheme in a Two-Dimensional Architecture