We propose a scheme for efficient construction of graph states using realistic linear optics, imperfect photon source, and single-photon detectors. For any many-body entanglement represented by tree-graph states, we prove that the overall preparation and detection efficiency scales nearly polynomially with the size of the graph, no matter how small the efficiencies for the photon source and the detectors.
We propose a scheme for efficient construction of graph states using realistic linear optics, imperfect photon source, and single-photon detectors. For any many-body entanglement represented by tree-graph states, we prove that the overall preparation and detection efficiency scales nearly polynomially with the size of the graph, no matter how small the efficiencies for the photon source and the detectors.
Linear optics, combined with practical photon source and single-photon detectors, has provided a powerful tool to test a number of quantum information protocols. In the linear optics implementations, the post-selection technique based on photon detections typically plays a critical role. As one scales up the system, the post-selection technique generally leads to very inefficient (exponential) scaling of the overall efficiency, which limits the implementation to small systems. In the past few years, two approaches have been proposed to circumvent this obstacle for different kinds of quantum information processing. In the first approach, a remarkable proposal, generally referred to as linear optics quantum computation, was first put forward by Knill, Laflamme, and Mil-burn (KLM) [1] and then improved by a number of others. In this approach, one overcomes the scaling problem for linear optics computation through quantum error correction by requiring the efficiencies for the photon source and the detectors to attain a high threshold value [1]. The threshold efficiency has been improved considerably in the past few years, with the most recent estimate about Linear optics, combined with practical photon source and single-photon detectors, has provided a powerful tool to test a number of quantum information protocols. In the linear optics implementations, the post-selection technique based on photon detections typically plays a critical role. As one scales up the system, the post-selection technique generally leads to very inefficient (exponential) scaling of the overall efficiency, which limits the implementation to small systems. In the past few years, two approaches have been proposed to circumvent this obstacle for different kinds of quantum information processing. In the first approach, a remarkable proposal, generally referred to as linear optics quantum computation, was first put forward by Knill, Laflamme, and Mil-burn (KLM) [1] and then improved by a number of others. In this approach, one overcomes the scaling problem for linear optics computation through quantum error correction by requiring the efficiencies for the photon source and the detectors to attain a high threshold value [1]. The threshold efficiency has been improved considerably in the past few years, with the most recent estimate about 99.4%− 99.7% [2]. In the second approach proposed in Ref. [3], one uses linear optics for implementation of scalable quantum communication through the quantum repeater protocol. This approach overcomes the inefficient scaling through the divide-and-conquer method. In this protocol, one does not have a threshold requirement on the source and the detector efficiencies, which allows its implementation with the state-of-the-art photon detectors.
We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple 3-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network with detectors that need not be photon number resolving. Fusion of graph state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is robust against imperfections in the apparatus.
We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple three-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph-state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph-state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus.
Graph states are central resources for quantum information processing, supporting applications in computation, communication, and error correction. In photonic systems, they are typically assembled from smaller entangled states using probabilistic fusion gates, which demand many photons and suffer from low success rates. We present an optimized scheme for directly generating caterpillar graph states (CGSs)—essential resource states for constructing high-dimensional lattice graph states—using only single-photon sources, linear optics, and heralded measurements. Based on the linear quantum graph (LQG) picture, our method produces CGSs efficiently. For CGSs of length l ≥ 3 , it requires l − 2 fewer photons and achieves a success rate 2 l − 2 times higher than fusion-based approaches. These results demonstrate that the LQG picture provides a powerful and flexible route to generating complex photonic graph states for efficient quantum information processing.
Abstract The central technological appeal of quantum science resides in exploiting quantum effects, such as entanglement, for a variety of applications, including computing, communication and sensing 1 . The overarching challenge in these fields is to address, control and protect systems of many qubits against decoherence 2 . Against this backdrop, optical photons, naturally robust and easy to manipulate, represent ideal qubit carriers. However, the most successful technique so far for creating photonic entanglement 3 is inherently probabilistic and, therefore, subject to severe scalability limitations. Here we report the implementation of a deterministic protocol 4–6 for the creation of photonic entanglement with a single memory atom in a cavity 7 . We interleave controlled single-photon emissions with tailored atomic qubit rotations to efficiently grow Greenberger–Horne–Zeilinger (GHZ) states 8 of up to 14 photons and linear cluster states 9 of up to 12 photons with a fidelity lower bounded by 76(6)% and 56(4)%, respectively. Thanks to a source-to-detection efficiency of 43.18(7)% per photon, we measure these large states about once every minute, which is orders of magnitude faster than in any previous experiment 3,10–13 . In the future, this rate could be increased even further, the scheme could be extended to two atoms in a cavity 14,15 or several sources could be quantum mechanically coupled 16 , to generate higher-dimensional cluster states 17 . Overcoming the limitations encountered by probabilistic schemes for photonic entanglement generation, our results may offer a way towards scalable measurement-based quantum computation 18,19 and communication 20,21 .
The experimental realization of many-body entangled states is one of the main goals of quantum technology as these states are a key resource for quantum computation and quantum sensing. However, increasing the number of photons in an entangled state has been proved to be a painstakingly hard task. This is a result of the nondeterministic emission of current photon sources and the distinguishability between photons from different sources. Moreover, the generation rate and the complexity of the optical setups hinder scalability. Here we present a scheme that is compact, requires a very modest number of components, and avoids the distinguishability issues by using only one single-photon source. States of any number of photons are generated with the same configuration, with no need for increasing the optical setup. The basic operation of this scheme is experimentally demonstrated, and its sensitivity to imperfections is considered.