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:2601.08820 · Physical Review A

Optimal logical Bell measurements on stabilizer codes with linear optics

Simon D. Reiß, Peter van Loock

quant-phSubmitted Jan 13, 2026• Announced Jan 14, 2026• 5 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/qj8s-j274
Comments
68 pages, 32 figures

Related papers

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

Efficiencies of logical Bell measurements on Calderbank-Shor-Steane codes with static linear optics

Frank L. Schmidt, Peter van Loock

We show how the efficiency of a logical Bell measurement (BM) can be calculated for arbitrary Calderbank-Shor-Steane (CSS) codes with the experimentally important constraint of using only transversal static linear-optical BMs on the physical single-photon qubit level. For this purpose, we utilize the codes' description in terms of stabilizers in order to calculate general efficiencies for the loss-free case, but also for specific cases including photon loss. These efficiencies can be, for instance, used for obtaining transmission rates of all-optical quantum repeaters. In the loss-free case, we demonstrate that the important class of CSS codes with identical physical-qubit support for the two logical Pauli ($Z$ and $X$) operators can only achieve a logical BM efficiency of $\frac{1}{2}$ if one always employs the same ancilla-free static linear optical BMs on the physical level. We apply our methods to various CSS codes including two-dimensional planar color and planar surface codes. We then find that in many cases, the fixed use of the standard linear-optical BM for all physical BMs is suboptimal and performing linear-optical transformations before doing the standard linear-optical BM (still without any ancillary photons and without any feedforward) can increase the efficiency enormously. In fact, using this generalization in the no-loss (or sometimes also in the low-loss) case allows us, on the one hand, to improve the logical BM efficiency of quantum parity codes compared to previously known results and, on the other hand, it also enables us to enhance the efficiency of two-dimensional planar color codes, whose efficiency is otherwise subject to the above $\frac{1}{2}$ bound, to arbitrarily close to unity.

arXiv:1812.09278•Physical Review A•Jun 10, 2019•18 citations

Linear Optical Logical Bell State Measurements with Optimal Loss-Tolerance Threshold

Paul Hilaire, Yaron Castor, Edwin Barnes +2 more

Quantum threshold theorems impose hard limits on the hardware capabilities to process quantum information.We derive tight and fundamental upper bounds to loss-tolerance thresholds in different linearoptical quantum information processing settings through an adversarial framework, taking into account the intrinsically probabilistic nature of linear optical Bell measurements.For logical Bell state measurements-ubiquitous operations in photonic quantum information-we demonstrate analytically that linear optics can achieve the fundamental loss threshold imposed by the no-cloning theorem even though, following the work of Lee et al. [Phys.Rev. A 100, 052303 (2019)] the constraint was widely assumed to be stricter.We spotlight the assumptions of the latter publication and find their bound holds for a logical Bell measurement built from adaptive physical linear-optical Bell measurements.We also give an explicit even stricter bound for nonadaptive Bell measurements.

arXiv:2302.07908•PRX Quantum•Nov 6, 2023•16 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

Lower overhead fault-tolerant building blocks for noisy quantum computers

Prithviraj Prabhu

Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms. This can be remedied by protecting quantum information with a quantum error-correcting code, where the logical information of an algorithmic qubit is spread across multiple physical qubits. Individual quantum errors are then located and corrected by the fault-tolerant measurement of multi-qubit stabilizer operators (parity checks). Unfortunately, error correction and fault tolerance both impose large demands on the qubit overhead: hundreds to thousands of physical qubits per logical qubit. We reduce the spacetime cost of fault tolerance by redesigning key building blocks of an error-corrected quantum computer. First, we develop a combinatorial proof with flag fault tolerance that exponentially reduces the extra qubits needed to measure a stabilizer of any size, while tolerating one fault. We leverage these proofs to then design state preparation circuits for the Steane and Golay codes with 100% yield. Next, we improve error correction on a planar layout by showing that a distance-four code encoding six logical qubits protects information as well as the distance-five surface code, using one-tenth as many physical qubits. Finally, we optimize the time overhead of logical gates in surface code quantum computers by protecting measurement results with a classical code, cutting computation time by a factor of two to six. Our hardware-agnostic optimizations of fault tolerance overheads thus suggest new routes to advance the timeline of error-free quantum computing.

quant-pharXiv:2605.12385•May 13, 2026•0 citations

Nearly deterministic Bell measurement with multiphoton entanglement for efficient quantum-information processing

Seung-Woo Lee, Ki-min Park B, Timothy C. Ralph +1 more

We present a detailed analysis of the Bell measurement scheme proposed in Lee et al. [Phys. Rev. Lett. 114, 113603 (2015)] based on a logical qubit using Greenberger-Horne-Zeilinger entanglement of photons. The success probability of the proposed Bell measurement can be made arbitrarily high using only linear optics as the number of photons in a logical qubit increases. We compare our scheme with all the other proposals, using single-photon qubits, coherent-state qubits, or hybrid qubits, suggested to enhance the efficiency of the Bell measurement. As a remarkable advantage, our scheme requires only photon on-off measurements, while photon number resolving detectors are necessary for all the other proposals. We find that the scheme based on coherent-state qubits shows the best performance with respect to the attained success probability in terms of the average number of photons used in the process, while our scheme outperforms the schemes using single-photon qubits. We finally show that efficient quantum communication and fault-tolerant quantum computation can be realized using our approach.

arXiv:1510.03142•Physical Review A•Nov 19, 2015•20 citations
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.
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.
We show how the efficiency of a logical Bell measurement (BM) can be calculated for arbitrary Calderbank-Shor-Steane (CSS) codes with the experimentally important constraint of using only transversal static linear-optical BMs on the physical single-photon qubit level. For this purpose, we utilize the codes' description in terms of stabilizers in order to calculate general efficiencies for the loss-free case, but also for specific cases including photon loss. These efficiencies can be, for instance, used for obtaining transmission rates of all-optical quantum repeaters. In the loss-free case, we demonstrate that the important class of CSS codes with identical physical-qubit support for the two logical Pauli (ZZZ and XXX) operators can only achieve a logical BM efficiency of 12\frac{1}{2}21​ if one always employs the same ancilla-free static linear optical BMs on the physical level. We apply our methods to various CSS codes including two-dimensional planar color and planar surface codes. We then find that in many cases, the fixed use of the standard linear-optical BM for all physical BMs is suboptimal and performing linear-optical transformations before doing the standard linear-optical BM (still without any ancillary photons and without any feedforward) can increase the efficiency enormously. In fact, using this generalization in the no-loss (or sometimes also in the low-loss) case allows us, on the one hand, to improve the logical BM efficiency of quantum parity codes compared to previously known results and, on the other hand, it also enables us to enhance the efficiency of two-dimensional planar color codes, whose efficiency is otherwise subject to the above 12\frac{1}{2}21​ bound, to arbitrarily close to unity.
Quantum threshold theorems impose hard limits on the hardware capabilities to process quantum information.We derive tight and fundamental upper bounds to loss-tolerance thresholds in different linearoptical quantum information processing settings through an adversarial framework, taking into account the intrinsically probabilistic nature of linear optical Bell measurements.For logical Bell state measurements-ubiquitous operations in photonic quantum information-we demonstrate analytically that linear optics can achieve the fundamental loss threshold imposed by the no-cloning theorem even though, following the work of Lee et al. [Phys.Rev. A 100, 052303 (2019)] the constraint was widely assumed to be stricter.We spotlight the assumptions of the latter publication and find their bound holds for a logical Bell measurement built from adaptive physical linear-optical Bell measurements.We also give an explicit even stricter bound for nonadaptive Bell measurements.
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.
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms. This can be remedied by protecting quantum information with a quantum error-correcting code, where the logical information of an algorithmic qubit is spread across multiple physical qubits. Individual quantum errors are then located and corrected by the fault-tolerant measurement of multi-qubit stabilizer operators (parity checks). Unfortunately, error correction and fault tolerance both impose large demands on the qubit overhead: hundreds to thousands of physical qubits per logical qubit. We reduce the spacetime cost of fault tolerance by redesigning key building blocks of an error-corrected quantum computer. First, we develop a combinatorial proof with flag fault tolerance that exponentially reduces the extra qubits needed to measure a stabilizer of any size, while tolerating one fault. We leverage these proofs to then design state preparation circuits for the Steane and Golay codes with 100% yield. Next, we improve error correction on a planar layout by showing that a distance-four code encoding six logical qubits protects information as well as the distance-five surface code, using one-tenth as many physical qubits. Finally, we optimize the time overhead of logical gates in surface code quantum computers by protecting measurement results with a classical code, cutting computation time by a factor of two to six. Our hardware-agnostic optimizations of fault tolerance overheads thus suggest new routes to advance the timeline of error-free quantum computing.
We present a detailed analysis of the Bell measurement scheme proposed in Lee et al. [Phys. Rev. Lett. 114, 113603 (2015)] based on a logical qubit using Greenberger-Horne-Zeilinger entanglement of photons. The success probability of the proposed Bell measurement can be made arbitrarily high using only linear optics as the number of photons in a logical qubit increases. We compare our scheme with all the other proposals, using single-photon qubits, coherent-state qubits, or hybrid qubits, suggested to enhance the efficiency of the Bell measurement. As a remarkable advantage, our scheme requires only photon on-off measurements, while photon number resolving detectors are necessary for all the other proposals. We find that the scheme based on coherent-state qubits shows the best performance with respect to the attained success probability in terms of the average number of photons used in the process, while our scheme outperforms the schemes using single-photon qubits. We finally show that efficient quantum communication and fault-tolerant quantum computation can be realized using our approach.