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:0705.1904 · New Journal of Physics

Loss tolerant linear optical quantum memory by measurement-based quantum computing

Michael Varnava, Dan E. Browne, Terry Rudolph

Published Jun 29, 2007• 26 citations
arXivHTMLPDF

Abstract

We give a scheme for loss tolerantly building a linear optical quantum memory which itself is tolerant to qubit loss. We use the encoding recently introduced in Varnava et al 2006 Phys. Rev. Lett. 97 120501, and give a method for efficiently achieving this. The entire approach resides within the 'one-way' model for quantum computing (Raussendorf and Briegel 2001 Phys. Rev. Lett. 86 5188–91; Raussendorf et al 2003 Phys. Rev. A 68 022312). Our results suggest that it is possible to build a loss tolerant quantum memory, such that if the requirement is to keep the data stored over arbitrarily long times then this is possible with only polynomially increasing resources and logarithmically increasing individual photon life-times.

DOI
10.1088/1367-2630/9/6/203

Related papers

Loss-Tolerant Optical Qubits

Timothy C. Ralph, Anthony Hayes, Alexei Gilchrist

We present a linear optics quantum computation scheme that employs a new encoding approach that incrementally adds qubits and is tolerant to photon loss errors. The scheme employs a circuit model but uses techniques from cluster-state computation and achieves comparable resource usage. To illustrate our techniques we describe a quantum memory which is fault tolerant to photon loss.

arXiv:quant-ph/0501184•Physical Review Letters•Aug 30, 2005•172 citations

Linear optical quantum memory

Jonathan P. Dowling, Hwang Lee, Farrokh Vatan +2 more

In quantum computing a very important problem is that of building a quantum memory. We show that by using new techniques from scalable linear optical quantum computing (LOQC), it is possible to make an all linear-optical quantum memory capable of storing the computational qubit indefinitely. The same approach can be used to make a simple quantum repeater. Recent work by our group has shown how linear optical quantum computing ideas, recently proposed by Knill, Laflamme, and Milburn, and also by Franson and co-workers, can be used to make a scalable quantum repeater [1]. However, this repeater still requires a quantum memory to operate, which apparently requires resources other than those required for linear optical quantum computing. In this presentation, we will explicitly show how to construct a quantum memory using only LOQC resources and employing a simple error correction code for photon loss. The result is a simple, scalable, quantum memory. The device can also be operated as a quantum repeater that is far simpler than our original proposal to implement.

Frontiers in Optics•Jan 1, 2003•0 citations

Highly photon-loss-tolerant quantum computing using hybrid qubits

S. Omkar, Yong Siah Teo, Seung-Woo Lee +1 more

We investigate a scheme for topological quantum computing using optical hybrid qubits and make an extensive comparison with previous all-optical schemes. We show that the photon loss threshold reported by Omkar et al. [Phys. Rev. Lett. 125, 060501 (2020)] can be improved further by employing postselection and multi-Bell-state-measurement-based entangling operations to create a special cluster state, known as Raussendorf lattice for topological quantum computation. In particular, the photon loss threshold is enhanced up to $5.7\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$, which is the highest reported value given a reasonable error model. This improvement is obtained at the price of consuming more resources by an order of magnitude compared with the scheme in the aforementioned reference. Nevertheless, this scheme remains resource-efficient compared with other known optical schemes for fault-tolerant quantum computation.

arXiv:2011.04209•Physical Review A•Mar 9, 2021•22 citations

Encoded-Fusion-Based Quantum Computation for High Thresholds with Linear Optics

Wooyeong Song, Nuri Kang, Yong‐Su Kim +1 more

We propose a fault-tolerant quantum computation scheme in a measurement-based manner with finite-sized entangled resource states and encoded-fusion scheme with linear optics. The encoded fusion is an entangled measurement devised to enhance the fusion success probability in the presence of losses and errors based on a quantum error-correcting code. We apply an encoded-fusion scheme, which can be performed with linear optics and active feedforwards to implement the generalized Shor code, to construct a fault-tolerant network configuration in a three-dimensional Raussendorf-Harrington-Goyal lattice based on the surface code. Numerical simulations show that our scheme allows us to achieve up to 10 times higher loss thresholds than nonencoded fusion approaches with limited numbers of photons used in fusion. Our scheme paves an efficient route toward fault-tolerant quantum computing with finite-sized entangled resource states and linear optics.

arXiv:2408.01041•Physical Review Letters•Aug 1, 2024•15 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

Loss-tolerant operations in parity-code linear optics quantum computing

Anthony Hayes, Alexei Gilchrist, Timothy C. Ralph

A heavy focus for optical quantum computing is the introduction of error correction, and the minimization of resource requirements. We detail a complete encoding and manipulation scheme designed for circuit-model linear optics quantum computing, incorporating scalable operations and loss-tolerant architecture. We also calculate loss thresholds for the gate systems described, with an efficiency of $83%$ required for the single-qubit operations, and $90%$ for the two-qubit controlled-NOT gate.

arXiv:0707.0903•Physical Review A•Jan 9, 2008•6 citations
We give a scheme for loss tolerantly building a linear optical quantum memory which itself is tolerant to qubit loss. We use the encoding recently introduced in Varnava et al 2006 Phys. Rev. Lett. 97 120501, and give a method for efficiently achieving this. The entire approach resides within the 'one-way' model for quantum computing (Raussendorf and Briegel 2001 Phys. Rev. Lett. 86 5188–91; Raussendorf et al 2003 Phys. Rev. A 68 022312). Our results suggest that it is possible to build a loss tolerant quantum memory, such that if the requirement is to keep the data stored over arbitrarily long times then this is possible with only polynomially increasing resources and logarithmically increasing individual photon life-times.
In quantum computing a very important problem is that of building a quantum memory. We show that by using new techniques from scalable linear optical quantum computing (LOQC), it is possible to make an all linear-optical quantum memory capable of storing the computational qubit indefinitely. The same approach can be used to make a simple quantum repeater. Recent work by our group has shown how linear optical quantum computing ideas, recently proposed by Knill, Laflamme, and Milburn, and also by Franson and co-workers, can be used to make a scalable quantum repeater [1]. However, this repeater still requires a quantum memory to operate, which apparently requires resources other than those required for linear optical quantum computing. In this presentation, we will explicitly show how to construct a quantum memory using only LOQC resources and employing a simple error correction code for photon loss. The result is a simple, scalable, quantum memory. The device can also be operated as a quantum repeater that is far simpler than our original proposal to implement.
We investigate a scheme for topological quantum computing using optical hybrid qubits and make an extensive comparison with previous all-optical schemes. We show that the photon loss threshold reported by Omkar et al. [Phys. Rev. Lett. 125, 060501 (2020)] can be improved further by employing postselection and multi-Bell-state-measurement-based entangling operations to create a special cluster state, known as Raussendorf lattice for topological quantum computation. In particular, the photon loss threshold is enhanced up to $5.7\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$, which is the highest reported value given a reasonable error model. This improvement is obtained at the price of consuming more resources by an order of magnitude compared with the scheme in the aforementioned reference. Nevertheless, this scheme remains resource-efficient compared with other known optical schemes for fault-tolerant quantum computation.
We propose a fault-tolerant quantum computation scheme in a measurement-based manner with finite-sized entangled resource states and encoded-fusion scheme with linear optics. The encoded fusion is an entangled measurement devised to enhance the fusion success probability in the presence of losses and errors based on a quantum error-correcting code. We apply an encoded-fusion scheme, which can be performed with linear optics and active feedforwards to implement the generalized Shor code, to construct a fault-tolerant network configuration in a three-dimensional Raussendorf-Harrington-Goyal lattice based on the surface code. Numerical simulations show that our scheme allows us to achieve up to 10 times higher loss thresholds than nonencoded fusion approaches with limited numbers of photons used in fusion. Our scheme paves an efficient route toward fault-tolerant quantum computing with finite-sized entangled resource states and linear optics.
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.
A heavy focus for optical quantum computing is the introduction of error correction, and the minimization of resource requirements. We detail a complete encoding and manipulation scheme designed for circuit-model linear optics quantum computing, incorporating scalable operations and loss-tolerant architecture. We also calculate loss thresholds for the gate systems described, with an efficiency of 8383%83 required for the single-qubit operations, and 9090%90 for the two-qubit controlled-NOT gate.