We demonstrate how to implement the KLM scheme for linear optical quantum computing using polarization encoding. The resulting gates have very high fidelity and allow construction of optical cluster states with currently available detectors.
We show that the KLM scheme [Knill, Laflamme, and Milburn, Nature 409, 46 (2001)] can be implemented using polarization encoding, thus reducing the number of path modes required by half. One of the main advantages of this new implementation is that it naturally incorporates a loss detection mechanism that makes the probability of a gate introducing a non-detected error, when non-ideal detectors are considered, dependent only on the detector dark-count rate and independent of its efficiency. Since very low dark-count rate detectors are currently available, a high-fidelity gate (probability of error of order ${10}^{\ensuremath{-}6}$ conditional on the gate being successful) can be implemented using polarization encoding. The detector efficiency determines the overall success probability of the gate but does not affect its fidelity. This can be applied to the efficient construction of optical cluster states with very high fidelity for quantum computing.
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.
Federico M. Spedalieri, Jonathan P. Dowling, and Hwang Lee Abstract We present a detailed description of nondeterministic quantum logic gates: the crucial component of linear optical quantum computing. We use the qubits that are encoded in the polarization degrees of freedom, as opposed to the original dual-rail encoding. Employing the polarization-encoding scheme, we can avoid the undetected errors due to the inefficiency of the photodetectors and, therefore, achieve high gate fidelity, independent of the quantum efficiency of the detectors. Furthermore, we show that such a high-fidelity gate operation can be performed with no need of number-resolving detectors.
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.
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.