Pith. sign in

REVIEW 3 cited by

Increasing error tolerance in quantum computers with dynamic bias arrangement

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 2303.16122 v1 pith:KBO6QRYK submitted 2023-03-28 quant-ph

classification quant-ph
keywords biastoleranceerrorfusionquantumerrorsarchitecturearrangement
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Many quantum operations are expected to exhibit bias in the structure of their errors. Recent works have shown that a fixed bias can be exploited to improve error tolerance by statically arranging the errors in beneficial configurations. In some cases an error bias can be dynamically reconfigurable, an example being linear optical fusion where the basis of a fusion failure can be chosen before the measurement is made. Here we introduce methods for increasing error tolerance in this setting by using classical decision-making to adaptively choose the bias in measurements as a fault tolerance protocol proceeds. We study this technique in the setting of linear optical fusion based quantum computing (FBQC). We provide examples demonstrating that by dynamically arranging erasures, the loss tolerance can be tripled when compared to a static arrangement of biased errors while using the same quantum resources: we show that for the best FBQC architecture of Bartolucci et al. (2023) the threshold increases from $2.7\%$ to $7.5\%$ per photon with the same resource state by using dynamic biasing. Our method does not require any specific code structure beyond having a syndrome graph representation. We have chosen to illustrate these techniques using an architecture which is otherwise identical to that in Bartolucci et al. (2023), but deployed together with other techniques, such as different fusion networks, higher loss thresholds are possible.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Single-photon-boosted type-I fusion gates

    quant-ph 2026-03 unverdicted novelty 7.0 of 10

    A type-I fusion gate, boosted with four single-photon ancillas and passive linear optics, reaches 3/4 success probability via a distillation protocol.

  2. Quantifying Pauli Errors in Single-Photon Resource-State Generation

    quant-ph 2026-08 accept novelty 6.0 of 10

    A scheme that extracts Pauli error rates for emitter-generated photonic resource states from first-order coherence and cross-correlation measurements.

  3. Comparison of schemes for highly loss tolerant photonic fusion based quantum computing

    quant-ph 2025-06 conditional novelty 6.0 of 10

    A comparison of photonic fusion-based quantum computing schemes finds a loopy diamond network with 9% loss per photon threshold and proposes using 3-GHZ state counts as a better resource costing metric.

Pith tools