Fault-Tolerant Syndrome Extraction and Cat State Preparation with Fewer Qubits

  title={Fault-Tolerant Syndrome Extraction and Cat State Preparation with Fewer Qubits},
  author={Prithviraj Prabhu and Ben Reichardt},
We reduce the extra qubits needed for two fault-tolerant quantum computing protocols: error correction, specifically syndrome bit measurement, and cat state preparation. For fault-tolerant syndrome extraction, we show an exponential reduction in qubit overhead over the previous best protocol. For a weight-w stabilizer, we demonstrate that stabilizer measurement tolerating one fault (distance-three) needs at most ⌈log2 w⌉ + 1 ancillas. If qubits reset quickly, four ancillas suffice. We also… Expand

Figures and Tables from this paper


Fault-tolerant quantum computation with few qubits
It is demonstrated that carefully designed circuits where gates are replaced with “gadgets”—gates involving extra qubits to catch error propagation—ensure useful fault-tolerant operations on logical qubits, which may make it possible to run Fault-tolerance operations on near-term, small quantum computers. Expand
Fault-Tolerant Quantum Computation
Fault tolerance techniques will be essential for achieving the considerable potential of quantum computers and will need to control high noise rates and do so with low overhead, since qubits are expensive. Expand
Quantum Error Correction with Only Two Extra Qubits.
Fault-tolerant error-correction procedures that use only two extra qubits are introduced, based on adding "flags" to catch the faults that can lead to correlated errors on the data. Expand
Fault-tolerant error correction (EC) is desirable for performing large quantum computations. In this disclosure, example fault-tolerant EC protocols are disclosed that use flag circuits, which signalExpand
Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
This work modify minimum weight perfect matching decoding to efficiently and scalably incorporate information from measurements of the flag qubits and correct up to the full code distance while respecting the limited connectivity. Expand
Efficient fault-tolerant decoding of topological color codes
Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promisingExpand
Effective fault-tolerant quantum computation with slow measurements.
It is argued that measurement times as long as even 1000 gate times or more have a very minimal effect on the quantum accuracy threshold, showing that slow measurement poses no essential obstacle to scalability. Expand
The surface code with a twist
A patch-based encoding involving a modified twist of defect-based logical encodings of a new variety called twists is investigated, and the smallest triangle code can demonstrate high-pseudothreshold fault-tolerance to depolarizing noise using just 13 physical qubits. Expand
Active Stabilization, Quantum Computation, and Quantum State Synthesis
Active stabilization of a quantum system is the active suppression of noise (such as decoherence) in the system, without disrupting its unitary evolution. Quantum error correction suggests theExpand
Quantum communication
  • N. Gisin, H. Zbinden
  • Computer Science, Physics
  • 2017 Optical Fiber Communications Conference and Exhibition (OFC)
  • 2017
World specialists will talk about reliability tests in quantum networks; about quantum hacking, its importance and limitations, and its role in classical and quantum cryptography; about high rate and about low cost QKD systems; about free space quantum communication; and about future quantum repeaters for continental scale quantum communication. Expand