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:quant-ph/0405157 · Physical Review Letters

Resource-Efficient Linear Optical Quantum Computation

Dan E. Browne, Terry Rudolph

Published Jun 27, 2005• 790 citations
arXivHTMLPDF

Abstract

We introduce a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons. We achieve a much greater degree of efficiency and a simpler implementation than previous proposals. We follow the "cluster state" measurement based quantum computational approach, and show how cluster states may be efficiently generated from pairs of maximally polarization entangled photons using linear optical elements. We demonstrate the universality and usefulness of generic parity measurements, as well as introducing the use of redundant encoding of qubits to enable utilization of destructive measurements--both features of use in a more general context.

DOI
10.1103/physrevlett.95.010501

Related papers

Deterministic Linear Optics Quantum Computation with Single Photon Qubits

Nadav Yoran, Benni Reznik

We suggest an efficient scheme for quantum computation with linear optical elements, where the qubits are encoded in single photon states. The scheme reduces the resources required per logical gate by several orders of magnitude, compared to an earlier proposal of Knill, Laflamme, and Milburn, while the resource overhead per gate is independent of the length of the computation. A central feature of the scheme, enabling these improvements, is the prior construction of a "linked" photon state designed according to the particular quantum circuit one wishes to process. Once this state has been successfully prepared, the computation is pursued deterministically by a sequence of teleportation steps.

arXiv:quant-ph/0303008•Physical Review Letters•Jul 17, 2003•138 citations

Towards practical linear optical quantum computing

Mercedes Gimeno-Segovia

Quantum computing promises a new paradigm of computation where information is processed in a way that has no classical analogue. There are a number of physical platforms conducive to quantum computation, each with a number of advantages and challenges. Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. Their low decoherence rates make them particularly favourable, however the inability to perform deterministic two-qubit gates and the issue of photon loss are challenges that need to be overcome. In this thesis we explore the construction of a linear optical quantum computer based on the cluster state model. We identify the different necessary stages: state preparation, cluster state construction and implementation of quantum error correcting codes, and address the challenges that arise in each of these stages. For the state preparation, we propose a series of linear optical circuits for the generation of small entangled states, assessing their performance under different scenarios. For the cluster state construction, we introduce a ballistic scheme which not only consumes an order of magnitude fewer resources than previously proposed schemes, but also benefits from a natural loss tolerance. Based on this scheme, we propose a full architectural blueprint with fixed physical depth. We make investigations into the resource efficiency of this architecture and propose a new multiplexing scheme which optimises the use of resources. Finally, we study the integration of quantum error-correcting codes in the linear optical scheme proposed and suggest three ways in which the linear optical scheme can be made fault-tolerant.

•Nov 1, 2015•14 citations

From Three-Photon Greenberger-Horne-Zeilinger States to Ballistic Universal Quantum Computation

Mercedes Gimeno-Segovia, Pete Shadbolt, Dan E. Browne +1 more

Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. A series of increasingly efficient proposals have shown linear-optical quantum computing to be formally scalable. However, existing schemes typically require extensive adaptive switching, which is experimentally challenging and noisy, thousands of photon sources per renormalized qubit, and/or large quantum memories for repeat-until-success strategies. Our work overcomes all these problems. We present a scheme to construct a cluster state universal for quantum computation, which uses no adaptive switching, no large memories, and which is at least an order of magnitude more resource efficient than previous passive schemes. Unlike previous proposals, it is constructed entirely from loss-detecting gates and offers a robustness to photon loss. Even without the use of an active loss-tolerant encoding, our scheme naturally tolerates a total loss rate ∼1.6% in the photons detected in the gates. This scheme uses only 3 Greenberger-Horne-Zeilinger states as a resource, together with a passive linear-optical network. We fully describe and model the iterative process of cluster generation, including photon loss and gate failure. This demonstrates that building a linear-optical quantum computer needs to be less challenging than previously thought.

arXiv:1410.3720•Physical Review Letters•Jul 8, 2015•215 citations

Resource-efficient generation of linear cluster states by linear optics with postselection

Dmitry B. Uskov, Paul M. Alsing, Michael L. Fanto +4 more

Abstract We report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon–photon entangling operations are currently limited to measurement-assisted stochastic transformations. A critical parameter for assessing the efficiency of such transformations is the success probability of a desired measurement outcome. At present there are several experimental groups that are capable of generating multi-photon cluster states carrying more than eight qubits. Separate photonic qubits or small clusters can be fused into a single cluster state by a probabilistic optical CZ gate conditioned on simultaneous detection of all photons with 1/9 success probability for each gate. This design mechanically follows the original theoretical scheme of cluster state generation proposed more than a decade ago by Raussendorf, Browne and Briegel. The optimality of the destructive CZ gate in application to linear optical cluster state generation has not been analyzed previously. Our results reveal that this method is far from the optimal one. Employing numerical optimization we have identified that the maximal success probability of fusing n unentangled dual-rail optical qubits into a linear cluster state is equal to an m -tuple of photonic Bell pair states, commonly generated via spontaneous parametric down-conversion, can be fused into a single cluster with the maximal success probability of (1/4) m −1 .

Journal of Physics B Atomic Molecular and Optical Physics•Jan 30, 2015•6 citations

Efficient parity-encoded optical quantum computing

Alexei Gilchrist, Anthony Hayes, Timothy C. Ralph

We present a linear optics quantum computation scheme with a greatly reduced cost in resources compared to that proposed by Knill, Laflamme, and Milburn (KLM). The scheme makes use of elements from cluster state computation but retains the circuit based approach of KLM.

arXiv:quant-ph/0505125•Physical Review A•May 22, 2007•26 citations

Towards fault-tolerant linear optics quantum computing

A. G. Hayes

Quantum computing is an exciting field that promises great improvements to our ability to solve certain intractable classes of problem. Implementing a quantum computer will require a physical system in which quantum effects are strongly evident. Many different physical systems have been proposed for this task, including ion traps, quantum dots, neutral atoms and photons. This thesis focuses on optical implementations of a quantum computer, and specifically on single-photon designs, as opposed to those utilising coherent states. Photonic systems have shown a great deal of promise for quantum computing tasks since it was shown by Knill, Laflamme and Milburn (KLM) that scalable efficient quantum computing could be performed using only linear optical elements and measurement. This was made viable through the use of error-correcting codes. The work in this thesis covers the use of error-correcting codes in single-photon linear optics quantum computing (LOQC). The central feature of these schemes is the parity code introduced by KLM and used to overcome the gate errors that are inherent in this type of LOQC. First is a discussion of an improved scheme that incorporates the fusion gates used in Browne and Rudolph's cluster state proposal in order to simplify the encoding and gate procedures. This results in high-probability gates with a resource usage comparable to the cluster state schemes. The remainder of the thesis examines the application of further error correcting codes to handle other errors that may arise in any practical implementation of an optical quantum computer. The most significant type of error in any optical system is photon loss, and hence an extension of the parity code is presented that allows loss errors to be detected and corrected. Procedures for performing universal quantum computation whilst employing this encoding are also described. These enable the establishment of loss thresholds for parity-state based LOQC, revealing this code is capable of handling up to 10\% loss in all elements during general computation, or 17\% if it is used solely as an active memory. Although loss is the most common type of optical error, other types of error will also become an issue when attempting to produce large quantum computing systems. An analysis of the error thresholds and resource usage which can be expected when applying a general error correcting code such as the Steane code to this type of LOQC system is also presented. The error thresholds and resource requirements established are greater than those found for cat state optical quantum computing, but fall below those calculated for cluster states. However, the resource requirements of the scheme are significantly smaller than the cluster state requirements for an equivalent circuit. Finally, a new experiment is proposed, achievable with today's technology, for testing the loss-tolerant encoding described earlier. Expansions of the experiment that would demonstrate tolerance of actual experimental error are also discussed.

•Oct 1, 2010•0 citations
We introduce a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons. We achieve a much greater degree of efficiency and a simpler implementation than previous proposals. We follow the "cluster state" measurement based quantum computational approach, and show how cluster states may be efficiently generated from pairs of maximally polarization entangled photons using linear optical elements. We demonstrate the universality and usefulness of generic parity measurements, as well as introducing the use of redundant encoding of qubits to enable utilization of destructive measurements--both features of use in a more general context.
We suggest an efficient scheme for quantum computation with linear optical elements, where the qubits are encoded in single photon states. The scheme reduces the resources required per logical gate by several orders of magnitude, compared to an earlier proposal of Knill, Laflamme, and Milburn, while the resource overhead per gate is independent of the length of the computation. A central feature of the scheme, enabling these improvements, is the prior construction of a "linked" photon state designed according to the particular quantum circuit one wishes to process. Once this state has been successfully prepared, the computation is pursued deterministically by a sequence of teleportation steps.
Quantum computing promises a new paradigm of computation where information is processed in a way that has no classical analogue. There are a number of physical platforms conducive to quantum computation, each with a number of advantages and challenges. Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. Their low decoherence rates make them particularly favourable, however the inability to perform deterministic two-qubit gates and the issue of photon loss are challenges that need to be overcome. In this thesis we explore the construction of a linear optical quantum computer based on the cluster state model. We identify the different necessary stages: state preparation, cluster state construction and implementation of quantum error correcting codes, and address the challenges that arise in each of these stages. For the state preparation, we propose a series of linear optical circuits for the generation of small entangled states, assessing their performance under different scenarios. For the cluster state construction, we introduce a ballistic scheme which not only consumes an order of magnitude fewer resources than previously proposed schemes, but also benefits from a natural loss tolerance. Based on this scheme, we propose a full architectural blueprint with fixed physical depth. We make investigations into the resource efficiency of this architecture and propose a new multiplexing scheme which optimises the use of resources. Finally, we study the integration of quantum error-correcting codes in the linear optical scheme proposed and suggest three ways in which the linear optical scheme can be made fault-tolerant.
Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. A series of increasingly efficient proposals have shown linear-optical quantum computing to be formally scalable. However, existing schemes typically require extensive adaptive switching, which is experimentally challenging and noisy, thousands of photon sources per renormalized qubit, and/or large quantum memories for repeat-until-success strategies. Our work overcomes all these problems. We present a scheme to construct a cluster state universal for quantum computation, which uses no adaptive switching, no large memories, and which is at least an order of magnitude more resource efficient than previous passive schemes. Unlike previous proposals, it is constructed entirely from loss-detecting gates and offers a robustness to photon loss. Even without the use of an active loss-tolerant encoding, our scheme naturally tolerates a total loss rate ∼1.6% in the photons detected in the gates. This scheme uses only 3 Greenberger-Horne-Zeilinger states as a resource, together with a passive linear-optical network. We fully describe and model the iterative process of cluster generation, including photon loss and gate failure. This demonstrates that building a linear-optical quantum computer needs to be less challenging than previously thought.
Abstract We report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon–photon entangling operations are currently limited to measurement-assisted stochastic transformations. A critical parameter for assessing the efficiency of such transformations is the success probability of a desired measurement outcome. At present there are several experimental groups that are capable of generating multi-photon cluster states carrying more than eight qubits. Separate photonic qubits or small clusters can be fused into a single cluster state by a probabilistic optical CZ gate conditioned on simultaneous detection of all photons with 1/9 success probability for each gate. This design mechanically follows the original theoretical scheme of cluster state generation proposed more than a decade ago by Raussendorf, Browne and Briegel. The optimality of the destructive CZ gate in application to linear optical cluster state generation has not been analyzed previously. Our results reveal that this method is far from the optimal one. Employing numerical optimization we have identified that the maximal success probability of fusing n unentangled dual-rail optical qubits into a linear cluster state is equal to an m -tuple of photonic Bell pair states, commonly generated via spontaneous parametric down-conversion, can be fused into a single cluster with the maximal success probability of (1/4) m −1 .
Quantum computing is an exciting field that promises great improvements to our ability to solve certain intractable classes of problem. Implementing a quantum computer will require a physical system in which quantum effects are strongly evident. Many different physical systems have been proposed for this task, including ion traps, quantum dots, neutral atoms and photons. This thesis focuses on optical implementations of a quantum computer, and specifically on single-photon designs, as opposed to those utilising coherent states. Photonic systems have shown a great deal of promise for quantum computing tasks since it was shown by Knill, Laflamme and Milburn (KLM) that scalable efficient quantum computing could be performed using only linear optical elements and measurement. This was made viable through the use of error-correcting codes. The work in this thesis covers the use of error-correcting codes in single-photon linear optics quantum computing (LOQC). The central feature of these schemes is the parity code introduced by KLM and used to overcome the gate errors that are inherent in this type of LOQC. First is a discussion of an improved scheme that incorporates the fusion gates used in Browne and Rudolph's cluster state proposal in order to simplify the encoding and gate procedures. This results in high-probability gates with a resource usage comparable to the cluster state schemes. The remainder of the thesis examines the application of further error correcting codes to handle other errors that may arise in any practical implementation of an optical quantum computer. The most significant type of error in any optical system is photon loss, and hence an extension of the parity code is presented that allows loss errors to be detected and corrected. Procedures for performing universal quantum computation whilst employing this encoding are also described. These enable the establishment of loss thresholds for parity-state based LOQC, revealing this code is capable of handling up to 10\% loss in all elements during general computation, or 17\% if it is used solely as an active memory. Although loss is the most common type of optical error, other types of error will also become an issue when attempting to produce large quantum computing systems. An analysis of the error thresholds and resource usage which can be expected when applying a general error correcting code such as the Steane code to this type of LOQC system is also presented. The error thresholds and resource requirements established are greater than those found for cat state optical quantum computing, but fall below those calculated for cluster states. However, the resource requirements of the scheme are significantly smaller than the cluster state requirements for an equivalent circuit. Finally, a new experiment is proposed, achievable with today's technology, for testing the loss-tolerant encoding described earlier. Expansions of the experiment that would demonstrate tolerance of actual experimental error are also discussed.