pith. sign in

arxiv: 1705.02329 · v1 · pith:7N2DR4IQnew · submitted 2017-05-05 · 🪐 quant-ph

Quantum error correction with only two extra qubits

classification 🪐 quant-ph
keywords qubitsonlycodecodesproceduresquantumsevenadding
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes

    quant-ph 2024-11 conditional novelty 7.0

    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 reducti...

  2. Fire and ice: Partially fault-tolerant quantum computing with selective state filtering

    quant-ph 2026-05 unverdicted novelty 5.0

    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.