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.
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.
Linear optics with photon counting is a prominent candidate for practical quantum computing. The protocol by Knill, Laflamme, and Milburn [2001, Nature (London) 409, 46] explicitly demonstrates that efficient scalable quantum computing with single photons, linear optical elements, and projective measurements is possible. Subsequently, several improvements on this protocol have started to bridge the gap between theoretical scalability and practical implementation. The original theory and its improvements are reviewed, and a few examples of experimental two-qubit gates are given. The use of realistic components, the errors they induce in the computation, and how these errors can be corrected is discussed.
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.
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.