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

Wiley eBooks

Probabilistic Quantum Computation and Linear Optical Realizations

Norbert Lütkenhaus

Published Apr 18, 2016• 0 citations
Publisher

Abstract

Quantum computation is usually thought of as a sequence of quantum gates. This sequence of gates decomposes the desired total unitary operation of the computation. It is followed by a measurement that extracts the result of the computation. This chapter introduces a concept of computation that allows one to incorporate probabilistic elements into a computation, which in the end becomes deterministic again. It also shows that computation can be performed not only in the paradigm of quantum gates but also by preparing entangled auxiliary states, measurements, and single-qubit operations. It turns out that the Bell measurements required in the Gottesman-Chuang trick cannot be implemented perfectly with linear optics. Moreover, the generation of entangled auxiliary states is hard to achieve in general. Knill, Laflamme, and Milburn solved this problem in several steps. The chapter describes each steps of the Knill-Laflamme-Milburn (KLM) scheme.

DOI
10.1002/9783527805785.ch20

Related papers

Probabilistic Quantum Computation and Linear Optical Realizations

Norbert Lütkenhaus

This chapter contains sections titled: Introduction Gottesman/ChuangTrick Optical Background Knill—Laflamme—Milburn (KLM) scheme

Wiley eBooks•Nov 6, 2006•2 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

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•139 citations

Experimental Implementation of Efficient Linear Optics Quantum Computation

Gerard J Milburn, Timothy C. Ralph, Andrew G. White

One of the earliest proposals for implementing quantum computation was based on encoding each qubit in two optical modes, each containing exactly one photon. However, it is extremely difficult to unitarily couple two optical modes containing few photons. In 2001, Knill, Laflamme, and Milburn (KLM) found a way to circumvent this restriction and implement efficient quantum computation using only passive linear optics, photodetectors, and single photon sources. This efficient linear optical quantum computing (LOQC) is distinct from other linear optical schemes that are not efficiently scalable. The technological requirements for even the simplest gates in the KLM proposal initially seemed out of reach. However, Ralph, White, Munro and Milburn soon showed that, in principle, demonstrations of key gates and techniques could be achieved with current technology. The objective of the research undertaken in this project was to produce, in three years, a prototype two-qubit gate for photons using the KLM linear optics quantum computation approach, and to develop a blue-print for a multiple qubit device that might be implemented over a longer time scale. A non-deterministic two-qubit gate was demonstrated that operates with high fidelity. A number of key tasks were demonstrated using this gate, and several theoretical investigations of short, medium, and longer term issues for the LOQC approach were successfully completed.

•Nov 25, 2004•0 citations

Knill-Laflamme-Milburn Linear Optics Quantum Computation as a Measurement-Based Computation

Sandu Popescu

We show that the Knill Lafllame Milburn method of quantum computation with linear optics gates can be interpreted as a one-way, measurement-based quantum computation of the type introduced by Briegel and Raussendorf. We also show that the permanent state of n n-dimensional systems is a universal state for quantum computation.

arXiv:quant-ph/0610025•Physical Review Letters•Dec 17, 2007•20 citations

Quantum computation

This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.

WORLD SCIENTIFIC eBooks•Dec 1, 2018•0 citations
Quantum computation is usually thought of as a sequence of quantum gates. This sequence of gates decomposes the desired total unitary operation of the computation. It is followed by a measurement that extracts the result of the computation. This chapter introduces a concept of computation that allows one to incorporate probabilistic elements into a computation, which in the end becomes deterministic again. It also shows that computation can be performed not only in the paradigm of quantum gates but also by preparing entangled auxiliary states, measurements, and single-qubit operations. It turns out that the Bell measurements required in the Gottesman-Chuang trick cannot be implemented perfectly with linear optics. Moreover, the generation of entangled auxiliary states is hard to achieve in general. Knill, Laflamme, and Milburn solved this problem in several steps. The chapter describes each steps of the Knill-Laflamme-Milburn (KLM) scheme.
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.
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.
One of the earliest proposals for implementing quantum computation was based on encoding each qubit in two optical modes, each containing exactly one photon. However, it is extremely difficult to unitarily couple two optical modes containing few photons. In 2001, Knill, Laflamme, and Milburn (KLM) found a way to circumvent this restriction and implement efficient quantum computation using only passive linear optics, photodetectors, and single photon sources. This efficient linear optical quantum computing (LOQC) is distinct from other linear optical schemes that are not efficiently scalable. The technological requirements for even the simplest gates in the KLM proposal initially seemed out of reach. However, Ralph, White, Munro and Milburn soon showed that, in principle, demonstrations of key gates and techniques could be achieved with current technology. The objective of the research undertaken in this project was to produce, in three years, a prototype two-qubit gate for photons using the KLM linear optics quantum computation approach, and to develop a blue-print for a multiple qubit device that might be implemented over a longer time scale. A non-deterministic two-qubit gate was demonstrated that operates with high fidelity. A number of key tasks were demonstrated using this gate, and several theoretical investigations of short, medium, and longer term issues for the LOQC approach were successfully completed.
This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.