Pith. sign in

REVIEW 1 cited by

Linear-optical quantum computation with arbitrary error-correcting 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 2408.04126 v3 pith:GASO2VEN submitted 2024-08-07 quant-ph

classification quant-ph
keywords codesquantumarbitrarylinear-opticalsurfacearchitecturebetterbias
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers but require efficient generation of non-local, many-body entanglement. We provide a linear-optical architecture with these properties, compatible with arbitrary codes and Gottesman-Kitaev-Preskill qubits on generic lattices, and featuring a natural way to leverage physical noise bias. Simulations of hyperbolic surface codes and bivariate bicycle codes, promising families of quantum low-density parity-check codes, reveal a threshold comparable to the 2D surface code with substantially better encoding rates.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Resource-efficient high-threshold fault-tolerant quantum computation with weak nonlinear optics

    quant-ph 2024-12 conditional novelty 7.0 of 10

    A hybrid GKP-photon cluster-state architecture with weak cross-Kerr gates achieves a 7.4 dB squeezing threshold at 1% photon loss and 3.8 dB under negligible loss.

Pith tools