Pith. sign in

REVIEW 2 cited by

Equivalence of approximate Gottesman-Kitaev-Preskill 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 1910.08301 v4 pith:7XA7LOB4 submitted 2019-10-18 quant-ph

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

The Gottesman-Kitaev-Preskill (GKP) quantum error correcting code attracts much attention in continuous variable (CV) quantum computation and CV quantum communication due to the simplicity of error correcting routines and the high tolerance against Gaussian errors. Since the GKP code state should be regarded as a limit of physically meaningful approximate ones, various approximations have been developed until today, but explicit relations among them are still unclear. In this paper, we rigorously prove the equivalence of these approximate GKP codes with an explicit correspondence of the parameters. We also propose a standard form of the approximate code states in the position representation, which enables us to derive closed-from expressions for the Wigner functions, the inner products, and the average photon numbers in terms of the theta functions. Our results serve as fundamental tools for further analyses of fault-tolerant quantum computation and channel coding using approximate GKP codes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Impact of finite squeezing on near-term quantum computations using GKP qubits

    quant-ph 2025-07 conditional novelty 7.0 of 10

    A 108-mode simulation of a GKP-based measurement-based quantum computer shows a three-qubit Grover search beats the classical one-query bound only above about 10 dB of GKP squeezing.

  2. Performance analysis of GKP error correction

    quant-ph 2025-05 conditional novelty 6.0 of 10

    GKP error correction with qunaught-state resources outperforms the standard Bell-state and Steane variants in corrected squeezing, and the Steane scheme is shown to be a special case of the Knill scheme.

Pith tools