Pith. sign in

REVIEW 1 cited by

Fault-Tolerant Thresholds for Encoded Ancillae with Homogeneous Errors

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 quant-ph/0605192 v3 pith:TPCTDROV submitted 2006-05-22 quant-ph

Fault-Tolerant Thresholds for Encoded Ancillae with Homogeneous Errors

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

I describe a procedure for calculating thresholds for quantum computation as a function of error model given the availability of ancillae prepared in logical states with independent, identically distributed errors. The thresholds are determined via a simple counting argument performed on a single qubit of an infinitely large CSS code. I give concrete examples of thresholds thus achievable for both Steane and Knill style fault-tolerant implementations and investigate their relation to threshold estimates in the literature.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

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