Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2606.22832

Linear optical Bell state measurement for rotation-symmetric cat codes

Issa Oe, Suguru Endo, Rui Asaoka

quant-phSubmitted Jun 22, 2026• Announced Jun 23, 2026• 0 citations• Revised Jul 1, 2026 (v3)
v1 · Jun 22, 2026v2 · Jun 23, 2026v3 · Jul 1, 2026
arXivHTMLPDF

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 $α$. 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.

Related papers

Boosted Bell-state measurements for photonic quantum computation

Nico Hauser, Matthias J. Bayerbach, Simone Evaldo D’Aurelio +5 more

Abstract Fault-tolerant fusion-based photonic quantum computing (FBQC) greatly relies on entangling two-photon measurements, called fusions. These fusions can be realized using linear-optical projective Bell-state measurements (BSMs). These linear-optical BSMs are limited to a success probability of 50%, greatly reducing the performance of FBQC schemes. The performance of FBQC can be improved using boosting, thus achieving higher success probabilities by adding additional resources. Here, we realize a boosted BSM using a 4 × 4 multiport splitter and an additional entangled photon pair, allowing for a success probability of up to 75%. In our experiment, we obtain a success probability for our boosted BSM of (69.3 ± 0.3)%, clearly exceeding the 50% limit. We further demonstrate the significance of our boosted BSM for FBQC, showing a threefold increase in robustness to photon loss and a significant reduction of the logical error rates.

arXiv:2410.16380•npj Quantum Information•Mar 8, 2025•25 citations

Demonstration of a logical Bell-state measurement beyond the linear-optical limit

Shreya Kumar, Simon D. Reiß, Peter van Loock +1 more

Fault tolerance is essential for scalable quantum technologies and is enabled by quantum error-correction codes. Bell-state measurements (BSMs) are a fundamental building block for modern quantum technologies such as measurement-based quantum computation and fusion-based quantum computation, as well as quantum networks. Therefore, performing BSMs on error-corrected qubits is a necessary step for achieving fault tolerance in these applications. In this work, we realise a logical BSM using linear optics, based on a two-qubit repetition code, an instance of a quantum parity code that allows detection of bit-flip errors, and experimentally achieve a mean success probability of (70.8 +/- 0.4)%. While standard linear-optical BSMs are fundamentally limited to a maximum success probability of 50%, this increased success probability enables higher secure key rates in quantum communication and facilitates the generation of large graph states for quantum computation. Since fault-tolerant schemes require error-correction codes regardless, this improvement comes at no additional resource overhead. Our results demonstrate that error-correction codes can be used to surpass the linear-optics limit of BSMs, which is an important step towards practical, fault-tolerant, and scalable photonic quantum technologies.

quant-pharXiv:2609.10698•Sep 11, 2026•1 citation

Quantum error mitigation for rotation-symmetric bosonic codes with symmetry expansion

Suguru Endo, Yasunari Suzuki, Kento Tsubouchi +4 more

The rotation symmetric bosonic code (RSBC) is a unified framework of practical bosonic codes that have rotation symmetries, such as cat codes and binomial codes. While cat and binomial codes achieve the breakeven point in which the coherence time of the encoded qubits exceeds that of unencoded qubits, the state preparation fidelity needs to be improved for practical quantum computing. Concerning this problem, we investigate the framework of symmetry expansion, a class of quantum error mitigation that virtually projects the state onto the noise-free symmetric subspace by exploiting the system's intrinsic symmetries and postprocessing of measurement outcomes. Although symmetry expansion has been limited to error mitigation of quantum states immediately before measurement, we successfully generalize symmetry expansion for state preparation. Then, we consider two types of stabilization: photon number and phase stabilization. Photon number stabilization can be performed by leveraging the rotation operators. On the other hand, the phase errors can be suppressed via the extension towards phase direction by leveraging the recently proposed projective squeezing method. To implement our method, we use an ancilla qubit and a randomly generated controlled gate between the bosonic code states and the ancilla qubit. Our novel error mitigation method will significantly enhance computation accuracy in the near-term bosonic quantum computing.

arXiv:2211.06164•Physical Review A•Jun 2, 2025•15 citations

Boosting linear-optical Bell measurement success probability with predetection squeezing and imperfect photon-number-resolving detectors

Thomas Kilmer, Saikat Guha

Linear-optical realizations of Bell state measurement (BSM) on two single-photon qubits succeed with probability ${p}_{s}$ no higher than 0.5. However, predetection quadrature squeezing, i.e., quantum noise limited phase sensitive amplification, in the usual linear-optical BSM circuit, can yield ${p}_{s}\ensuremath{\approx}0.643$. The ability to achieve ${p}_{s}>0.5$ has been found to be critical in resource-efficient realizations of linear-optical quantum computing and all-photonic quantum repeaters. Yet, the aforesaid value of ${p}_{s}>0.5$ is not known to be the maximum achievable using squeezing, thereby leaving it open whether close-to-$100%$ efficient BSM might be achievable using squeezing as a resource. In this paper, we report insights on why squeezing-enhanced BSM achieves ${p}_{s}>0.5$. Using this, we show that the previously reported ${p}_{s}\ensuremath{\approx}0.643$ at single-mode squeezing strength $r=0.6585$---for unambiguous state discrimination (USD) of all four Bell states---is an experimentally unachievable point result, which drops to ${p}_{s}\ensuremath{\approx}0.59$ with the slightest change in $r$. We, however, show that squeezing-induced boosting of ${p}_{s}$ with USD operation is still possible over a continuous range of $r$, with an experimentally achievable maximum occurring at $r=0.5774$, achieving ${p}_{s}\ensuremath{\approx}0.596$. Finally, deviating from USD operation, we explore a trade space between ${p}_{s}$, the probability with which the BSM circuit declares a ``success,'' versus the probability of error ${p}_{e}$, the probability of an input Bell state being erroneously identified given the circuit declares a success. Since quantum error correction could correct for some ${p}_{e}>0$, this tradeoff may enable better quantum repeater designs by potentially increasing the entanglement generation rates with ${p}_{s}$ exceeding what is possible with traditionally studied USD operation of BSMs.

arXiv:1809.09264•Physical Review A•Mar 1, 2019•24 citations

Bosonic Cyclic Codes: Trading Stabilizers for Gaussian Non-Clifford Phase Gates

Owen C. Wetherbee, Yijia Xu, Victor V. Albert +2 more

Bosonic codes offer hardware-efficient approaches to quantum error correction, with the best encodings offering effective protection of idle quantum information against loss and dephasing - particularly rotation-symmetric codes, which include the cat and binomial code families. However, rotation-symmetric codes are only naturally endowed with a single logical Pauli gate, while other logical gates require the use of non-linear operations, obstructing the utility of these codes for realizing quantum algorithms. Here, we balance error protection with controllability by introducing bosonic cyclic codes: a generalization of rotation-symmetric codes that enable the measured tradeoff of error protection properties for fault-tolerant logical phase gates. Through our general construction, we find that sacrificing the detectability of a single photon loss relative to a rotation-symmetric code can yield a number of logical phase gates commensurate with the original rotation symmetry order of the code, all achievable via passive Gaussian rotations. Giving the corresponding generalizations of cat and binomial codes - which we dub cyclic cat and Vandermonde codes, respectively - we further find that many of the desirable properties of these codes transfer to the bosonic cyclic code setting. We go on to discuss the larger $SU(2)$ symmetry and rotation gates of the codes, which yield additional stabilizers and logical Pauli gates, as well as new non-Clifford gates for the smallest `kitten' binomial code, and provide a new error detection protocol. Finally, we introduce a general paradigm for converting higher-order stabilizers to logical gates, as in our generalization of rotation-symmetric codes, and apply it to several multimode bosonic codes.

quant-pharXiv:2606.11010•Jun 10, 2026•3 citations

All-optical Quantum State Engineering for Rotation-symmetric Bosonic States

Rajveer Nehra, Miller Eaton, Olivier Pfister +1 more

Continuous-variable quantum information processing through quantum optics offers a promising platform for building the next generation of scalable fault-tolerant information processors. To achieve quantum computational advantages and fault tolerance, non-Gaussian resources are essential. In this work, we propose and analyze a method to generate a variety of non-Gaussian states using coherent photon subtraction from a two-mode squeezed state followed by photon-number-resolving measurements. The proposed method offers a promising way to generate rotation-symmetric states conventionally used for quantum error correction with binomial codes and truncated Schrödinger cat codes. We consider the deleterious effects of experimental imperfections such as detection inefficiencies and losses in the state engineering protocol. Our method can be readily implemented with current quantum photonic technologies.

arXiv:2105.11035•May 23, 2021•4 citations
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 NNN for sufficiently large amplitudes ααα. 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.
Abstract Fault-tolerant fusion-based photonic quantum computing (FBQC) greatly relies on entangling two-photon measurements, called fusions. These fusions can be realized using linear-optical projective Bell-state measurements (BSMs). These linear-optical BSMs are limited to a success probability of 50%, greatly reducing the performance of FBQC schemes. The performance of FBQC can be improved using boosting, thus achieving higher success probabilities by adding additional resources. Here, we realize a boosted BSM using a 4 × 4 multiport splitter and an additional entangled photon pair, allowing for a success probability of up to 75%. In our experiment, we obtain a success probability for our boosted BSM of (69.3 ± 0.3)%, clearly exceeding the 50% limit. We further demonstrate the significance of our boosted BSM for FBQC, showing a threefold increase in robustness to photon loss and a significant reduction of the logical error rates.
Fault tolerance is essential for scalable quantum technologies and is enabled by quantum error-correction codes. Bell-state measurements (BSMs) are a fundamental building block for modern quantum technologies such as measurement-based quantum computation and fusion-based quantum computation, as well as quantum networks. Therefore, performing BSMs on error-corrected qubits is a necessary step for achieving fault tolerance in these applications. In this work, we realise a logical BSM using linear optics, based on a two-qubit repetition code, an instance of a quantum parity code that allows detection of bit-flip errors, and experimentally achieve a mean success probability of (70.8 +/- 0.4)%. While standard linear-optical BSMs are fundamentally limited to a maximum success probability of 50%, this increased success probability enables higher secure key rates in quantum communication and facilitates the generation of large graph states for quantum computation. Since fault-tolerant schemes require error-correction codes regardless, this improvement comes at no additional resource overhead. Our results demonstrate that error-correction codes can be used to surpass the linear-optics limit of BSMs, which is an important step towards practical, fault-tolerant, and scalable photonic quantum technologies.
The rotation symmetric bosonic code (RSBC) is a unified framework of practical bosonic codes that have rotation symmetries, such as cat codes and binomial codes. While cat and binomial codes achieve the breakeven point in which the coherence time of the encoded qubits exceeds that of unencoded qubits, the state preparation fidelity needs to be improved for practical quantum computing. Concerning this problem, we investigate the framework of symmetry expansion, a class of quantum error mitigation that virtually projects the state onto the noise-free symmetric subspace by exploiting the system's intrinsic symmetries and postprocessing of measurement outcomes. Although symmetry expansion has been limited to error mitigation of quantum states immediately before measurement, we successfully generalize symmetry expansion for state preparation. Then, we consider two types of stabilization: photon number and phase stabilization. Photon number stabilization can be performed by leveraging the rotation operators. On the other hand, the phase errors can be suppressed via the extension towards phase direction by leveraging the recently proposed projective squeezing method. To implement our method, we use an ancilla qubit and a randomly generated controlled gate between the bosonic code states and the ancilla qubit. Our novel error mitigation method will significantly enhance computation accuracy in the near-term bosonic quantum computing.
Linear-optical realizations of Bell state measurement (BSM) on two single-photon qubits succeed with probability ps{p}_{s}ps​ no higher than 0.5. However, predetection quadrature squeezing, i.e., quantum noise limited phase sensitive amplification, in the usual linear-optical BSM circuit, can yield ${p}_{s}\ensuremath{\approx}0.643$. The ability to achieve ps>0.5{p}_{s}>0.5ps​>0.5 has been found to be critical in resource-efficient realizations of linear-optical quantum computing and all-photonic quantum repeaters. Yet, the aforesaid value of ps>0.5{p}_{s}>0.5ps​>0.5 is not known to be the maximum achievable using squeezing, thereby leaving it open whether close-to-100100%100 efficient BSM might be achievable using squeezing as a resource. In this paper, we report insights on why squeezing-enhanced BSM achieves ps>0.5{p}_{s}>0.5ps​>0.5. Using this, we show that the previously reported ${p}_{s}\ensuremath{\approx}0.643$ at single-mode squeezing strength r=0.6585r=0.6585r=0.6585---for unambiguous state discrimination (USD) of all four Bell states---is an experimentally unachievable point result, which drops to ${p}_{s}\ensuremath{\approx}0.59$ with the slightest change in rrr. We, however, show that squeezing-induced boosting of ps{p}_{s}ps​ with USD operation is still possible over a continuous range of rrr, with an experimentally achievable maximum occurring at r=0.5774r=0.5774r=0.5774, achieving ${p}_{s}\ensuremath{\approx}0.596$. Finally, deviating from USD operation, we explore a trade space between ps{p}_{s}ps​, the probability with which the BSM circuit declares a ``success,'' versus the probability of error pe{p}_{e}pe​, the probability of an input Bell state being erroneously identified given the circuit declares a success. Since quantum error correction could correct for some pe>0{p}_{e}>0pe​>0, this tradeoff may enable better quantum repeater designs by potentially increasing the entanglement generation rates with ps{p}_{s}ps​ exceeding what is possible with traditionally studied USD operation of BSMs.
Bosonic codes offer hardware-efficient approaches to quantum error correction, with the best encodings offering effective protection of idle quantum information against loss and dephasing - particularly rotation-symmetric codes, which include the cat and binomial code families. However, rotation-symmetric codes are only naturally endowed with a single logical Pauli gate, while other logical gates require the use of non-linear operations, obstructing the utility of these codes for realizing quantum algorithms. Here, we balance error protection with controllability by introducing bosonic cyclic codes: a generalization of rotation-symmetric codes that enable the measured tradeoff of error protection properties for fault-tolerant logical phase gates. Through our general construction, we find that sacrificing the detectability of a single photon loss relative to a rotation-symmetric code can yield a number of logical phase gates commensurate with the original rotation symmetry order of the code, all achievable via passive Gaussian rotations. Giving the corresponding generalizations of cat and binomial codes - which we dub cyclic cat and Vandermonde codes, respectively - we further find that many of the desirable properties of these codes transfer to the bosonic cyclic code setting. We go on to discuss the larger SU(2)SU(2)SU(2) symmetry and rotation gates of the codes, which yield additional stabilizers and logical Pauli gates, as well as new non-Clifford gates for the smallest `kitten' binomial code, and provide a new error detection protocol. Finally, we introduce a general paradigm for converting higher-order stabilizers to logical gates, as in our generalization of rotation-symmetric codes, and apply it to several multimode bosonic codes.
Continuous-variable quantum information processing through quantum optics offers a promising platform for building the next generation of scalable fault-tolerant information processors. To achieve quantum computational advantages and fault tolerance, non-Gaussian resources are essential. In this work, we propose and analyze a method to generate a variety of non-Gaussian states using coherent photon subtraction from a two-mode squeezed state followed by photon-number-resolving measurements. The proposed method offers a promising way to generate rotation-symmetric states conventionally used for quantum error correction with binomial codes and truncated Schrödinger cat codes. We consider the deleterious effects of experimental imperfections such as detection inefficiencies and losses in the state engineering protocol. Our method can be readily implemented with current quantum photonic technologies.