KLM protocol

Last updated

The KLM scheme or KLM protocol is an implementation of linear optical quantum computing (LOQC) developed in 2000 by Emanuel Knill, Raymond Laflamme and Gerard J. Milburn. This protocol allows for the creation of universal quantum computers using solely linear optical tools. [1] The KLM protocol uses linear optical elements, single-photon sources and photon detectors as resources to construct a quantum computation scheme involving only ancilla resources, quantum teleportations and error corrections.

Contents

Overview

The KLM scheme induces an effective interaction between photons by making projective measurements with photodetectors, which falls into the category of non-deterministic quantum computation. It is based on a non-linear sign shift between two qubits that uses two ancilla photons and post-selection. [2] It is also based on the demonstrations that the probability of success of the quantum gates can be made close to one by using entangled states prepared non-deterministically and quantum teleportation with single-qubit operations. [3] [4] Without a high enough success rate of a single quantum gate unit, it may require an exponential amount of computing resources. The KLM scheme is based on the fact that proper quantum coding can reduce the resources for obtaining accurately encoded qubits efficiently with respect to the accuracy achieved, and can make LOQC fault-tolerant for photon loss, detector inefficiency and phase decoherence. LOQC can be robustly implemented through the KLM scheme with a low enough resource requirement to suggest practical scalability, making it as promising a technology for quantum information processing as other known implementations.

Elements of LOQC in the KLM scheme

Qubits and modes

To avoid losing generality, the discussion below does not limit itself to a particular instance of mode representation. A state written as means a state with zero photons in mode (could be the "vertical" polarization channel) and one photon in the mode (could be the "horizontal" polarization channel).

In the KLM protocol, each of the photons is usually in one of two modes, and the modes are different between the photons (the possibility that a mode is occupied by more than one photon is zero). This is not the case only during implementations of controlled quantum gates such as CNOT. When the state of the system is as described, the photons can be distinguished, since they are in different modes, and therefore a qubit state can be represented using a single photon in two modes, vertical (V) and horizontal (H): for example, and . It is common to refer to the states defined via occupation of modes as Fock states.

Such notations are useful in quantum computing, quantum communication and quantum cryptography. For example, it is very easy to consider a loss of a single photon using these notations, simply by adding the vacuum state containing zero photons in those two modes. As another example, when having two photons in two separated modes (e.g. two time bins or two arms of an interferometer), it is easy to describe an entangled state of the two photons. The singlet state (two linked photons with overall spin quantum number ) can be described as follows: if and describe the basis states of the two separated modes, then the singlet state is

State measurement/readout

In the KLM protocol, a quantum state can be read out or measured using photon detectors along selected modes. If a photodetector detects a photon signal in a given mode, it means the corresponding mode state is a 1-photon state before measuring. As discussed in KLM's proposal, [1] photon loss and detection efficiency dramatically influence the reliability of the measurement results. The corresponding failure issue and error correction methods will be described later.

A left-pointed triangle will be used in circuit diagrams to represent the state readout operator in this article. [1]

Implementations of elementary quantum gates

Ignoring error correction and other issues, the basic principle in implementations of elementary quantum gates using only mirrors, beam splitters and phase shifters is that by using these linear optical elements, one can construct any arbitrary 1-qubit unitary operation; in other words, those linear optical elements support a complete set of operators on any single qubit.

The unitary matrix associated with a beam splitter is:

,

where and are determined by the reflection amplitude and the transmission amplitude (relationship will be given later for a simpler case). For a symmetric beam splitter, which has a phase shift under the unitary transformation condition and , one can show that

,

which is a rotation of the single qubit state about the -axis by in the Bloch sphere.

A mirror is a special case where the reflecting rate is 1, so that the corresponding unitary operator is a rotation matrix given by

.

For most cases of beam splitters used in QIP, the incident angle .

Similarly, a phase shifter operator associates with a unitary operator described by , or, if written in a 2-mode format

,

which is equivalent to a rotation of about the -axis.

Since any two rotations along orthogonal rotating axes can generate arbitrary rotations in the Bloch sphere, one can use a set of symmetric beam splitters and mirrors to realize an arbitrary operators for QIP. The figures below are examples of implementing a Hadamard gate and a Pauli-X-gate (NOT gate) by using beam splitters (illustrated as rectangles connecting two sets of crossing lines with parameters and ) and mirrors (illustrated as rectangles connecting two sets of crossing lines with parameter ).

Implementation of a Hadamard gate with a beam splitter and a mirror. Quantum circuit is on the top part. Hadamar Linar optics Circuit.jpg
Implementation of a Hadamard gate with a beam splitter and a mirror. Quantum circuit is on the top part.
Implementation of a Pauli-X gate (NOT gate) with a beam splitter. Quantum circuit is on the top part. X circuit in LOQC.gif
Implementation of a Pauli-X gate (NOT gate) with a beam splitter. Quantum circuit is on the top part.

In the above figures, a qubit is encoded using two mode channels (horizontal lines): represents a photon in the top mode, and represents a photon in the bottom mode.

In the KLM scheme, qubit manipulations are realized via a series of non-deterministic operations with increasing probability of success. The first improvement to this implementation that will be discussed is the nondeterministic conditional sign flip gate.

Implementation of nondeterministic conditional sign flip gate

An important element of the KLM scheme is the conditional sign flip or nonlinear sign flip gate (NS-gate) as shown in the figure below on the right. It gives a nonlinear phase shift on one mode conditioned on two ancilla modes.

Linear optics implementation of NS-gate. The elements framed in the box with dashed border is the linear optics implementation with three beam splitters and one phase shifter (see text for parameters). Modes 2 and 3 are ancilla modes. NSGate.JPG
Linear optics implementation of NS-gate. The elements framed in the box with dashed border is the linear optics implementation with three beam splitters and one phase shifter (see text for parameters). Modes 2 and 3 are ancilla modes.

In the picture on the right, the labels on the left of the bottom box indicate the modes. The output is accepted only if there is one photon in mode 2 and zero photons in mode 3 detected, where the ancilla modes 2 and 3 are prepared as the state. The subscript is the phase shift of the output, and is determined by the parameters of inner optical elements chosen. [1] For case, the following parameters are used: , , , , , , and . For the case, the parameters can be chosen as , , , , , , and . Similarly, by changing the parameters of beam splitters and phase shifters, or by combining multiple NS gates, one can create various quantum gates. By sharing two ancilla modes, Knill invented the following controlled-Z gate (see the figure on the right) with success rate of 2/27. [5]

Linear optics implementation of Controlled-Z Gate with ancilla modes labelled as 2 and 3.
th
=
54.74
[?]
{\displaystyle \theta =54.74^{\circ }}
and
th
'
=
17.63
[?]
{\displaystyle \theta '=17.63^{\circ }}
. NSCZGate.JPG
Linear optics implementation of Controlled-Z Gate with ancilla modes labelled as 2 and 3. and .

The advantage of using NS gates is that the output can be guaranteed conditionally processed with some success rate which can be improved to nearly 1. Using the configuration as shown in the figure above on the right, the success rate of an NS gate is . To further improve successful rate and solve the scalability problem, one needs to use gate teleportation, described next.

Gates teleportation and near-deterministic gates

Given the use of non-deterministic quantum gates for KLM, there may be only a very small probability that a circuit with gates with a single-gate success possibility of will work perfectly by running the circuit once. Therefore, the operations must on average be repeated on the order of times or such systems must be run in parallel. Either way, the required time or circuit resources scale exponentially.[ citation needed ] In 1999, Gottesman and Chuang pointed out that one can prepare the probabilistic gates offline from the quantum circuit by using quantum teleportation. [4] The basic idea is that each probabilistic gate is prepared offline, and the successful event signal is teleported back to the quantum circuit. An illustration of quantum teleportation is given in the figure on the right. As can be seen, the quantum state in mode 1 is teleported to mode 3 through a Bell measurement and an entangled resource Bell state , where the state 1 may be regarded as prepared offline.

The resource Bell state can be generated from the state by use of a mirror with parameter

Quantum circuit representation of quantum teleportation. Quantum teleportation circuit.svg
Quantum circuit representation of quantum teleportation.

By using teleportation, many probabilistic gates may be prepared in parallel with -photon entangled states, sending a control signal to the output mode. Through using probabilistic gates in parallel offline, a success rate of can be obtained, which is close to 1 as becomes large. The number of gates needed to realize a certain accuracy scales polynomially rather than exponentially. In this sense, the KLM protocol is resource-efficient. One experiment using the KLM originally proposed controlled-NOT gate with four-photon input was demonstrated in 2011, [6] and gave an average fidelity of .

Error detection and correction

As discussed above, the success probability of teleportation gates can be made arbitrarily close to 1 by preparing larger entangled states. However, the asymptotic approach to the probability of 1 is quite slow with respect to the photon number . A more efficient approach is to encode against gate failure (error) based on the well-defined failure mode of the teleporters. In the KLM protocol, the teleporter's failure can be diagnosed if zero or photons are detected. If the computing device can be encoded against accidental measurements of some certain number of photons, then it will be possible to correct gate failures and the probability of eventually successfully applying the gate will increase.

Many experimental trials using this idea have been carried out (see, for example, Refs [7] [8] [9] ). However, a large number of operations are still needed to achieve a success probability very close to 1. In order to promote the KLM protocol as a viable technology, more efficient quantum gates are needed. This is the subject of the next part.

Improvements

This section discusses the improvements of the KLM protocol that have been studied after the initial proposal.

There are many ways to improve the KLM protocol for LOQC and to make LOQC more promising. Below are some proposals from the review article Ref. [10] and other subsequent articles:

There are several protocols for using cluster states to improve the KLM protocol, the computation model with those protocols is an LOQC implementation of the one-way quantum computer:

See also

Related Research Articles

In physics, the no-cloning theorem states that it is impossible to create an independent and identical copy of an arbitrary unknown quantum state, a statement which has profound implications in the field of quantum computing among others. The theorem is an evolution of the 1970 no-go theorem authored by James Park, in which he demonstrates that a non-disturbing measurement scheme which is both simple and perfect cannot exist. The aforementioned theorems do not preclude the state of one system becoming entangled with the state of another as cloning specifically refers to the creation of a separable state with identical factors. For example, one might use the controlled NOT gate and the Walsh–Hadamard gate to entangle two qubits without violating the no-cloning theorem as no well-defined state may be defined in terms of a subsystem of an entangled state. The no-cloning theorem concerns only pure states whereas the generalized statement regarding mixed states is known as the no-broadcast theorem.

<span class="mw-page-title-main">Quantum teleportation</span> Physical phenomenon

Quantum teleportation is a technique for transferring quantum information from a sender at one location to a receiver some distance away. While teleportation is commonly portrayed in science fiction as a means to transfer physical objects from one location to the next, quantum teleportation only transfers quantum information. The sender does not have to know the particular quantum state being transferred. Moreover, the location of the recipient can be unknown, but to complete the quantum teleportation, classical information needs to be sent from sender to receiver. Because classical information needs to be sent, quantum teleportation cannot occur faster than the speed of light.

<span class="mw-page-title-main">Qubit</span> Basic unit of quantum information

In quantum computing, a qubit or quantum bit is a basic unit of quantum information—the quantum version of the classic binary bit physically realized with a two-state device. A qubit is a two-state quantum-mechanical system, one of the simplest quantum systems displaying the peculiarity of quantum mechanics. Examples include the spin of the electron in which the two levels can be taken as spin up and spin down; or the polarization of a single photon in which the two spin states can also be measured as horizontal and vertical linear polarization. In a classical system, a bit would have to be in one state or the other. However, quantum mechanics allows the qubit to be in a coherent superposition of multiple states simultaneously, a property that is fundamental to quantum mechanics and quantum computing.

<span class="mw-page-title-main">Beam splitter</span> Optical device which splits a beam of light in two

A beam splitter or beamsplitter is an optical device that splits a beam of light into a transmitted and a reflected beam. It is a crucial part of many optical experimental and measurement systems, such as interferometers, also finding widespread application in fibre optic telecommunications.

<span class="mw-page-title-main">Quantum circuit</span> Model of quantum computing

In quantum information theory, a quantum circuit is a model for quantum computation, similar to classical circuits, in which a computation is a sequence of quantum gates, measurements, initializations of qubits to known values, and possibly other actions. The minimum set of actions that a circuit needs to be able to perform on the qubits to enable quantum computation is known as DiVincenzo's criteria.

In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate is a basic quantum circuit operating on a small number of qubits. Quantum logic gates are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits.

In quantum information science, the Bell's states or EPR pairs are specific quantum states of two qubits that represent the simplest examples of quantum entanglement. The Bell's states are a form of entangled and normalized basis vectors. This normalization implies that the overall probability of the particle being in one of the mentioned states is 1: . Entanglement is a basis-independent result of superposition. Due to this superposition, measurement of the qubit will "collapse" it into one of its basis states with a given probability. Because of the entanglement, measurement of one qubit will "collapse" the other qubit to a state whose measurement will yield one of two possible values, where the value depends on which Bell's state the two qubits are in initially. Bell's states can be generalized to certain quantum states of multi-qubit systems, such as the GHZ state for three or more subsystems.

In quantum information theory, a quantum channel is a communication channel which can transmit quantum information, as well as classical information. An example of quantum information is the state of a qubit. An example of classical information is a text document transmitted over the Internet.

<span class="mw-page-title-main">Superdense coding</span> Two-bit quantum communication protocol

In quantum information theory, superdense coding is a quantum communication protocol to communicate a number of classical bits of information by only transmitting a smaller number of qubits, under the assumption of sender and receiver pre-sharing an entangled resource. In its simplest form, the protocol involves two parties, often referred to as Alice and Bob in this context, which share a pair of maximally entangled qubits, and allows Alice to transmit two bits to Bob by sending only one qubit. This protocol was first proposed by Charles H. Bennett and Stephen Wiesner in 1970 and experimentally actualized in 1996 by Klaus Mattle, Harald Weinfurter, Paul G. Kwiat and Anton Zeilinger using entangled photon pairs. Superdense coding can be thought of as the opposite of quantum teleportation, in which one transfers one qubit from Alice to Bob by communicating two classical bits, as long as Alice and Bob have a pre-shared Bell pair.

<span class="mw-page-title-main">Controlled NOT gate</span> Quantum logic gate

In computer science, the controlled NOT gate, controlled-X gate, controlled-bit-flip gate, Feynman gate or controlled Pauli-X is a quantum logic gate that is an essential component in the construction of a gate-based quantum computer. It can be used to entangle and disentangle Bell states. Any quantum circuit can be simulated to an arbitrary degree of accuracy using a combination of CNOT gates and single qubit rotations. The gate is sometimes named after Richard Feynman who developed an early notation for quantum gate diagrams in 1986.

<span class="mw-page-title-main">One-way quantum computer</span> Method of quantum computing

The one-way or measurement-based quantum computer (MBQC) is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it. It is "one-way" because the resource state is destroyed by the measurements.

In quantum information and quantum computing, a cluster state is a type of highly entangled state of multiple qubits. Cluster states are generated in lattices of qubits with Ising type interactions. A cluster C is a connected subset of a d-dimensional lattice, and a cluster state is a pure state of the qubits located on C. They are different from other types of entangled states such as GHZ states or W states in that it is more difficult to eliminate quantum entanglement in the case of cluster states. Another way of thinking of cluster states is as a particular instance of graph states, where the underlying graph is a connected subset of a d-dimensional lattice. Cluster states are especially useful in the context of the one-way quantum computer. For a comprehensible introduction to the topic see.

Entanglement distillation is the transformation of N copies of an arbitrary entangled state into some number of approximately pure Bell pairs, using only local operations and classical communication.

In quantum computing, the quantum phase estimation algorithm is a quantum algorithm to estimate the phase corresponding to an eigenvalue of a given unitary operator. Because the eigenvalues of a unitary operator always have unit modulus, they are characterized by their phase, and therefore the algorithm can be equivalently described as retrieving either the phase or the eigenvalue itself. The algorithm was initially introduced by Alexei Kitaev in 1995.

Linear optics is a sub-field of optics, consisting of linear systems, and is the opposite of nonlinear optics. Linear optics includes most applications of lenses, mirrors, waveplates, diffraction gratings, and many other common optical components and systems.

In quantum mechanics, the cat state, named after Schrödinger's cat, is a quantum state composed of two diametrically opposed conditions at the same time, such as the possibilities that a cat is alive and dead at the same time.

Linear optical quantum computing or linear optics quantum computation (LOQC), also photonic quantum computing (PQC), is a paradigm of quantum computation, allowing (under certain conditions, described below) universal quantum computation. LOQC uses photons as information carriers, mainly uses linear optical elements, or optical instruments (including reciprocal mirrors and waveplates) to process quantum information, and uses photon detectors and quantum memories to detect and store quantum information.

Optical cluster states are a proposed tool to achieve quantum computational universality in linear optical quantum computing (LOQC). As direct entangling operations with photons often require nonlinear effects, probabilistic generation of entangled resource states has been proposed as an alternative path to the direct approach.

<span class="mw-page-title-main">Swap test</span> Technique for comparing quantum states

The swap test is a procedure in quantum computation that is used to check how much two quantum states differ, appearing first in the work of Barenco et al. and later rediscovered by Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf. It appears commonly in quantum machine learning, and is a circuit used for proofs-of-concept in implementations of quantum computers.

References

  1. 1 2 3 4 Knill, E.; Laflamme, R.; Milburn, G. J. (2001). "A scheme for efficient quantum computation with linear optics". Nature. 409 (6816). Nature Publishing Group: 46–52. Bibcode:2001Natur.409...46K. doi:10.1038/35051009. PMID   11343107. S2CID   4362012.
  2. Adleman, Leonard M.; DeMarrais, Jonathan; Huang, Ming-Deh A. (1997). "Quantum Computability". SIAM Journal on Computing. 26 (5): 1524–1540. doi:10.1137/S0097539795293639. ISSN   0097-5397.
  3. Bennett, Charles H.; Brassard, Gilles; Crépeau, Claude; Jozsa, Richard; Peres, Asher; Wootters, William K. (1993-03-29). "Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels". Physical Review Letters. 70 (13): 1895–1899. Bibcode:1993PhRvL..70.1895B. doi: 10.1103/PhysRevLett.70.1895 . PMID   10053414.
  4. 1 2 Gottesman, Daniel; Chuang, Isaac L. (1999-11-25). "Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations". Nature. 402 (6760): 390–393. arXiv: quant-ph/9908010 . Bibcode:1999Natur.402..390G. doi:10.1038/46503. ISSN   0028-0836. S2CID   4411647.
  5. Knill, E. (2002-11-14). "Quantum gates using linear optics and postselection". Physical Review A. 66 (5): 052306. arXiv: quant-ph/0110144 . Bibcode:2002PhRvA..66e2306K. doi:10.1103/PhysRevA.66.052306. S2CID   119529530.
  6. Okamoto, Ryo; O’Brien, Jeremy L.; Hofmann, Holger F.; Takeuchi, Shigeki (2011-06-21). "Realization of a Knill-Laflamme-Milburn controlled-NOT photonic quantum circuit combining effective optical nonlinearities". Proceedings of the National Academy of Sciences. 108 (25): 10067–10071. arXiv: 1006.4743 . Bibcode:2011PNAS..10810067O. doi: 10.1073/pnas.1018839108 . ISSN   0027-8424. PMC   3121828 . PMID   21646543.
  7. O’Brien, J. L.; Pryde, G. J.; White, A. G.; Ralph, T. C. (2005-06-09). "High-fidelity Z-measurement error encoding of optical qubits". Physical Review A. 71 (6): 060303. arXiv: quant-ph/0408064 . Bibcode:2005PhRvA..71f0303O. doi:10.1103/PhysRevA.71.060303. S2CID   21661867.
  8. Hayes, A. J. F.; Gilchrist, A.; Myers, C. R.; Ralph, T. C. (2004-12-01). "Utilizing encoding in scalable linear optics quantum computing". Journal of Optics B: Quantum and Semiclassical Optics. 6 (12). IOP Publishing: 533–541. arXiv: quant-ph/0408098 . Bibcode:2004JOptB...6..533H. doi:10.1088/1464-4266/6/12/008. ISSN   1464-4266. S2CID   119465216.
  9. Pittman, T. B.; Jacobs, B. C.; Franson, J. D. (2005-05-31). "Demonstration of quantum error correction using linear optics". Physical Review A. 71 (5): 052332. arXiv: quant-ph/0502042 . Bibcode:2005PhRvA..71e2332P. doi:10.1103/PhysRevA.71.052332. S2CID   11679660.
  10. Kok, P.; Munro, W. J.; Nemoto, K.; Ralph, T. C.; Dowling, J. P.; Milburn, G. J. (2007). "Linear optical quantum computing with photonic qubits". Rev. Mod. Phys. 79 (1). American Physical Society: 135–174. arXiv: quant-ph/0512071 . Bibcode:2007RvMP...79..135K. doi:10.1103/RevModPhys.79.135. S2CID   119335959.
  11. Sheng, Y.-B.; Long, G. L.; Deng, F.-G. (2012). "One-step deterministic multipartite entanglement purification with linear optics". Physics Letters A. 2012 (376): 314–319. Bibcode:2012PhLA..376..314S. doi:10.1016/j.physleta.2011.09.056. Archived from the original on 2021-01-29. Retrieved 2023-08-13.