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.
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.
Linear-optical realizations of Bell state measurement (BSM) on two single-photon qubits succeed with probability
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 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 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
ps>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
ps 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
ps, the probability with which the BSM circuit declares a ``success,'' versus the probability of error
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, this tradeoff may enable better quantum repeater designs by potentially increasing the entanglement generation rates with
ps exceeding what is possible with traditionally studied USD operation of BSMs.
Fusion measurements are a key primitive for linear-optical quantum computing and quantum networks. Type-I and type-II fusion gates are widely used to combine small entangled resource states into larger photonic states, but without ancillary resources their success probability is limited to
1/2. Existing
3/4-efficient type-I schemes rely on entangled Bell-pair ancillary states, whose preparation is itself probabilistic and resource-intensive. Here we propose a boosted type-I fusion gate using only four ancillary single photons and standard linear-optical primitives. For multiqubit GHZ and graph states, the gate succeeds directly with probability
5/8, while a distillation protocol converts partially entangled outcomes into additional successful events, raising the total success probability to
11/16 after one stage and asymptotically to
3/4. We quantify the practical advantage of this scheme by estimating the photonic resources required for generating representative large entangled photonic states and show that the proposed gate significantly reduces the required overhead compared with existing schemes. These results expand the set of resource-efficient linear-optical primitives and enable a substantial reduction in the resource requirements for scalable photonic quantum computing and quantum communication.
Abstract Quantum teleportation has proven to be fundamental for many quantum information and communication processes. The core concept can be exploited in many tasks, from the transmission of quantum states, quantum repeaters, to quantum computing. However, for linear-optical systems, the efficiency of teleportation is directly linked to the success probability of the involved Bell-state measurement (BSM). In most implementations, this is realized by linear optics with an intrinsically limited success probability of 50%. Here, we demonstrate quantum teleportation surpassing this limit. We achieve an average fidelity of the teleported states of 0.8677 ± 0.0024, leading to an overall acceptance rate of the teleportation of 69.71 ± 0.75%. We obtain this boosted success probability by generating ancillary photonic states that are interfered with the Bell states. Thus, our work demonstrates the boosting BSMs in quantum-technology applications and our scheme could directly be applied to, e.g., quantum repeaters.