Pith. sign in

REVIEW 3 minor 44 references

A linear-optical protocol achieves deterministic Bell-state measurement for rotation-symmetric cat codes of any symmetry order at large amplitudes under no loss.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · grok-4.3

2026-07-02 21:55 UTC pith:OMDJSBI5

load-bearing objection A linear-optical BSM for RS-cat codes that becomes deterministic at large alpha by mapping symmetry-induced photon numbers after a half-beam splitter.

arxiv 2606.22832 v3 pith:OMDJSBI5 submitted 2026-06-22 quant-ph

Linear optical Bell state measurement for rotation-symmetric cat codes

Issa Oe , Suguru Endo , Rui Asaoka This is my paper
classification quant-ph
keywords rotation-symmetric cat codesBell state measurementlinear opticsbosonic codesphoton-number-resolving detectorsphoton lossquantum communication
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a Bell state measurement protocol for rotation-symmetric cat codes that relies solely on a half beam splitter and photon-number-resolving detectors. It establishes that the protocol discriminates all Bell states deterministically for arbitrary symmetry order N once the amplitude becomes large enough, provided there is no photon loss, by using the photon-number pattern created by the codes' rotational symmetry. This matters because efficient BSM is required for long-distance quantum communication and fusion-based quantum computation. The authors also compute how performance changes with photon loss and demonstrate that post-selection raises the success rate.

Core claim

By exploiting the characteristic photon-number structure induced by the discrete rotational symmetry of RS-cat codes, the BSM protocol using a half beam splitter and PNRDs extracts both photon-number modulo and phase information, becoming deterministic for arbitrary symmetry order N for sufficiently large amplitudes α under ideal loss-free conditions.

What carries the argument

The characteristic photon-number structure induced by the discrete rotational symmetry of RS-cat codes, which enables extraction of photon-number modulo and phase information for Bell-state discrimination.

Load-bearing premise

RS-cat codes possess a characteristic photon-number structure induced by their discrete rotational symmetry that enables extraction of both photon-number modulo and phase information for Bell-state discrimination.

What would settle it

A numerical simulation or experiment in which the success probability remains below 1 even as amplitude α grows without bound in the complete absence of loss.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • The protocol reaches unit success probability for any symmetry order N once amplitudes are large enough under loss-free conditions.
  • Higher-order RS-cat codes yield higher success probability in a specific range of photon-loss rates compared with lower-order codes.
  • Post-selection on the measurement outcomes increases the overall success probability of the protocol.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The deterministic regime under ideal conditions implies that RS-cat codes could serve as a resource-efficient platform for quantum repeaters when channel loss is separately mitigated.
  • The identified loss-regime crossover suggests that code-order selection in practical devices could be guided by expected detector and channel loss levels rather than fixed to N=2.
  • Because the protocol uses only linear optics and PNRDs, any advance in number-resolving detector fidelity would directly translate into higher BSM rates for these codes.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The manuscript proposes a linear-optical Bell state measurement (BSM) protocol for rotation-symmetric cat (RS-cat) codes that employs only a half beam splitter followed by photon-number-resolving detectors. Exploiting the discrete rotational symmetry of the codes, the protocol extracts both photon-number modulo information and relative phase to discriminate the four Bell states. The central claim is that, under ideal loss-free conditions, this mapping becomes deterministic for any symmetry order N once the cat amplitude α is sufficiently large. Numerical simulations of success probability under photon loss are presented, together with an identification of loss regimes in which higher-N codes outperform lower-N ones and a demonstration that post-selection can further improve performance.

Significance. If the deterministic mapping under ideal conditions is rigorously established, the work supplies a resource-efficient BSM primitive that is directly compatible with bosonic error-correcting codes already studied for long-distance communication and fusion-based quantum computation. The numerical loss analysis and the observation that higher-order RS-cat codes can be advantageous in certain loss regimes provide concrete guidance for experimental implementation. The symmetry-based extraction of both modulo and phase information is a clear conceptual contribution.

minor comments (3)
  1. The abstract states that the protocol 'becomes deterministic for arbitrary symmetry order N for sufficiently large amplitudes α,' but the manuscript should explicitly state the minimal α(N) threshold (or scaling) at which the four Bell-state outcome sets become disjoint; this would strengthen the central claim.
  2. Section describing the numerical loss model should specify the precise photon-loss channel (e.g., pure-loss Kraus operators or beam-splitter model) and the range of loss probabilities simulated, as these details determine the reported advantage of higher-N codes.
  3. The post-selection procedure is mentioned only briefly; a short paragraph clarifying the heralding condition and the resulting trade-off between success probability and fidelity would improve clarity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, accurate summary of the protocol, and recommendation of minor revision. The significance statement correctly identifies the resource-efficient nature of the BSM primitive and the utility of the loss analysis. No major comments were listed in the report, so we provide no point-by-point responses below.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper describes a linear-optical BSM protocol for RS-cat codes that exploits the codes' discrete rotational symmetry to map PNRD outcomes after an HBS to Bell states. The central claim—that the protocol becomes deterministic for arbitrary N at large α under ideal conditions—is presented as following from the photon-number structure of the codes themselves, not from any fitted parameter, self-defined quantity, or self-citation chain. No equations or steps in the provided abstract reduce a prediction to an input by construction, and the numerical loss evaluations are treated as separate from the ideal-case determinism result. The derivation therefore stands on the explicit protocol construction and symmetry properties rather than circular re-use of its own outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract supplies no explicit free parameters, axioms, or invented entities; the protocol description implies reliance on the rotational symmetry property of the codes but does not detail any fitted quantities or new postulates.

pith-pipeline@v0.9.1-grok · 5702 in / 1059 out tokens · 28598 ms · 2026-07-02T21:55:22.977946+00:00 · methodology

0 comments
read the original abstract

Rotation-symmetric cat (RS-cat) codes are a bosonic-code platform for quantum information processing, combining finite-energy realizability with robustness against photon loss through their discrete rotational symmetry. For applications in long-distance quantum communication and fusion-based quantum computation (FBQC), efficient Bell state measurement (BSM) is a key primitive. In this work, we consider a BSM protocol for RS-cat codes using only a half beam splitter (HBS) and photon-number-resolving detectors (PNRDs). By exploiting the characteristic photon-number structure induced by the discrete rotational symmetry of RS-cat codes, our protocol extracts both photon-number modulo and phase information for Bell-state discrimination. We show that, under ideal loss-free conditions, the proposed BSM protocol becomes deterministic for arbitrary symmetry order $N$ for sufficiently large amplitudes $\alpha$. We further numerically evaluate the success probability under photon loss and identify the loss regime in which higher-order RS-cat codes provide an advantage. Finally, we show that post-selection can enhance the success probability.

Figures

Figures reproduced from arXiv: 2606.22832 by Issa Oe, Rui Asaoka, Suguru Endo.

Figure 1
Figure 1. Figure 1: FIG. 1. Schematic of the BSM setup consisting of a HBS and [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Wigner functions of RS-cat codes. The panels show the [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Histogram of [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Histograms of [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Success probability of the BSM method for RS-cat [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Orthogonality of the Bell basis of RS-cat codes. [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. Success probability of the BSM under photon loss. [PITH_FULL_IMAGE:figures/full_fig_p007_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8. Failure rate of the BSM for RS-cat codes as a function [PITH_FULL_IMAGE:figures/full_fig_p007_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: FIG. 9. Histogram of [PITH_FULL_IMAGE:figures/full_fig_p008_9.png] view at source ↗
Figure 11
Figure 11. Figure 11: FIG. 11. Maximum success probability of the BSM for RS [PITH_FULL_IMAGE:figures/full_fig_p009_11.png] view at source ↗

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

44 extracted references · 44 canonical work pages · 1 internal anchor

  1. [1]

    The small-amplitude behavior is discussed numerically in Appendix B

    We therefore define D(nc, n d) = round ( N π arccos X ) , (30) whose parity distinguishes between {|Φ ± L ⟩} and {|Ψ ± L ⟩}. The small-amplitude behavior is discussed numerically in Appendix B. C. Performance of our BSM protocol We numerically evaluate the performance of our BSM protocol for RS-cat codes, first considering the lossless case. In this work, w...

    work page

  2. [2]

    The results in- 0 1 2 3 4 5 6 7 8 0.75 0.80 0.85 0.90 0.95 1.00 η = 10−3 With Photon Loss Amplitude α Success Probability FIG

    For each pair of N and η, we optimize the amplitude α and plot the resulting minimum failure rate. The results in- 0 1 2 3 4 5 6 7 8 0.75 0.80 0.85 0.90 0.95 1.00 η = 10−3 With Photon Loss Amplitude α Success Probability FIG. 7. Success probability of the BSM under photon loss. The upper and lower panels show the results for photon loss rates η = 10 − 3 a...

    work page

  3. [3]

    Lloyd and S

    S. Lloyd and S. L. Braunstein, Quantum computation over continuous variables, Physical Review Letters 82, 1784 (1999)

    work page 1999

  4. [4]

    S. L. Braunstein and P. Van Loock, Quantum infor- mation with continuous variables, Reviews of modern physics 77, 513 (2005)

    work page 2005

  5. [5]

    Encoding a qubit in an oscillator

    D. Gottesman, A. Kitaev, and J. Preskill, Encoding a qubit in an oscillator, arXiv preprint quant-ph/0008040 (2000)

    work page internal anchor Pith review Pith/arXiv arXiv 2000

  6. [6]

    A. L. Grimsmo and S. Puri, Quantum error correction with the gottesman-kitaev-preskill code, PRX Quantum 2, 020101 (2021)

    work page 2021

  7. [7]

    P. T. Cochrane, G. J. Milburn, and W. J. Munro, Macro- scopically distinct quantum-superposition states as a bosonic code for amplitude damping, Physical Review A 59, 2631 (1999)

    work page 1999

  8. [8]

    Mirrahimi, Z

    M. Mirrahimi, Z. Leghtas, V. V. Albert, S. Touzard, R. J. Schoelkopf, L. Jiang, and M. H. Devoret, Dynamically protected cat-qubits: a new paradigm for universal quan- tum computation, New Journal of Physics 16, 045014 (2014)

    work page 2014

  9. [9]

    N. Ofek, A. Petrenko, R. Heeres, P. Reinhold, Z. Leghtas, B. Vlastakis, Y. Liu, L. Frunzio, S. M. Girvin, L. Jiang, et al. , Extending the lifetime of a quantum bit with error correction in superconducting circuits, Nature 536, 441 (2016)

    work page 2016

  10. [10]

    M. H. Michael, M. Silveri, R. Brierley, V. V. Albert, J. Salmilehto, L. Jiang, and S. M. Girvin, New class of quantum error-correcting codes for a bosonic mode, Physical Review X 6, 031006 (2016)

    work page 2016

  11. [11]

    Glancy and E

    S. Glancy and E. Knill, Error analysis for encoding a qubit in an oscillator, Physical Review A—Atomic, Molecular, and Optical Physics 73, 012325 (2006)

    work page 2006

  12. [12]

    Fukui, A

    K. Fukui, A. Tomita, A. Okamoto, and K. Fujii, High- threshold fault-tolerant quantum computation with ana- log quantum error correction, Physical review X 8, 021054 (2018)

    work page 2018

  13. [13]

    Matsuura, H

    T. Matsuura, H. Yamasaki, and M. Koashi, Equivalence of approximate gottesman-kitaev-preskill codes, Physica l Review A 102, 032408 (2020)

    work page 2020

  14. [14]

    Rojkov, P

    I. Rojkov, P. M. Röggla, M. Wagener, M. Fontboté- Schmidt, S. Welte, J. Home, and F. Reiter, Two-qubit operations for finite-energy gottesman-kitaev-preskill e n- codings, Physical Review Letters 133, 100601 (2024)

    work page 2024

  15. [15]

    Jafarzadeh, J

    M. Jafarzadeh, J. Conrad, R. N. Alexander, and B. Q. Baragiola, Logical channels in approximate gottesman- kitaev-preskill error correction, Physical Review A 112, 062413 (2025)

    work page 2025

  16. [16]

    Matsuura, N

    T. Matsuura, N. C. Menicucci, and H. Yamasaki, Continuous-variable fault-tolerant quantum computation under general noise, Nature Communications 17, 1709 (2026)

    work page 2026

  17. [17]

    A. L. Grimsmo, J. Combes, and B. Q. Baragiola, Quan- tum computing with rotation-symmetric bosonic codes, Physical Review X 10, 011058 (2020)

    work page 2020

  18. [18]

    Hillmann, F

    T. Hillmann, F. Quijandría, A. L. Grimsmo, and G. Fer- rini, Performance of teleportation-based error-correcti on circuits for bosonic codes with noisy measurements, PRX Quantum 3, 020334 (2022)

    work page 2022

  19. [19]

    Marinoff, M

    B. Marinoff, M. Bush, and J. Combes, Explicit error- correction scheme and code distance for bosonic codes with rotational symmetry, Physical Review A 109, 032436 (2024)

    work page 2024

  20. [20]

    P.-Z. Li, J. Dias, W. J. Munro, P. van Loock, K. Nemoto, and N. Lo Piparo, Performance of rotation-symmetric bosonic codes in a quantum repeater network, Advanced Quantum Technologies 7, 2300252 (2024)

    work page 2024

  21. [21]

    S. Endo, Y. Suzuki, K. Tsubouchi, R. Asaoka, K. Ya- mamoto, Y. Matsuzaki, and Y. Tokunaga, Quantum er- ror mitigation for rotation-symmetric bosonic codes with symmetry expansion, Physical Review A 111, 062402 (2025)

    work page 2025

  22. [22]

    Udupa, T

    A. Udupa, T. Hillmann, R. G. Ahmed, A. Smirne, and G. Ferrini, Performance of rotation-symmetric bosonic 17 codes in the presence of random telegraph noise, arXiv preprint arXiv:2505.08670 (2025)

    work page arXiv 2025

  23. [23]

    L. D. My, S. Qin, and H. K. Ng, Circuit-level fault toler- ance of cat codes, Quantum 9, 1810 (2025)

    work page 2025

  24. [24]

    Fukui, R

    K. Fukui, R. N. Alexander, and P. van Loock, All-optical long-distance quantum communication with gottesman- kitaev-preskill qubits, Physical Review Research 3, 033118 (2021)

    work page 2021

  25. [25]

    Rozpędek, K

    F. Rozpędek, K. Noh, Q. Xu, S. Guha, and L. Jiang, Quantum repeaters based on concatenated bosonic and discrete-variable quantum codes, npj Quantum Informa- tion 7, 102 (2021)

    work page 2021

  26. [26]

    Rozpędek, K

    F. Rozpędek, K. P. Seshadreesan, P. Polakos, L. Jiang, and S. Guha, All-photonic gottesman-kitaev-preskill– qubit repeater using analog-information-assisted multi- plexed entanglement ranking, Physical Review Research 5, 043056 (2023)

    work page 2023

  27. [27]

    Azari, P

    M. Azari, P. Polakos, and K. P. Seshadreesan, Quan- tum switches for gottesman–kitaev–preskill qubit-based all-photonic quantum networks, IEEE Transactions on Quantum Engineering 5, 1 (2024)

    work page 2024

  28. [28]

    D. E. Browne and T. Rudolph, Resource-efficient linear optical quantum computation, Physical Review Letters 95, 010501 (2005)

    work page 2005

  29. [29]

    Bartolucci, P

    S. Bartolucci, P. Birchall, H. Bombin, H. Cable, C. Daw- son, M. Gimeno-Segovia, E. Johnston, K. Kieling, N. Nickerson, M. Pant, et al. , Fusion-based quantum computation, Nature Communications 14, 912 (2023)

    work page 2023

  30. [30]

    C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, Teleporting an unknown quantum state via dual classical and einstein-podolsky- rosen channels, Phys. Rev. Lett. 70, 1895 (1993)

    work page 1993

  31. [31]

    event-ready-detectors

    M. Żukowski, A. Zeilinger, M. A. Horne, and A. K. Ekert, “event-ready-detectors”bell experiment via entanglemen t swapping, Physical Review Letters 71, 4287 (1993)

    work page 1993

  32. [32]

    S. L. Braunstein and A. Mann, Measurement of the bell operator and quantum teleportation, Physical Review A 51, R1727 (1995)

    work page 1995

  33. [33]

    Lütkenhaus, J

    N. Lütkenhaus, J. Calsamiglia, and K.-A. Suominen, Bell measurements for teleportation, Physical Review A 59, 3295 (1999)

    work page 1999

  34. [34]

    S. D. Bartlett and W. J. Munro, Quantum teleporta- tion of optical quantum gates, Physical review letters 90, 117901 (2003)

    work page 2003

  35. [35]

    X. Zhou, D. W. Leung, and I. L. Chuang, Methodology for quantum logic gate construction, Physical Review A 62, 052316 (2000)

    work page 2000

  36. [36]

    J.-W. Pan, D. Bouwmeester, H. Weinfurter, and A. Zeilinger, Experimental entanglement swapping: en- tangling photons that never interacted, Physical review letters 80, 3891 (1998)

    work page 1998

  37. [37]

    Schmidt, D

    F. Schmidt, D. Miller, and P. van Loock, Error-corrected quantum repeaters with gottesman-kitaev-preskill qu- dits, Physical Review A 109, 042427 (2024)

    work page 2024

  38. [38]

    Hastrup and U

    J. Hastrup and U. L. Andersen, All-optical cat-code quantum error correction, Physical Review Research 4, 043065 (2022)

    work page 2022

  39. [39]

    D. Su, I. Dhand, and T. C. Ralph, Universal quantum computation with optical four-component cat qubits, Physical Review A 106, 042614 (2022)

    work page 2022

  40. [40]

    J. Lee, N. Kang, S.-H. Lee, H. Jeong, L. Jiang, and S.- W. Lee, Fault-tolerant quantum computation by hybrid qubits with bosonic cat code and single photons, PRX Quantum 5, 030322 (2024)

    work page 2024

  41. [41]

    Eaton, A

    M. Eaton, A. Hossameldin, R. J. Birrittella, P. M. Alsing, C. C. Gerry, H. Dong, C. Cuevas, and O. Pfister, Resolu- tion of 100 photons and quantum generation of unbiased random numbers, Nature Photonics 17, 106 (2023)

    work page 2023

  42. [42]

    Cheng, Y

    R. Cheng, Y. Zhou, S. Wang, M. Shen, T. Taher, and H. X. Tang, A 100-pixel photon-number-resolving detec- tor unveiling photon statistics, Nature Photonics 17, 112 (2023)

    work page 2023

  43. [43]

    Kiryu, K

    S. Kiryu, K. Fukui, A. Okamoto, and A. Tomita, Linear optical quantum computing with a hybrid squeezed-cat code, Physical Review A 112, 042615 (2025)

    work page 2025

  44. [44]

    J. Lee, S. Omkar, Y. S. Teo, S.-H. Lee, H. Kwon, M. Kim, and H. Jeong, Photonic hybrid quantum computing, Newton (2025)

    work page 2025