Pith. sign in

REVIEW 2 cited by

Analysis of loss correction with the Gottesman-Kitaev-Preskill code

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 2112.01425 v1 pith:J67XHKQV submitted 2021-12-02 quant-ph

Analysis of loss correction with the Gottesman-Kitaev-Preskill code

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

The Gottesman-Kitaev-Preskill (GKP) code is a promising bosonic quantum error-correcting code, encoding logical qubits into a bosonic mode in such a way that many physically relevant noise types can be corrected effectively. A particularly relevant noise channel is the pure loss channel, which the GKP code is known to protect against. In particular, it is commonly pointed out that losses can be corrected by the GKP code by transforming the losses into random Gaussian displacements through a quantum-limited amplification channel. However, implementing such amplification in practice is not ideal and could easily introduce an additional overhead of noise from associated experimental imperfections. Here, we analyse the performance of teleportation-based GKP error correction against loss in the absence of an amplification channel. We show that amplification is not required to perform GKP error correction, and that performing amplification actually worsens the performance for practically relevant parameter regimes.

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. Complex abelian varieties and quantum error correction: a mathematical framework for GKP codes

    math.AG 2026-05 unverdicted novelty 7.0

    The paper supplies a rigorous dictionary between GKP codes and polarized abelian varieties, proving asymptotic isometry of the encoding, Gaussian realization of all logical Cliffords, and first-order noise failure gov...

  2. Strategic Plan for Neutral Atom Quantum Computation

    quant-ph 2026-07 conditional novelty 3.0

    If qubit-count growth (~1.8x/yr) and gate-error reduction (~0.62x/yr) continue, neutral-atom quantum computers could reach practical quantum advantage within a decade, this roadmap projects.