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

TOPICS IN LINEAR OPTICAL QUANTUM COMPUTATION

Scott Glancy

Published Jan 1, 2004• 0 citations
Publisher

Abstract

This thesis covers several topics in optical quantum computation. A quantum computer is a computational device which is able to manipulate information by performing unitary operations on some physical system whose state can be described as a vector (or mixture of vectors) in a Hilbert space. The basic unit of information, called the qubit, is considered to be a system with two orthogonal states, which are assigned logical values of 0 and 1. Photons make excellent candidates to serve as qubits. They have little interactions with the environment. Many operations can be performed using very simple linear optical devices such as beam splitters and phase shifters. Photons can easily be processed through circuit-like networks. Operations can be performed in very short times. Photons are ideally suited for the long-distance communication of quantum information. The great difficulty in constructing an optical quantum computer is that photons naturally interact weakly with one another. This thesis first gives a brief review of two early approaches to optical quantum computation. It will describe how any discrete unitary operation can be performed using a single photon and a network of beam splitters, and how the Kerr effect can be used to construct a two photon logic gate. Second, this work provides a thorough introduction to the linear optical quantum computer developed by Knill, Laflamme, and Milburn. It then presents this author's results on the reliability of this scheme when implemented using imperfect photon detectors. This author finds that quantum computers of this sort cannot be built using current technology. Third, this dissertation describes a method for constructing a linear optical quantum computer using nearly orthogonal coherent states of light as the qubits. It shows how a universal set of logic operations can be performed, including calculations of the fidelity with which these operations may be accomplished. It discusses methods for reducing and correcting errors and recovering from failed operations. Lastly it describes an analysis of the long distance transmission of the coherent state qubits and shows how transmission errors can be corrected.

DOI
10.7274/6w924b3195g

Related papers

Quantum computation using linear optics

Gerard J Milburn

Summary form only given. Quantum computers are expected to increase the efficiency of solving problems such as factoring large integers. However an experimental implementation of even relatively simple quantum information processing with a few to a dozen qubits presents an enormous technological challenge. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing due to the ease with which photon interference can be observed. However these early proposals required huge single photon optical nonlinearities. Unfortunately currently available optical nonlinearities are too weak and too noisy to be useful. Recently however we have discovered that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photodetectors. Our methods exploit feed forward from photo-detectors and are robust against errors from photon loss and detector inefficiency. In this tutorial I will outline this scheme, highlighting the technical challenges required to implement it. The tutorial will be relatively self contained with a brief introduction to quantum optics and quantum computation.

Quantum Electronics and Laser Science Conference•Jun 25, 2003•0 citations

On Photonic Implementation of Quantum Computers

Svetomir Simonović

The first section of the work investigates light modes as a means of implementing optical qubits and qudits. The modes considered are polarization mode, path mode, transverse spatial mode, frequency mode, temporal bin-mode and temporal mode. Subsequently, mathematical model of linear optical elements like beam splitters (BS) and phase shifters are deduced and their capability of representing any single qubit optical gate is exposed. Finally Knill, Laflamme and Milburn (KLM) method of using linear optical elements to promote nonlinear operations based on nonlinear (nondeterministic) sign-flip gate (NS) is explained, and designs of two qubits conditional sign flip gate (c-z1/16) and CNOT gate, both based on KLM method, are demonstrated. So, universal set of quantum gates based on linear optics is possible.

Advanced Technologies & Materials•Dec 2, 2023•0 citations

Quantum computation with single photons

Pieter Kok, Brendon W. Lovett

In the previous chapter we developed some of the basic aspects of quantum information processing with single photons as qubits. Apart from noting the obvious benefit of using light for quantum communication, we identified some difficulties in manipulating quantum information that is encoded in photons. In particular, it is difficult to construct two-qubit gates for photonic qubits. In this chapter we will have to face this difficulty head-on in our discussion of quantum computation with single photons and linear-optical elements. The possibility of a quantum computer based on single photons, linear optics, and photon counting was demonstrated in a landmark paper by Knill, Laflamme, and Milburn in 2001. Their protocol is commonly referred to as the ‘ klm protocol’. In subsequent years, the klm protocol has been dramatically slimmed down in terms of complexity and the necessary resources to create the universal set of quantum gates. For pedagogical reasons we give the streamlined version here, and we briefly describe the original klm protocol in Appendix 2. We will make extensive use of the results in Section 1.4 about mode transformations, and Section 2.3 about cluster-state quantum computing. We start this chapter, however, with a description of linear-optical networks, and how they fail as deterministic quantum computers. In Section 6.2 we discuss the principle of post-selection, and how this can be used to create probabilistic gates with deterministic feed-forward control.

Cambridge University Press eBooks•Apr 22, 2010•1 citation

Investigating Photonic Quantum Computation

Casey R. Myers

The use of photons as qubits is a promising implementation for quantum computation. The inability of photons to interact, especially with the environment, makes them an ideal physical candidate. However, this also makes them a difficult system to perform two qubit gates on. Recent breakthroughs in photonic quantum computing have shown methods around the requirement of direct photon-photon interaction. In this thesis we study three recently discovered schemes for optical quantum computation. \n \n We first investigate the so called linear optical quantum computing (LOQC) scheme, exploring a method to improve the original proposal by constructing a photon-number QND detector that succeeds with a high probability. In doing this we present a new type of LOQC teleporter, one that can detect the presence of a single photon in an arbitrary polarisation state when the input state is a sum of vacuum and multi-photon terms. This new type of teleporter is an improvement on the original scheme in that the entangled states required can be made offline with fewer entangling operations. \n \n We next investigate the so called quantum bus (qubus) scheme for photonic quantum computing. We show a scheme to measure the party of n qubit states by using a single qubus mode, controlled rotations and displacements. This allows for the syndrome measurements of any stabilizer quantum error correcting code. We extend these results to a fault tolerant scheme to measure an arbitrary Pauli operator of weight n, incorporating so called single bit teleportations. We investigate the construction of a Toffoli gate by using a single qubus mode, controlled rotations and displacements that works with a success probability of at least 25%. We also investigate the use of single bit teleportations to construct a universal set of gates on coherent state type logic and in the construction of cluster states. \n \nWe finally investigate the optical Zeno gate, a gate that uses the Zeno effect in the form of two photon absorbers to induce a CSIGN. We model realistic two photon absorption and include realistic single photon loss for this gate, examining the use of encoding to overcome the single photon loss, showing that our results are competitive with the leading equivalent LOQC scheme.

•Sep 28, 2007•0 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

Optical implementation of quantum computers

John Rarity, Harald Weinfurter

Optical quantum computation was limited to a few photon applications such as quantum cryptography and partial teleportation until 2001. Then the possibility of performing arbitrary logic conditional on certain detection outcomes was introduced by Knill, Laflamme and Milburn ( Nature 2001 409 46). Simple circuits consisting of single photon sources, entangled pair sources, linear optical elements and high efficiency photon counting detectors can be used to develop probabilistic two-photon logic gates. Initially such gates show a low probability of success but can approach the success rate of deterministic (non-linear) logic at the cost of added complexity. These developments have led to the emergence of a novel field of research aimed at improving the efficiency of linear logic and developing the efficient sources and detectors for its implementation. This topical issue of Journal of Optics B: Quantum and Semiclassical Optics is devoted to recent advances in this field. Key to all linear optics gates is the interference effect between separate photons that have no previous history. In this issue we include the first experiment to show such an effect (Rarity et al ), on which many later experiments are based. These interference effects can then be used to entangle separate pairs of particles into higher order entangled states (Zou et al 2005 J. Opt. B: Quantum Semiclass. Opt. 7 119–121) and also to establish entanglement between matter qubits (Kok et al ). Quantum dot single photon sources suitable for linear optics quantum logic are discussed in the paper by Unitt et al while a waveguide source of pair photons is presented by Ducci et al . The difficulties in scaling linear optics quantum computing arise from the low success probabilities of the gates. Introducing a small amount of non-linearity could allow unit efficiency gates to be designed (Munro et al ) while large non-linearities generated by the collective effects in EIT could be used to implement a wide variety of quantum logic functions (Petrosyan). The development of algorithms suitable for optical implementation is addressed by Ellinas et al . Key contributors to this issue are collaborating in the project IST:38864 RAMBOQ which has a primary goal of developing linear optics computation tools and techniques.

Journal of Optics B Quantum and Semiclassical Optics•Jun 30, 2005•0 citations
This thesis covers several topics in optical quantum computation. A quantum computer is a computational device which is able to manipulate information by performing unitary operations on some physical system whose state can be described as a vector (or mixture of vectors) in a Hilbert space. The basic unit of information, called the qubit, is considered to be a system with two orthogonal states, which are assigned logical values of 0 and 1. Photons make excellent candidates to serve as qubits. They have little interactions with the environment. Many operations can be performed using very simple linear optical devices such as beam splitters and phase shifters. Photons can easily be processed through circuit-like networks. Operations can be performed in very short times. Photons are ideally suited for the long-distance communication of quantum information. The great difficulty in constructing an optical quantum computer is that photons naturally interact weakly with one another. This thesis first gives a brief review of two early approaches to optical quantum computation. It will describe how any discrete unitary operation can be performed using a single photon and a network of beam splitters, and how the Kerr effect can be used to construct a two photon logic gate. Second, this work provides a thorough introduction to the linear optical quantum computer developed by Knill, Laflamme, and Milburn. It then presents this author's results on the reliability of this scheme when implemented using imperfect photon detectors. This author finds that quantum computers of this sort cannot be built using current technology. Third, this dissertation describes a method for constructing a linear optical quantum computer using nearly orthogonal coherent states of light as the qubits. It shows how a universal set of logic operations can be performed, including calculations of the fidelity with which these operations may be accomplished. It discusses methods for reducing and correcting errors and recovering from failed operations. Lastly it describes an analysis of the long distance transmission of the coherent state qubits and shows how transmission errors can be corrected.
Summary form only given. Quantum computers are expected to increase the efficiency of solving problems such as factoring large integers. However an experimental implementation of even relatively simple quantum information processing with a few to a dozen qubits presents an enormous technological challenge. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing due to the ease with which photon interference can be observed. However these early proposals required huge single photon optical nonlinearities. Unfortunately currently available optical nonlinearities are too weak and too noisy to be useful. Recently however we have discovered that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photodetectors. Our methods exploit feed forward from photo-detectors and are robust against errors from photon loss and detector inefficiency. In this tutorial I will outline this scheme, highlighting the technical challenges required to implement it. The tutorial will be relatively self contained with a brief introduction to quantum optics and quantum computation.
The first section of the work investigates light modes as a means of implementing optical qubits and qudits. The modes considered are polarization mode, path mode, transverse spatial mode, frequency mode, temporal bin-mode and temporal mode. Subsequently, mathematical model of linear optical elements like beam splitters (BS) and phase shifters are deduced and their capability of representing any single qubit optical gate is exposed. Finally Knill, Laflamme and Milburn (KLM) method of using linear optical elements to promote nonlinear operations based on nonlinear (nondeterministic) sign-flip gate (NS) is explained, and designs of two qubits conditional sign flip gate (c-z1/16) and CNOT gate, both based on KLM method, are demonstrated. So, universal set of quantum gates based on linear optics is possible.
In the previous chapter we developed some of the basic aspects of quantum information processing with single photons as qubits. Apart from noting the obvious benefit of using light for quantum communication, we identified some difficulties in manipulating quantum information that is encoded in photons. In particular, it is difficult to construct two-qubit gates for photonic qubits. In this chapter we will have to face this difficulty head-on in our discussion of quantum computation with single photons and linear-optical elements. The possibility of a quantum computer based on single photons, linear optics, and photon counting was demonstrated in a landmark paper by Knill, Laflamme, and Milburn in 2001. Their protocol is commonly referred to as the ‘ klm protocol’. In subsequent years, the klm protocol has been dramatically slimmed down in terms of complexity and the necessary resources to create the universal set of quantum gates. For pedagogical reasons we give the streamlined version here, and we briefly describe the original klm protocol in Appendix 2. We will make extensive use of the results in Section 1.4 about mode transformations, and Section 2.3 about cluster-state quantum computing. We start this chapter, however, with a description of linear-optical networks, and how they fail as deterministic quantum computers. In Section 6.2 we discuss the principle of post-selection, and how this can be used to create probabilistic gates with deterministic feed-forward control.
The use of photons as qubits is a promising implementation for quantum computation. The inability of photons to interact, especially with the environment, makes them an ideal physical candidate. However, this also makes them a difficult system to perform two qubit gates on. Recent breakthroughs in photonic quantum computing have shown methods around the requirement of direct photon-photon interaction. In this thesis we study three recently discovered schemes for optical quantum computation. \n \n We first investigate the so called linear optical quantum computing (LOQC) scheme, exploring a method to improve the original proposal by constructing a photon-number QND detector that succeeds with a high probability. In doing this we present a new type of LOQC teleporter, one that can detect the presence of a single photon in an arbitrary polarisation state when the input state is a sum of vacuum and multi-photon terms. This new type of teleporter is an improvement on the original scheme in that the entangled states required can be made offline with fewer entangling operations. \n \n We next investigate the so called quantum bus (qubus) scheme for photonic quantum computing. We show a scheme to measure the party of n qubit states by using a single qubus mode, controlled rotations and displacements. This allows for the syndrome measurements of any stabilizer quantum error correcting code. We extend these results to a fault tolerant scheme to measure an arbitrary Pauli operator of weight n, incorporating so called single bit teleportations. We investigate the construction of a Toffoli gate by using a single qubus mode, controlled rotations and displacements that works with a success probability of at least 25%. We also investigate the use of single bit teleportations to construct a universal set of gates on coherent state type logic and in the construction of cluster states. \n \nWe finally investigate the optical Zeno gate, a gate that uses the Zeno effect in the form of two photon absorbers to induce a CSIGN. We model realistic two photon absorption and include realistic single photon loss for this gate, examining the use of encoding to overcome the single photon loss, showing that our results are competitive with the leading equivalent LOQC scheme.
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.
Optical quantum computation was limited to a few photon applications such as quantum cryptography and partial teleportation until 2001. Then the possibility of performing arbitrary logic conditional on certain detection outcomes was introduced by Knill, Laflamme and Milburn ( Nature 2001 409 46). Simple circuits consisting of single photon sources, entangled pair sources, linear optical elements and high efficiency photon counting detectors can be used to develop probabilistic two-photon logic gates. Initially such gates show a low probability of success but can approach the success rate of deterministic (non-linear) logic at the cost of added complexity. These developments have led to the emergence of a novel field of research aimed at improving the efficiency of linear logic and developing the efficient sources and detectors for its implementation. This topical issue of Journal of Optics B: Quantum and Semiclassical Optics is devoted to recent advances in this field. Key to all linear optics gates is the interference effect between separate photons that have no previous history. In this issue we include the first experiment to show such an effect (Rarity et al ), on which many later experiments are based. These interference effects can then be used to entangle separate pairs of particles into higher order entangled states (Zou et al 2005 J. Opt. B: Quantum Semiclass. Opt. 7 119–121) and also to establish entanglement between matter qubits (Kok et al ). Quantum dot single photon sources suitable for linear optics quantum logic are discussed in the paper by Unitt et al while a waveguide source of pair photons is presented by Ducci et al . The difficulties in scaling linear optics quantum computing arise from the low success probabilities of the gates. Introducing a small amount of non-linearity could allow unit efficiency gates to be designed (Munro et al ) while large non-linearities generated by the collective effects in EIT could be used to implement a wide variety of quantum logic functions (Petrosyan). The development of algorithms suitable for optical implementation is addressed by Ellinas et al . Key contributors to this issue are collaborating in the project IST:38864 RAMBOQ which has a primary goal of developing linear optics computation tools and techniques.