Pith. sign in

REVIEW 2 cited by

Teleportation-based Fault-tolerant Quantum Computation in Multi-qubit Large Block Codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1504.03913 v1 pith:7IGO4KXE submitted 2015-04-15 quant-ph

Teleportation-based Fault-tolerant Quantum Computation in Multi-qubit Large Block Codes

classification quant-ph
keywords codescomputationerrorquantumblockcodecorrectionfault-tolerant
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A major goal for fault-tolerant quantum computation (FTQC) is to reduce the overhead needed for error correction. One approach is to use block codes that encode multiple qubits, which can achieve significantly higher rates for the same code distance than single-qubit code blocks or topological codes. We present a scheme for universal quantum computation using multi-qubit Calderbank-Shor-Steane (CSS) block codes, where codes admitting different transversal gates are used to achieve universality, and logical teleportation is used to move qubits between code blocks. All circuits for both computation and error correction are transversal. We also argue that single shot fault-tolerant error correction can be done in Steane syndrome extraction. Then, we present estimates of information lifetime for a few possible codes, which suggests that highly nontrivial quantum computations can be achieved at reasonable error rates, using codes that require significantly less than 100 physical qubits per logical qubit.

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. Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates

    quant-ph 2026-02 accept novelty 7.0

    High-rate self-dual quantum Reed–Muller codes admit ancilla-free addressable Clifford gates generated by transversal H and fold-transversal phase gates.

  2. Quantum codes from classical annealing

    quant-ph 2026-07 conditional novelty 6.0

    A simulated-annealing search over CSS and SWEL stabilizer codes finds moderate-length codes (n≤50) with distances at or above the quantum Gilbert-Varshamov bound, and publishes the resulting stabilizers.