A closed-form resource estimation tool for concatenated quantum error correction reveals that magic-state operations rarely dominate qubit costs, with general optimizations providing orders-of-magnitude larger reductions than magic-specific ones.
Quantum error correction with only two extra qubits
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
Noise rates in quantum computing experiments have dropped dramatically, but reliable qubits remain precious. Fault-tolerance schemes with minimal qubit overhead are therefore essential. We introduce fault-tolerant error-correction procedures that use only two ancilla qubits. The procedures are based on adding "flags" to catch the faults that can lead to correlated errors on the data. They work for various distance-three codes. In particular, our scheme allows one to test the [[5,1,3]] code, the smallest error-correcting code, using only seven qubits total. Our techniques also apply to the [[7,1,3]] and [[15,7,3]] Hamming codes, thus allowing to protect seven encoded qubits on a device with only 17 physical qubits.
fields
quant-ph 2representative citing papers
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.
citing papers explorer
-
Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes
A closed-form resource estimation tool for concatenated quantum error correction reveals that magic-state operations rarely dominate qubit costs, with general optimizations providing orders-of-magnitude larger reductions than magic-specific ones.
-
Fire and ice: Partially fault-tolerant quantum computing with selective state filtering
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.