One-Way Quantum Computing Andrew Lopez. A commonly used model in the field of quantum computing is the Quantum

Transcription

1 One-Way Quantum Computing Andrew Lopez A commonly used model in the field of quantum computing is the Quantum Circuit Model. The Circuit Model can be thought of as a quantum version of classical computing, where a computer is characterized by an quantum input state, quantum logic gates which perform operations on the input state, and an output state. Over time other models have been developed and are being researched, such as the Topological Quantum Model, and Adiabatic Quantum Model. The quantum computing model which will be discussed in this paper is called one-way quantum computation. First we will discuss how quantum computations are performed with this one-way model, then we will discuss the advantages the one-way model has over the circuit model, and finally we will finish with the future of one-way quantum computing. One-way quantum computation requires that a certain type of entangled state, called a cluster or graph state, be set up beforehand [1]. Once the cluster or graph state is prepared we can perform a universal quantum computation by performing a series of single-qubit measurements. Due to the fact that the computation is performed by single-qubit measurements, this model is inherently irreversible (one-way). The inherent irreversiblility is in contrast with the reversibility of every gate used in the Circuit Model. Now to take a closer look at the process, let us discuss cluster and graph states. A graph state G is associated with a graph, G, in which every qubit is represented by a vertex and each edge represents the interaction between respective qubits. Since graphs can vary greatly in layout it is sometimes easier 1

2 to generate an entangled state with a corresponding graph in the shape of a square lattice. This type of state is called a cluster state. The type of entangled state you should use depends on your physics system. While cluster states can be generated efficiently they also require many more qubits than a graph state to perform the same computation. Now we will briefly consider a simple example of one-way computation that involves two qubits []. Before we begin let me define a few operations. The operation U k (γ) (where k is x,y, or z) is exp(i γ σ k), the CZ operation is 0 0 Î σ z, and the operation (θ, φ) is defined as U z (φ + π)u x(θ)σ z U x ( θ)u z ( φ π ). Qubit 1 is prepared in an unknown state: ψ = α 0 + β 1, where 0, 1 are eigenvectors of σ z. Qubit is prepared in the known state: + = 1 ( ), where + is an eigenvector of σ x. Now we apply a CZ operation to each qubit: and find that the qubits are in an entangled state: q 1, q = 1 (α β 1 ). Next we perform a measurement on qubit 1 in the basis 1 ( 0 ± exp(i φ) 1 ) thereby destroying qubit 1; this measurement corresponds to the measurement ( π, φ). From this measurement there are only two possible outcomes (an eigenvalue of ±1). If we define a binary digit m 0, 1 to represent the measurement outcome ( 1) m, then the final state of qubit can be written, up to a phase, as σ m x HU z (φ) ψ. So we can see that the unknown state on qubit 1 has been passed to qubit without any loss of coherence. However, if the measurement on qubit 1 returns the -1 eigenvalue, then qubit will undergo an additional Pauli transformation. This example shows that any desired unitary transformation can be implemented only up to random but known Pauli transformations. These unwanted Pauli transformations are

3 called by-product operators, as they are a by-product of the randomness of the measurements. Since we are confident that one-way computation is viable for one singlequbit operation let s attempt three consecutive single-qubit operations. If we perform the two-qubit measurement protocol as described above three times for three arbitrary angles φ 1, φ, φ 3, then the net unitary transformation applied to qubit will be U = Hσ m 3 z U z (φ 3 )Hσ m z U z (φ )Hσ m 1 z U z (φ 1 ), where m 1, m, m 3 are the binary digits for measurement 1,, and 3 respectively. By using a few identities we see that U = σ m 3 x σ m z σ m 1 x HU z (( 1) m φ 3 )U x (( 1) m φ )U z (φ 1 ). As we can see, the sign of two rotations depend on two of the measurements which are random. This would cause one to question whether this computation is deterministic. It is not, however by appropriate choice of angles φ 1 = α, φ = ( 1) m 1 β, and φ 3 = ( 1) m γ we can obtain a deteministic unitary transformation. The dependency that some of our angles have on previous measurements occurs for all but one class of operations, called the Clifford group. This dependency introduces a time-ordering to the measurements, in other words, there is a limit on how quickly a computation can be implemented. Also since the byproduct Pauli operators are known, they can be corrected through classical post-processing. Stabilizer formalism is a tool use to characterize graph states and subspaces over mulitple qubits in a compact way. In the stabilizer formalism these states and sub-spaces are described in terms of operators under which they are invariant. A similar technique is used in standard quantum mechanics, for example, describing the atomic states by the quantum numbers. 3

4 The formalism focuses on operators that satisfy two properties: 1) the operators stabilizes the sub-space, and ) the operators are Hermitian members of the Pauli group. The defnition of property 1 is as follows: An operator K stablizes a substapce S when, for all states ψ S, K ψ = ψ. The key principle of the formalism is to identify a set of stabilizing operators that uniquely define the state, or sub-space of interest. The stabilizer formalism really shines when used in conjunction with the Clifford group. Application of the formalism leads to the conclusion that any stabilizer state can be transformed to a graph state by local Clifford operations. These graph states are, in general, not unique. Therefore given any one-way pattern containing Pauli measurements, Clifford operations can be used to find a one-way pattern which performs the operation with fewer qubits []. Many recent developments have been made in the field of one-way quantum computation. In 011, Ryuji Ukai and his collaborators demonstrated the use of a Controlled Phase (CZ) gate for continuous-variable one-way quantum computation on a four-mode linear cluster state [3]. The fourmode linear cluster state can be interpreted as two Einstein-Podolsky-Rosen (EPR) paires with a CZ interaction between them. Since the CZ gate is the gate that entangles the EPR pairs it is vital to prove that it s implementation is nonclassical. To that end a sufficient condition for entanglement of a twomode state is given as (gˆp µ ˆx v ) + (gˆp v ˆx µ ) < g for some g R. For the experimental setup used by Ukai, it was determined that g = 3/4 gives the minimal resource requirement. As shown in Fig. 1 the condition for entanglement was met. Ukai concludes by saying that the quality of the CZ gate is only limited by the squeezing level of the resource state, and 4

5 Figure 1: Fig. 1: Lines (viii) show the sufficient condition for entanglement. Traces (vii) show the measurement results. mentions that once a single-mode non-gaussian gate can be experimentally implemented then full universality of arbitrary multi-mode quantum optical states will be realizable. In 013, B. A. Bell and his collaborators characterized the quantum H gate, T gate, and CNOT gate for one-way quantum computation [4]. These three gates form a universal set of gates and therefore allow Bell to simulate and predict the performance of any one-way quantum quantum computation. Bell used two photonic crystal fibre sources to produce pairs of Bell states, and then fused the pairs with a polarising beamsplitter to generate an entangled four-photon star cluster state. At first glance, the star cluster state seems to put us at a disadvantage. Since the cluster state is made with photons of two different wavelengths the standard methods for generating a larger resource state for universal quantum computation cannot be used. However, by performing what is known as a fusion operation, star cluster states can be combined until a resource state of desired size is generated. This resource state will be in a hexagonal lattice which can be converted to a square D lattice by using local operations, thereby confirming the resource 5

6 state as universal. The converion of the hexagonal resource state to a square D lattice is not always necessary as, for one-way quantum computation, the hexagonal lattice has an intrinsic robustness to noise. The state was characterized and compared to the ideal cluster state ψ star by carrying out state tomography. State tomography is the process of analysing the state in all combinations of three measurement bases for each photon: H, V, +,, and R, L where R, L are the right and left circular polarizations. After performing all of the measurements, Bell and his group were able to reconstruct the density matrix, ρ exp. They also calculated the fidelity of the state, F = ψ star ρ exp ψ star = 0.66 ± 0.01 which is well above the threshold value of 0.5, proving that the state has genuine four-party entanglement. Keeping in mind that the fault-tolerant threshold is , Bell calculated the error-probability per gate, ɛ for the H gate (ɛ > 0.33 ± 0.03), the T gate (ɛ > 0.4 ± 0.04), and the CNOT gate (ɛ > 0.36 ± 0.01). We can see there is much room for improvement. These results were then used to simulate a SWAP gate by linking three CNOT gates together. The error-probability per gate was calculated to be ɛ > 0.70±0.01. It is obvious that by simulating an operation with only three concatenated gates, the quality of the operation is greatly reduced. The limitations of the experiment are largely due to the multiphoton count rates and interference visibilities of the photonic crystal fibre sources. Once the sources improve, specifically the collection efficiency of the photons and their indistinguishability, then it will become possible to investigate experimentally larger cluster states and more complicated one-way protocols and algorithms. One-way quantum computation unique way to look at computation. While 6

7 the circuit model draws inspiration from classical computation, the one-way model cleverly uses its quantum nature to solve old problems in new ways. The one-way model has many advantages over the circuit model such as the one-way structure being more flexible than the circuit model due to the necessary adaptive measurements. At the same time, however, it has just as many disadvantages, for example the adaptive measurements introducing a time-ordering to the system, limiting how quickly a computation can be performed. Recent experiments show that at our current level of technology building a one-way quantum computer to efficiently perform computations is far off, but in time we may see one-way quantum computers used in scientific institutions worldwide. References: [1] Quantum Computation and Quantum Information, by Michael A. Nielsen and Isaac L. Chuang, Cambridge University Press. [] One-way Quantum Computation. Dan Browne and Hans Briegel. arxiv:quantph/0603v 3 Oct 006 [3] Demonstration of a Controlled-Phase Gate for Continuous-Variable One- Way Quantum Computation. Ryuji Ukai, Shota Yokoyama, et al. arxiv: v1 [quant-ph] 4 Jul 011 [4] Experimental characterization of universal one-way quantum computing. B.A. Bell, M.S. Tame, et al. arxiv: v1 [quant-ph] 1 May 013 7