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:2609.10698

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

Shreya Kumar, Simon D. Reiß, Peter van Loock, Stefanie Barz

quant-phSubmitted Sep 9, 2026• Announced Sep 11, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

Comments
11 pages, 6 figures

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

Analysis of optical loss thresholds in the fusion-based quantum computing architecture

Aleksandr Melkozerov, Ashot S. Avanesov, I. V. Dyakonov +1 more

Bell state measurements (BSMs) play a significant role in quantum information and quantum computing, in particular in fusion-based quantum computing (FBQC). The FBQC model is a framework for universal quantum computing, provided that we are able to perform entangling measurements, called fusions, on qubits within small entangled resource states. Here, we analyze the usage of different linear-optical BSM circuits as fusions in the FBQC schemes and numerically evaluate hardware requirements for fault-tolerance in this framework. We examine and compare the performance of several BSM circuits with varying additional resources and estimate the requirements on losses for every component of the linear-optical realization of fusions under which errors in fusion networks caused by these losses can be corrected. Our results show that fault-tolerant quantum computing in the FBQC model is possible with currently achievable levels of optical losses in an integrated photonic implementation, provided that we can create and detect single photons of the resource states with a total marginal efficiency higher than 0.973.

arXiv:2403.14811•APL Quantum•Sep 1, 2024•11 citations

Optimal logical Bell measurements on stabilizer codes with linear optics

Simon D. Reiß, Peter van Loock

Bell measurements (BMs) are ubiquitous in quantum information and technology. They are basic elements for quantum commmunication, computation, and error correction. In particular, when performed on logical qubits encoded in physical photonic qubits, they allow for a read-out of stabilizer syndrome information to enhance loss tolerance in qubit-state transmission and fusion. However, even in an ideal setting without photon loss, BMs cannot be done perfectly based on the simplest experimental toolbox of linear optics. Here we demonstrate that any logical BM on stabilizer codes can always be mapped onto a single physical BM perfomed on any qubit pair from the two codes. As a necessary condition for the success of a logical BM, this provides a general upper bound on its success probability, especially ruling out the possibility that the stabilizer information obtainable from only partially succeeding, physical linear-optics BMs could be combined into the full logical stabilizer information. We formulate sufficient criteria to find schemes for which a single successful BM on the physical level will always allow to obtain the full logical information by suitably adapting the subsequent physical measurements. Our approach based on stabilizer group theory is generally applicable to any stabilizer code, which we demonstrate for quantum parity, five-qubit, standard and rotated planar surface, tree, and seven-qubit Steane codes. Our schemes attain the general upper bound for all these codes, while this bound had previously only been reached for the quantum parity code.

quant-pharXiv:2601.08820•Physical Review A•Jan 14, 2026•5 citations

Error Correction in a Distributed Quantum Computer

E. M. Ainley, A. Agrawal, T. Araki +12 more

Building fault-tolerant quantum computers with large numbers of logical qubits requires both scalable hardware architectures and error-correcting codes that make efficient use of physical qubits. Photonic interconnects address both of these challenges by allowing the physical qubits to be distributed across multiple processors while providing the non-local connectivity necessary to implement resource-efficient codes such as high-rate quantum low-density parity-check (qLDPC) codes. A key requirement for realising this architecture is the ability to perform stabiliser measurements between remote processors, which has not previously been demonstrated experimentally. Here we report the first experimental demonstration of distributed quantum error detection and correction. We generate entanglement between network qubits in two separate trapped-ion processors and use it to perform remote syndrome measurements on data qubits. We first realise a distributed [[2, 1, 1]] repetition code, detecting phase-flip errors on a logical qubit encoded across the two modules in real time and suppressing logical errors. We then combine these mid-circuit syndrome measurements with real-time feedforward to actively correct arbitrary single-qubit Pauli errors on a distributed Bell state. These results provide an experimental foundation for quantum error correction (QEC) across modular quantum architectures.

quant-pharXiv:2609.13065•Sep 14, 2026•2 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

Error-correcting entanglement swapping using a practical logical photon encoding

Paul Hilaire, Edwin Barnes, Sophia E. Economou +1 more

Several emerging quantum technologies, including quantum networks, and modular and fusion-based quantum computing, rely crucially on the ability to perform photonic Bell state measurements. Therefore, photon losses and the 50% success probablity upper bound of Bell state measurements pose a critical limitation to photonic quantum technologies. Here, we develop protocols that overcome these two key challenges through logical encoding of photonic qubits. Our approach uses a tree graph state logical encoding, which can be produced deterministically with a few quantum emitters, and achieves near-deterministic logical photonic Bell state measurements while also protecting against errors including photon losses, with a record loss-tolerance threshold.

arXiv:2101.11082•Physical Review A•Nov 29, 2021•30 citations
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.
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.
Bell state measurements (BSMs) play a significant role in quantum information and quantum computing, in particular in fusion-based quantum computing (FBQC). The FBQC model is a framework for universal quantum computing, provided that we are able to perform entangling measurements, called fusions, on qubits within small entangled resource states. Here, we analyze the usage of different linear-optical BSM circuits as fusions in the FBQC schemes and numerically evaluate hardware requirements for fault-tolerance in this framework. We examine and compare the performance of several BSM circuits with varying additional resources and estimate the requirements on losses for every component of the linear-optical realization of fusions under which errors in fusion networks caused by these losses can be corrected. Our results show that fault-tolerant quantum computing in the FBQC model is possible with currently achievable levels of optical losses in an integrated photonic implementation, provided that we can create and detect single photons of the resource states with a total marginal efficiency higher than 0.973.
Bell measurements (BMs) are ubiquitous in quantum information and technology. They are basic elements for quantum commmunication, computation, and error correction. In particular, when performed on logical qubits encoded in physical photonic qubits, they allow for a read-out of stabilizer syndrome information to enhance loss tolerance in qubit-state transmission and fusion. However, even in an ideal setting without photon loss, BMs cannot be done perfectly based on the simplest experimental toolbox of linear optics. Here we demonstrate that any logical BM on stabilizer codes can always be mapped onto a single physical BM perfomed on any qubit pair from the two codes. As a necessary condition for the success of a logical BM, this provides a general upper bound on its success probability, especially ruling out the possibility that the stabilizer information obtainable from only partially succeeding, physical linear-optics BMs could be combined into the full logical stabilizer information. We formulate sufficient criteria to find schemes for which a single successful BM on the physical level will always allow to obtain the full logical information by suitably adapting the subsequent physical measurements. Our approach based on stabilizer group theory is generally applicable to any stabilizer code, which we demonstrate for quantum parity, five-qubit, standard and rotated planar surface, tree, and seven-qubit Steane codes. Our schemes attain the general upper bound for all these codes, while this bound had previously only been reached for the quantum parity code.
Building fault-tolerant quantum computers with large numbers of logical qubits requires both scalable hardware architectures and error-correcting codes that make efficient use of physical qubits. Photonic interconnects address both of these challenges by allowing the physical qubits to be distributed across multiple processors while providing the non-local connectivity necessary to implement resource-efficient codes such as high-rate quantum low-density parity-check (qLDPC) codes. A key requirement for realising this architecture is the ability to perform stabiliser measurements between remote processors, which has not previously been demonstrated experimentally. Here we report the first experimental demonstration of distributed quantum error detection and correction. We generate entanglement between network qubits in two separate trapped-ion processors and use it to perform remote syndrome measurements on data qubits. We first realise a distributed [[2, 1, 1]] repetition code, detecting phase-flip errors on a logical qubit encoded across the two modules in real time and suppressing logical errors. We then combine these mid-circuit syndrome measurements with real-time feedforward to actively correct arbitrary single-qubit Pauli errors on a distributed Bell state. These results provide an experimental foundation for quantum error correction (QEC) across modular quantum architectures.
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.
Several emerging quantum technologies, including quantum networks, and modular and fusion-based quantum computing, rely crucially on the ability to perform photonic Bell state measurements. Therefore, photon losses and the 50% success probablity upper bound of Bell state measurements pose a critical limitation to photonic quantum technologies. Here, we develop protocols that overcome these two key challenges through logical encoding of photonic qubits. Our approach uses a tree graph state logical encoding, which can be produced deterministically with a few quantum emitters, and achieves near-deterministic logical photonic Bell state measurements while also protecting against errors including photon losses, with a record loss-tolerance threshold.