Pith. sign in

REVIEW 1 cited by

The performance of random bosonic rotation codes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2311.16089 v2 pith:YCPUSENN submitted 2023-11-27 quant-ph

Saurabh Totey , Akira Kyle , Steven Liu , Pratik J. Barge , Noah Lordi , Joshua Combes This is my paper · ORCID
classification quant-ph
keywords codesrotationbosonicrandombinomialdephasinglossperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Bosonic error correcting codes utilize the infinite dimensional Hilbert space of a harmonic oscillator to encode a qubit. Bosonic rotation codes are characterized by a discrete rotation symmetry in their Wigner functions and include codes such as the cat and binomial codes.We define two different notions of random bosonic rotation codes and numerically explore their performance against loss and dephasing. We find that the best random rotation codes can outperform cat and binomial codes in a certain parameter regime where loss is large and dephasing errors are small.

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. Estimating the performance boundary of Gottesman-Kitaev-Preskill codes and number-phase codes

    quant-ph 2026-02 conditional novelty 6.0 of 10

    Under combined loss and dephasing, GKP codes beat number-phase codes only when dephasing is below roughly 1/100 of the loss strength; beyond that, number-phase codes win.

Pith tools