Bell Transform and Teleportation-Based Quantum Computation

Yong Zhang1, and Kun Zhang1,

1

School of Physics and Technology, Wuhan University, P.R.China 430072 (Dated: January 29, 2014)

arXiv:1401.7009v1 [quant-ph] 27 Jan 2014

We propose the concepts of both the Bell transform and the teleportation operator in view of the standard description of quantum teleportation, and then with them reformulate the fault-tolerant construction of singlequbit gates and two-qubit gates in teleportation-based quantum computation. The teleportation operator is a tensor product of the identity operator, the Bell transform and its inverse. Typical examples of the Bell transform can be recognized as parity-preserving gates, matchgates, magic gates, and the YangBaxter gates in the literature, all of which are Clifford gates and maximally entangling gates, so teleportation-based quantum computation can be reviewed as an extension of quantum Clifford gate computation or quantum matchgate computation or integrable quantum computation using the YangBaxter gates.
PACS numbers: 03.67.Lx, 03.65.Ud, 02.10.Kn Keywords: Teleportation, Bell states, Matchgate, Clifford gate

I.

INTRODUCTION

Quantum information and quantum computation [1, 2] is a newly developed research eld in which information processing and computational tasks are accomplished by exploiting fundamental principles of quantum mechanics. Quantum teleportation [36] is a typical information protocol of transmitting an unknown qubit from Alice to Bob with the help of quantum entanglement and quantum measurement. Meanwhile, quantum teleportation is a quantum computation primitive [710] exploited by universal quantum computation called teleportation-based quantum computation, which presents a simple and systematic approach to the construction of fault-tolerant quantum gates [7] in fault-tolerant quantum computation [1, 2, 11]. The conceptual frameworks of both quantum teleportation [36] and teleportation-based quantum computation [710] have been already well set up years ago, and both have become widely used basic concepts in quantum information science [1, 2]. The motivation of this paper is to rene hidden algebraic structures in the standard description of quantum teleportation, which was initiated in [12], and then with them to reformulate the description of teleportation-based quantum computation. These algebraic structures [12] are so simple and surprisingly associated with several other topics in quantum computation [1, 2], so we hope that they are helpful for the further understanding on physics and mathematics underlying quantum teleportation and teleportation-based quantum computation. We propose the concept of the teleportation operator [12] to characterize the quantum circuit of quantum teleportation. This operator is a tensor product in terms of the identity operator, the Bell transform and its inverse. We dene the Bell transform as a unitary basis transformation matrix from the product basis to the Bell basis which consists of four Bell states (EPR pair states) [1, 2]. In this paper, these Bell states

yong zhang@whu.edu.cn zmzmzmggggg@whu.edu.cn

can be permuted with each other or differ by global phase factors respectively, so the Bell basis allows different forms and the Bell transform is capable of including examples in the literature which can be respectively recognized as the YangBaxter gates [13, 14], magic gates proposed by Makhlin [15, 16], matchgates proposed by Valiant [1721], and paritypreserving two-qubit gates [21]. The YangBaxter gates [13, 14] are nontrivial unitary solutions of the YangBaxter equation [22], and quantum computation using the YangBaxter gates is called integrable quantum computation [23], which is not the focus of the present paper, so interested readers are invited to refer to [13, 14, 23] for details. All the examples for the Bell transform in this paper are veried as Clifford gates [1, 11], some of which are also recognized as matchgates. Hence quantum computation using the Bell transform can be viewed as quantum Clifford gate computation associated with the Gottesman-Knill theorem [1, 11] and as quantum matchgate computation associated with the Valiant theorem [17, 18]. Note that quantum matchgate circuits and Clifford circuits can be classically efciently simulatable [24] as well as quantum teleportation can be efciently simulated on a classical computer [1]. Therefore, the teleportation-based quantum computation [710] can be reformulated as an extension of quantum computation using Clifford gates or quantum computation using matchgates or integrable quantum computation [23]. Compared with the previous research in the literature, we have done several things new in the paper. We propose the concept of the Bell transform which was originally called the Bell matrix only for a special solution of the YangBaxter equation [13, 14], so that it now includes two-qubit gates which do not satisfy the YangBaxter equation [22], meanwhile we make a detailed study on typical examples of the Bell transform from the viewpoint of quantum information and computation [1, 2]. We propose the concept of the teleportation operator instead of the braid teleportation in our previous research [12] in order to show non-topological features in the standard description of quantum teleportation. With the teleportation operator, we study the fault-tolerant construction of single-qubit gates and two-qubit gates in teleportationbased quantum computation, which can be regarded as an al-

2 gebraic counterpart of our recent study [10] on a topological diagrammatical approach to teleportation-based quantum computation. The plan of this paper is organized as follows. In Section II, we present the denition of the Bell transform and explain it with four examples, including the CH gate as a tensor product of the CN OT gate and the Hadamard gate, the YangBaxter gate B , and the magic gates Q and R. We verify the B, Q gates as matchgates and the R gate as a parity-preserving nonmatchgate, and verify these four gates as maximally entangling Clifford gates [2527]. In Section III, we introduce the concept of the teleportation operator to characterize the quantum circuit of quantum teleportation, and then with it make a detailed study on the fault-tolerant construction of singlequbit gates and two-qubit gates in teleportation-based quantum computation. In Section IV, we make concluding remarks and present an outlook on the future research. In Appendix A, we study exponential formulations of the Bell transform B, Q, R with associated two-qubit Hamiltonians. the state |i, j . Obviously, |00 and |11 are even-parity states, while |01 and |10 are odd-parity states. The Bell states | (i, j ) are maximally entangled bipartite pure states [10] widely used in quantum information and computation, denoted by | (i, j ) = (1 12 X i Z j )| (0, 0) , (2)

1 with | (0, 0) = (|00 + |11 ) and i, j = 0, 1, which are 2 simultaneous eigenvectors of the parity-bit operator Z Z and the phase-bit operator X X with

Z Z | (i, j ) = (1)i | (i, j ) , X X | (i, j ) = (1)j | (i, j ) ,

(3)

II.

BELL TRANSFORM, MATCHGATE AND CLIFFORD GATE

In this section, we propose the concept of the Bell transform and regard it as a two-qubit gate. In Section II A, we dene the Bell transform and explain it with the CH gate. In Section II B, we present the YangBaxter gate B and the magic gates Q and R as examples for the Bell transform, and recognize the B gate and the Q gate as matchgates and the R gate as a parity-preserving non-matchgate. In Section II C, we calculate the inverses of these four gates CH , B, Q, R and point out that the inverse of the Bell transform is not the Bell transform in general. In Section II D, we verify CH , B, Q, R and their 1 , B 1 , Q1 , R1 as Clifford gates in two equivinverses CH alent approaches. In Section II E, we calculate the entangling 1 , B 1 , Q1 , R1 and verify powers [27] of CH , B, Q, R, CH them as maximally entangling gates.

with the parity-bit i and the phase-bit j . The Bell states | (i, j ) present an orthonormal basis of the two-qubit Hilbert space H2 H2 , which is called the Bell basis or maximally entangling basis [1, 2]. The Bell transform is dened as a unitary basis transformation matrix from the product basis |i, j to the Bell basis eikl | (k, l) with the global phase factor eikl depending on k and l (which are functions of i, j , i.e., k (i, j ) and l(i, j )), so it is a one-by-one mapping between |i, j and eikl | (k, l) given by eikl | (k, l) = Bell |ij (4)

where the notation Bell denotes the Bell transform. Our rst example on the Bell matrix is denoted by the CH matrix dened by | (j, i) = CH |i, j which has the matrix form 1 1 0 = 2 0 1 0 1 1 0 1 0 0 1 0 1 . 1 0 (5)

CH

(6)

A.

The Bell transform

With the Hadamard gate H and the CN OT gate given by A single-qubit Hilbert space [1, 2] is a two-dimensional Hilbert space H2 , and a two-qubit Hilbert space is a four dimensional Hilbert space H2 H2 . The orthonormal basis of H2 is chosen as the eigenvectors |0 and |1 of the Pauli matrix Z with Z |0 = |0 and Z |1 = |1 . The Pauli matrices X and Z with the identity matrix 1 12 have the conventional form X= 0 1 1 0 , Z= 1 0 0 1 , 1 12 = 1 0 0 1 (1) 1 H = (X +Z ), 2 CN OT = |0 0| 1 12 +|1 1| X, (7)

the Bell transform CH can be formulated as CH = CN OT (H 1 12 ) with the diagrammatical quantum circuit [28] given by H CH = (9) (8)

with the Pauli matrix Y = ZX . The product basis of H2 H2 is denoted by |i, j or |ij or |i |j with i, j = 0, 1, which are eigenvectors of the parity-bit operator Z Z with Z Z |i, j = (1)i+j |i, j where the addition i + j is the binary addition modulo 2 and i + j represents the parity-bit of

which has been explicitly exploited in the standard description of quantum teleportation [1, 36] .

3
B. Parity-preserving gate, matchgate and magic gate

With our denition of the Bell transform (4), it allows different forms so that it is capable of including various of examples in the literature. We study the Bell transform which is a matchgate or its extension, a parity-preserving gate, because quantum computation of both matchgates and paritypreserving gates have been well studied in [1721]. The notation on the parity-preserving gates [18, 21] refers to our research on integrable quantum computation [23], and it has the form 1 0 0 7 0 5 3 0 , (10) G(AG , BG ) = 0 4 6 0 8 0 0 2 with two SU (2) matrices AG and BG given by AG = 1 7 8 2 , BG = 5 3 4 6 , (11)

matrix leading to the inverse and transpose of the B matrix 1 given by B T = B 1 = G(A B , AB ) which is also the Bell transform and the matchgate. Quantum computation of the YangBaxter gate B can be therefore viewed as an interesting example for quantum matchgate computation [1721]. The magic gates Q and R respectively exploited by Makhlin [15] and Fujii [16] are the Bell transform, and with them, tensor products of two single-qubit gates, SU (2) SU (2), can be proved to be isomorphic to the special orthogonal group SO(4). The magic gate Q [15] given by | (i + j, i) = ( 1)j Q|ij (15) with the imaginary unit 1 has the matrix form 1 0 0 i 1 0 i 1 0 (16) Q= , 2 0 i 1 0 1 0 0 i and it is the matchgate Q = G(AQ , BQ ) with two single-qubit gates AQ and BQ given by AQ = H S, BQ = i AQ Z (17)

which has very good algebraic properties, G(AG , BG ) = G(AG , BG )G(CG , DG ) = G(AG CG , BG DG )
G(A G , BG ),

(12)

where the Hadamard gate H , the Pauli-Z gate, and the phase gate S given by S= 1 0 0 i (18)

with denotes the Hermitian conjugation. Note that the G(AG , BG ) matrix is called the parity-preserving gate because it commutes with the parity-bit operator Z Z due to Z Z = G(1 12 , 1 12 ). When the determinants of the two SU (2) matrices AG , BG are equal, det(AG ) = det(BG ), the parity-preserving gate is a matchgate [18, 21]. When we call a gate as a paritypreserving gate, we usually mean it is a parity-preserving nonmatchgate. Quantum computation of matchgates can be classically simulated [17], and it plays important roles in the research topic [24] of distinguishing classical computation with quantum computation. A matchgate with single-qubit gates [18] are capable of performing universal quantum computation, while a matchgate with a parity-preserving gate [21] can do too. The Bell transform B is a solution of the YangBaxter equation [22] and has been recently recognized as a two-qubit quantum gate [13, 14]. It has a compact form as a basis unitary transformation from the product basis to the Bell basis, | (i + j, j + 1) = (1)
(i+j )(j +1)

are exploited and obviously S 2 = Z and S = S 3 . Note that the /8 gate or T gate [1] is a square root of the phase gate S , i.e., S = T 2 . The magic gate R [16] given by (19) | (i + j, i) = ( 1)i ( 1)i+j R|ij has the matrix form 1 1 0 R= 2 0 1 0 i i 0 0 1 1 0 i 0 , 0 i

(20)

and it is the parity-preserving gate R = G(AR , BR ) with single-qubit gates AR = i BQ , BR = BQ (21)

B |i, j

(13)

with the multiplication (i + j ) (j + 1) dened as the logical AND operation between i + j and j +1. The associated matrix formulation of the YangBaxter gate B [13, 14] is given by 1 0 0 1 1 0 1 1 0 , (14) B= 0 1 1 0 2 1 0 0 1
1 which is the matchgate B = G(AB , A B ) with the SU (2) Y matrix AB = e 4 . The Bell transform B is a real orthogonal

where obviously det(AR ) = det(BR ) so it is a nonmatchgate and which gives rise to R = Q G(Z, 1 12 ). In Appendix A, we study exponential formulations of the Bell transform B , Q, R with associated Hamiltonians, based on which we can show the essential difference between the mathchgates B, Q and the non-matchgate R.
C. The inverse of the Bell transform

In general, the inverse of the Bell transform (4) is not the Bell transform. For example, the inverse of the Bell transform

4
1 CH (8) denoted by CH has the form

1 CH

1 0 1 0 1 = 2 1 0 0 1

0 1 0 1

1 0 1 0

TABLE I. Transformation properties of elements of the Pauli group under conjugation by the Bell transform Bell = CH , B, Q, R.

(22)

1 1 1 which gives rise to CH |00 = (|00 + |01 ) so CH is not 2 the Bell transform. The inverse of the magic gate Q (16) has the form 1 0 0 1 1 0 i i 0 Q 1 = (23) 0 1 1 0 2 i 0 0 i

Operation Input Output X1 Z1 X2 X2 CH Z1 X1 X2 Z2 Z1 Z2 X1 X1 X2 X1 Z2 B Z1 Y 1 Y2 Z2 X1 X2 X1 Z1 X2 X2 1Y1 Z2 Q Z1 X1 X2 Z2 Y1 Y2 X1 X1 Z2 X2 1Z1 Y2 R Z1 X1 X2 Z2 Y1 Y2

which leads to a local unitary transformation of Bell states when acting on product states, for instance, Q1 |11 = (1 12 S )| (1, 1) . Similarly, the inverse of the magic gate R (20) given by 1 0 0 1 1 0 i i 0 = 2 0 1 1 0 i 0 0 i

TABLE II. Transformation properties of elements of the Pauli group 1 under conjugation by the inverse of the Bell transform Bell = 1 1 1 1 CH , B , Q , R .
Operation Input Output X1 Z1 X2 1 X2 X2 CH Z1 X1 Z2 X1 Z2 X1 X1 X2 X1 Z2 B 1 Z1 Y1 Y2 Z2 X1 X2 X1 1Z1 Y2 X2 1Y2 Q1 Z1 1X1 Y2 Z2 1Y1 X2 X1 1Y2 X2 1Z1 Y2 R 1 Z1 1Y1 X2 Z2 1X1 Y2

R 1

(24)

has R1 |00 = Q1 |11 . So both Q1 and R1 are not the Bell transform, but Q1 is a matchgate and R1 is a paritypreserving non-matchgate. Occasionally, the inverse of the YangBaxter gate B (14) given by 1 1 0 = 2 0 1 0 1 1 0 0 1 1 0 1 0 0 1

B 1

(25)

is the Bell transform and still the YangBaxter gate[13, 14]. Note that in the standard description of quantum teleportation the Bell transform (4) is explained as the creation operator of Bell states acting on product states and the inverse of the Bell transform is associated with Bell measurements, see Section III, so the inverse of the Bell transform can not be the Bell transform from the theoretical point of view.

gates can be efciently simulated on a classical computer in view of the Gottesman-Knill theorem [1, 11]. Clifford gates with the /8 gate [29] is a universal quantum gate set and capable of performing universal quantum computation [1, 2]. The Pauli group P2 on two-qubit is generated by X1 = X1 1 2 , X2 = 1 12 X , Z1 = Z 1 12 , Z2 = 1 12 Z which are transformed under conjugation by the Bell transform B (14) in the way BX1 B = X1 , BX2 B = X1 Z2 , BZ1 B = Y1 Y2 , BZ2 B = X1 X2 ,

D. Clifford gate and Bell transform

(26)

We recognize the Bell transform CH , B , Q and R and their 1 inverses CH , B 1 , Q1 and R1 as Clifford gates [1, 11]. We focus on the YangBaxter gate B (14) in this subsection to explain basic concepts of Clifford gates, and present the results on other Bell transforms in Table I and Table II. The set of all tensor products of Pauli matrices acting on n-qubit with phase factor 1, i is called the Pauli group Pn . Clifford gates are dened in two equivalent approaches. They are unitary quantum gates preserving tensor products of Pauli matrices under conjugation, and they can be represented as tensor products of the Hadamard gate H , the phase gate S and the CN OT gate. Note that quantum computation of Clifford

so the YangBaxter gate B (14) is a Clifford gate preserving the Pauli group under conjugation. See Table I for transformation properties of X1 , X2 , Z1 and Z2 undedr conjugation by the Bell transform Bell = CH , B, Q, R, and see Table II for transformation properties of X1 , X2 , Z1 and Z2 under conjugation by the inverse of the Bell transform 1 1 Bell = CH , B 1 , Q 1 , R 1 . The CN OTij gate is the controlled-NOT gate with qubit i as the control and qubit j as the target. Note that the CZ gate has the form of CZ21 = (H 1 12 )CN OT21 (H 1 12 ) and CZ12 = CZ21 so the CZ gate is a Clifford gate. With the research work [20] by Ramelow et al., the parity-preserving

5 gate G = G(AG , BG ) has been reformulated as G(AG , BG ) = CN OT12 CU21 (AG 1 12 )CN OT12 (27) where the controlled-U gate given by
1 CU21 = 1 12 |0 0| + BG AG |1 1 |

(28)

can be further decomposed as tensor products of CN OT gates and single-qubit gates, see Nilesen and Chuangs description on controlled operations [1]. As an example, the YangBaxter gate B has the form B = CN OT12 CZ21 (Z H 1 12 )CZ21 CN OT12 , or equivalently B = CN OT12 (Z H 1 12 )CN OT21 CZ21 CN OT12 , (30) which has another more simplied form B = CN OT21 (1 12 Z H )CN OT21 , (31) (29)

which is useful enough in our purpose. The non-local parameters (a, b, c) of the Bell transform CH 1 (8) and its inverse CH are the same as those of the CN OT gate which can be calculated to be ( 4 , 0, 0). After some algebra, those of the YangBaxter gate B (14) and its inverse B 1 are found to also be ( 4 , 0, 0). The magic gate Q (16) is locally equivalent to the Bell transform B given by 1 1 0 B = 2 0 1 0 1 1 0 0 1 1 0 1 0 , 0 1

(33)

with Q = B (Z S ) or Q1 = (1 12 S )B (Z 1 12 ) in which B = e 4 Y X has non-local parameters ( 4 , 0, 0). The magic gate R (20) and its inverse R1 can be also reformulated with the Bell transform B , R = ei 4 ei 4 Z Z B (S 1 12 ), 1 i Z Z R = (S 1 12 )B e 4 (1 12 Z )

so the YangBaxter gate B is veried again as a Clifford gate. For the other Bell transform Bell = CH , Q, R, we have the decomposition respectively given by CH = CN OT12 (H 1 12 ), Q = CN OT12 (H S S )CZ21 CN OT12 , R = CN OT12 (H S S )CN OT12 ,

(34)

(32)

which naturally give rise to the decomposition of the inverse 1 1 of the Bell transform Bell = CH , Q 1 , R 1 . As a remark, the proposal of the concept of the Bell transform (4) or its inverse in this paper is mainly based on the reformulation of the standard description of quantum teleportation (see Section III). Since quantum teleportation is a well-known example for quantum Clifford gate computation [1, 11], the Bell transform Bell = CH , B, Q, R and their in1 1 verses Bell = CH , B 1 , Q1 , R1 can be assumed as Clifford gates in principle.
E. Entangling power of the Bell transform

which leads to non-local parameters of R and R1 as ( 4 , 0, 4 ). Hence the entangling powers of the Bell transform CH , B, Q, R and their inverses can be calculated exactly as 1, so they are maximally entangling gates.

III. TELEPORTATION OPERATOR AND TELEPORTATION-BASED QUANTUM COMPUTATION

The product states are separable states and the Bell states are maximally entangled states [1, 2], so it is reasonable to require the Bell transform and its inverse as a maximally entangling two-qubit gate in any entanglement measurement theory [25, 26]. We calculate the entangling powers [27] of both the Bell transform CH , B, Q, R and their inverses to support this statement. With the magic gates Q or R [15, 16], two-qubit entangling gates in the special unitary group SU (4) can be characterized by the homogenous space SU (4)/SO(4) SO(4), namely, two-qubit entangling gates are locally equivalent when they are associated with single-qubit transformations. So any twoqubit gate U [30] can be characterized by three non-local parameters (a, b, c) which give rise to a locally equivalent twoqubit gate ei(aX X +bY Y +cZ Z ) . The entangling power ep (U ) [21] of the two-qubit gate U has the form ep (U ) = 1 cos2 2a cos2 2b cos2 2c sin2 2a sin2 2b sin2 2c

In this section, we propose the concept of the teleportation operator and then with it reformulate the standard description of both quantum teleportation and teleportation-based quantum computation. In Section III A, we make a brief sketch on quantum teleportation using the Bell transform CH . In Section III B, we dene the teleportation operator and apply it to the algebraic description of quantum circuit (see FIG. 1) of quantum teleportation. In Section III C, we make a detailed study on the fault-tolerant construction of single-qubit gates and two-qubit gates in teleportation-based quantum computation. FIG. 2 denotes the quantum circuit for a single-qubit gate construction, and FIG. 3 denotes the quantum circuit for a two-qubit gate construction.

A. Bell transform and quantum teleportation

Quantum teleportation [36] is an information protocol with which an unknown qubit is sent from Alice to Bob by successfully performing the operations including state preparation, Bell measurement, classical communication and unitary correction. Alice and Bob share the Bell state | (0, 0) and Alice wants to send an unknown quantum state | to Bob, namely, they

6
TABLE III. Local unitary operators Uij and Vkl with i, j = 0, 1 and k, l = 0, 1 in the teleportation equation (40) for the Bell transform Bell = CH , B, Q, R. Here 1 denotes the imaginary unit and i + j is the binary addition modulo 2. The local unitary operators Uij and Vkl for CH and Q have the form of products of the Pauli matrix X and the Pauli matrix Z , while for B and R have of the Pauli matrix Z and the Pauli matrix X .
Bell Uij Vkl j i l k CH X jZ i+j i Xl Zk+l k Z ( 1) X Z Q ( 1) X j +1 i+j B Z l+1 X k+l Z j Xi i+j l k ( 1) Z X ( 1) Z X k+l R

TABLE IV. Local unitary operators Rij and Skl with i, j = 0, 1 and k, l = 0, 1 in the teleportation equation (45) for the Bell transform Bell = CH , B, Q, R with the single-qubit gate U as the Hadamard gate H .
Bell U Rij Skl CH Zj Xi Zl Xk j +1 i+j l+1 k+l B X Z X l Z H j i+j Q ( Z Xi ( 1) Z k+l X k 1) R ( 1)j X i Z i+j ( 1)l X k Z k+l

| |k |l

i 1 Bell

TABLE V. Local unitary operators Rij and Skl with i, j = 0, 1 and k, l = 0, 1 in the teleportation equation (45) for the Bell transform Bell = CH , B, Q, R with the single-qubit gate U as the /8 gate T . The single-qubit gate W = (X iY )/ 2 is a Clifford gate.
Bell U Rij Skl CH W j Zi W lZk l+1 k +l B Z j+1 W i+j Z l Wk+l k T j i+j i Q ( 1) W Z ( 1) W Z R ( 1)j Z i W i+j ( 1)l Z k W k+l

Bell

1 1 Vkl Uij

FIG. 1. Quantum circuit for quantum teleportation as a diagrammatical representation of the teleportation equation (40) in terms of the teleportation operator (38). The diagram is read from the left to the right. The single lines denote qubits and the double lines denote clas1 sical bits. The box Bell or Bell denotes a two-qubit gate which is 1 1 1 either the Bell transform Bell or its inverse Bell . The box Uij Vkl denotes local unitary correction operators.

matical formulation of quantum teleportation, so we propose the concept of the teleportation operator given by
1 (Bell 1 12 )(1 12 Bell )

(38)

or given by
1 (1 12 Bell )(Bell 1 12 )

(39)

prepare the quantum state | | (0, 0) which can be reformulated as | | (0, 0) = 1 | (i, j ) X i Z j | 2 i,j =0
1

(35)

which is called the teleportation equation in [12]. With the Bell transform CH (8), the teleportation equation (35) has the form given by (1 12 CH )| |00 = (CH 1 12 ) 1 |ji X i Z j | , (36) 2 i,j =0
1 1

1 in terms of the Bell transform Bell and its inverse Bell . For examples, the Bell matrix in this paper can be the CH matrix (8), the YangBaxter gate B (14), the machgate Q (16) and the parity-preserving gate R (20). With the teleportation operator (38), the teleportation equation has a generalized formalism

1 (Bell 1 12 )(1 12 Bell )| |kl =

1 |ij Vkl Uij | (40) 2 i,j =0

and it has the other more meaningful formulation

1 (CH 1 12 )(1 12 CH )| |00 =

1 |ij X j Z i | (37) 2 i,j =0

where k, l = 0, 1 and Vkl and Uij are local unitary operators as products of Pauli matrices acting on the single-qubit, see Table III for local unitary operators Uij and Vkl for the Bell transform Bell = CH , B, Q, R.

in which 1 12 CH is the operation of creating the Bell state 1 | (0, 0) and CH 1 12 can be associated with the Bell measurement. When Alice informs Bob the classical twobit (i, j ), Bob performs the local unitary correction operator Z i X j on his qubit to obtain the transmitted quantum state | .
B. Teleportation operator and quantum circuit of teleportation

| |k |l

i 1 Bell

U |

Bell U

1 1 Rij Skl

In the teleportation equation (37), we realize that the oper1 ator (CH 1 12 )(1 12 CH ) plays the key role in the mathe-

FIG. 2. Fault-tolerant construction of the single-qubit gate U in teleportation-based quantum computation as a diagrammatical representation of the teleportation equation (45) in terms of the teleportation operator (38).

7 form
| |k1 |l1 |k2 |l2 | Bell
1 Bell i1 1 Bell

Q CU |

T XT = W,

T ZT = Z

(43)

j1

Bell CU

P
i2

j2

FIG. 3. Fault-tolerant construction of the two-qubit gate CU in teleportation-based quantum computation as a diagrammatical representation of the teleportation equation (49).

The quantum circuit diagram in FIG. 1 denotes the quantum circuit of quantum teleportation, as a diagrammatical representation of the teleportation equation (40) in terms of the teleportation operator (38), in which Bob performs the local 1 1 unitary operation Uij Vkl on his qubit to obtain the quantum state | . Besides the form (40), the teleportation equation has the other form
1 (1 12 Bell )(Bell 1 12 )|kl | =

iY is a Clifford gate [1, 11]. in which W = X 2 In fault-tolerant quantum computation [1, 2, 11], the faulttolerant construction of Clifford gates including Pauli gates can be realized in a systematical and convenient approach, so the fault-tolerant construction of non-Clifford gates such as the /8 gate becomes a problem of how to introduce a set of Clifford gates to play the role of these non-Clifford gates, which motivates the original research of teleportation-based quantum computation [7]. The fault-tolerant construction of single-qubit gates and two-qubit gates using quantum teleportation [7] has a rather simpler topological diagrammatical interpretation [10] which presents the guideline on our faulttolerant construction of single-qubit and two-qubit gates using the teleportation operator (38). To perform a single-qubit gate U acting on the unknown quantum state | , Alice prepares the quantum state given by

| |U (k, l) ,

(44)

with |U (k, l) = (1 12 U )Bell |kl , and then applies the Bell 1 measurement denoted by Bell 1 12 to the prepared quantum state. These two successive operations lead to the teleportation equation given by
1 (Bell 1 12 )(1 12 1 12 U )(1 12 Bell )| |kl 1

1 V T U T | |ij (41) 2 i,j =0 kl ij

1 |ij Skl Rij U | 2 i,j =0

(45)

with the teleportation operator (39) and with the symbol T denoting the matrix transpose, which is to be exploited in the fault-tolerant construction of two-qubit gates in teleportationbased quantum computation, see FIG. 3 in Section III C.
C. Fault-tolerant construction of single-qubit and two-qubit gates in teleportation-based quantum computation

Teleportation-based quantum computation has been well studied in both algebraic and topological approach in [710]. Here we focus on the fault-tolerant construction of singlequbit gates and two-qubit entangling gates using the Bell transform formulation (40) or (41) of quantum teleportation. Any entangling two-qubit gate with single-qubit gates [3133] can perform universal quantum computation [1, 2]. The CN OT gate, the CZ gate, the Bell transform CH , B , 1 Q, R and their inverses CH , B 1 , Q1 , R1 , all of them are good candidates for an entangling two-qubit gate with the entangling power 1. Single-qubit gates can be generated by the Hadamard gate H and /8 gate [29]. Note that the /8 gate given by T = 1 0 0 ei 4 (42)

with Skl Rij = U (Vkl Uij )U . When Bob gets the classical two-bit (i, j ) information from Alice, he performs the local 1 1 unitary correction operator Rij Skl to obtain the quantum state U | . See Fig. 2 for the quantum circuit of the teleportation equation (45). Note that Vkl Uij (see Table III) is a Pauli operator. As the single-qubit gate U is the Hadamard gate H , the Skl Rij (see Table IV) is still a Pauli operator. As U is the /8 gate, the Skl Rij (see Table V) is a Clifford gate. Hence, the faulttolerant procedure of performing the /8 gate consists of twosteps [7]: The rst step is to fault tolerantly prepare the state |U (k, l) with U = /8, and the second step is to fault1 1 tolerantly perform the associated Clifford gate Rij Skl . The fault-tolerant construction of a two-qubit gate CU depends on the fault-tolerant construction of the quantum state given by |CU = (1 12 CU 1 12 )(Bell Bell )|k1 l1 |k2 l2 (46) which is a four-qubit state. This state together with an unknown two-qubit product state | has the form given by | |CU | (47) which is the prepared quantum state for use. Applying the joint Bell measurement given by
1 1 Bell 1 12 1 12 Bell

is not a Clifford gate, since transformations of elements of the Pauli group Pn under conjugation by the /8 gate have the

(48)

8
TABLE VI. Local unitary operators Q and P in the teleportation equation (49) for two-qubit gates CU including the CN OT gate, CZ gate, the Bell transform Bell = CH , B, Q, R and their inverses with the teleportation operator (38) in terms of the Bell transform CH and Q. The local unitary operators Q and P for CH and Q have the same form of products of the Pauli matrix X and the Pauli matrix Z with different indices a, b, c, d in Table VIII and different phase factors EQ and EP in Table IX.
CU Q P CN OT EQ X a Z b Z c EP X a Z c X d CZ EQ X a Z b Z d EP Z a Z c X d CH EQ Z a X b Z c EP X b Z c X d 1 CH EQ Z a X b X c EP X a Z c X d B (1)b EQ X a Y b X c X d (1)c EP Y b X c Z d CH /Q B 1 EQ X a Y b X c X d (1)d EP Y b X c Z d a b c d Q E Z X Y Y ( 1)d EP X a X b Y c Z d Q c Q1 ( 1)a ( 1)b EQ Z a X b Y c ( 1) ( 1)d EP Y a Y b X c Y d R EQ X a X b Y c Z d ( 1)d EP Z a X b Y c Y d R1 ( 1)a ( 1)b EQ Y b X c Z d ( 1)c ( 1)d EP Y a X b Y c Y d Bell

TABLE VII. Local unitary operators Q and P in the teleportation equation (49) for two-qubit gates CU including the CN OT gate, CZ gate, the Bell transform Bell = CH , B, Q, R and their inverses with the teleportation operator (38) in terms of the Bell transform B and R. The local unitary operators Q and P for CH and Q have the same form of products of the Pauli matrix X and the Pauli matrix Z with different indices a, b, c, d in Table VIII and different phase factors EQ and EP in Table IX.
CU Q P CN OT EQ Z a X b Z d EP X b X c Z d a b c b CZ EQ Z X Z EP Z X c Z d CH EQ X a Z b Z d EP X a X c Z d 1 CH EQ X a Z b X d EP X b X c Z d B (1)a EQ Y a X b X c X d (1)d EP Y a Z c X d B/R B 1 EQ Y a X b X c X d (1)c EP Y a Z c X d a b c d Q E ( 1)c EP X a X b Z c Y d QX Z Y Y c Q1 ( 1)a ( 1)b EQ X a Z b Y d ( 1) 1)d EP Y a Y b Y c X d ( a c R EQ X XbZcY d ( 1) EP X a Z b Y c Y d R1 ( 1)a ( 1)b EQ Y a Z c X d ( 1)c ( 1)d EP X a Y b Y c Y d Bell

to the prepared quantum state gives rise to the teleportation equation

1 1 (Bell 1 12 1 12 Bell )| |CU |

quantum teleportation [36] have been presented in detail, especially, the concept of the braid teleportation has been made very clear. In this paper, we propose the concept of the Bell transform (4) to include various examples in the literature for the unitary basis transformation from the product basis to the Bell basis [1, 2], such as the CH gate (8), the YangBaxter gate (14), the magic matrices Q (16) and R (20). From the viewpoint of quantum computation [1, 2], we make a detailed study on the properties of these four Bell transforms. We show that the Yang-Baxter gate B and the magic gate Q are matchgates [1721] and that the magic gate R is a paritypreserving non-matchgate [21], and also verify these four twoqubit gates as both Clifford gates [1, 11] and maximally entangling gates [21, 27] with the entangling power 1. For three parity-preserving gates B , Q and R, furthermore, we study associated Hamiltonians for a possible physical realization. In terms of the Bell transform (4), we propose the teleportation operator (38) or (39) instead of the braid teleportation [12] to reformulate the standard description of quantum teleportation [36] and study the fault-tolerant construction of single-qubit gates and two-qubit gates in teleportation-based quantum computation [710]. Our research is meaningful mainly due to the following aspects. First, with the teleportation operator (38) or (39), both quantum teleportation and teleportation-based computation obtain a very concrete and well-organized algebraic formulation which is called the teleportation equation [12]. Second, we show that teleportation-

1 = 4i

1 ,j1 =0 i2 ,j2 =0

(1 12 1 12 Q P 1 12 1 12 ) (49)

|i1 j1 CU | |i2 j2 with Q P dened by )CU UiT Q P = CU (Vk1 l1 Ui1 j1 VkT 1 j1 2 l2

(50)

where obviously both the teleportation equations (40) and (41) have been exploited, so that the unitary correction operator is given by Q P . See Fig. 3 for the diagrammatical representation of the teleportation equation (49), and see Table VI, Table VI, Table VIII and Table IX for local unitary operators Q and P (50).

IV. CONCLUDING REMARKS

Together with our recent paper [10] on the topological diagrammatic approach to teleportation-based quantum computation [79], this paper represents a further conceptual development of our previous research [12] in which both topological and algebraic structures in the standard description of

9
TABLE VIII. The indices a, b, c, d for the Bell transform Bell = CH , Q in Table VI and the Bell transform Bell = B, R in Table VII. All the index addition + is the binary addition.
a b c d CH j1 + l1 i1 + k1 i2 + k2 j2 + l2 B j1 + l1 i1 + j1 + k1 + l1 i2 + j2 + k2 + l2 j2 + l2 Q i1 + j1 + k1 + l1 i1 + k1 i2 + k2 i2 + j2 + k2 + l2 R i1 + k1 i1 + j1 + k1 + l1 i2 + j2 + k2 + l2 i2 + k2

TABLE IX. The phase factors EQ and EP for the Bell transform Bell = CH , Q in Table VI and the Bell transform Bell = B, R in Table VII. All the index addition + is the binary addition and all the index multiplication is the logical AND operation.
EQ EP CH (1)j1 k1 (1)i2 l2 B (1)(k1 +l1 )(j1 +1) (1)(i2 +j2 )(l2 +1) Q (1)(i1 +j1 )k1 ( 1)j1 ( 1)l1 (1)(k2 +l2 )i2 ( 1)j2 ( 1)l2 (k1 +l1 )i1 l1 j1 (i2 +j2 )k2 l2 R (1) ( 1) ( 1) (1) ( 1) ( 1)j2

based computation can be regarded as a kind of platform on which quantum Clifford gate computation [1, 11], quantum matchgate computation [1721], and integrable quantum computation [23] can be set up. Third, we expect that the Bell transform can play the important role in topics other than quantum teleportation since the Bell states are widely used in quantum information and computation [1, 2]. We make an outlook on future research related to key topics of this paper. About the Bell transform, one can construct high-dimensional Bell transforms to include examples in the literature, for example, the Bell transform as a unitary basis transformation from the product basis to the GHZ basis [16, 34]. One can also study the Bell transform as a function of parameters, for example, the YangBaxter gate B (x) [14, 23, 34, 35] depending on the spectral parameter x. About quantum teleportation, we only focus on the teleportation of one qubit via maximally entangling two-qubit pure states [3 6], so one can apply both the Bell transform and teleportation operator to multi-qubit teleportation [3638] and quantum teleportation via non-maximally entangling resources [39 41]. About quantum computation, one can study topological and algebraic aspects in the one-way quantum computation [42], which together with teleportation-based quantum computation [710] present typical examples for measurementbased quantum computation.

and Hadamard gate H which are the most popular quantum gates realized in experiments [1]. Here we only present the exponential formulations of three parity-preserving gates [21] B , Q and R with associated Hamiltonians. With the Hamiltonian HB = iX Y , the YangBaxter gate B has the form B = eiHB t |t= , 4 (A1)

where t denotes the evolutional time. The magic gate Q has the exponential form with the global phase ei3/4 given by Q = ei
3 4

12 +1 12 Z ) e 4 Y X ei 4 (2Z 1 ,

(A2)

which gives rise to a time-dependent Hamiltonian, HQ (t) = ( t)(2Z 1 12 + 1 12 Z ) 4 +(t )(iY X ) 4

(A3)

with the step functions ( 4 t) and (t 4 ) and 0 t /2. Equivalently, the gate Q has the other exponential formulation

Q = ei 4 ei 4 (2X X +Y Y ) e 4 (Y X ) with the associated Hamiltonian given by

(A4)

ACKNOWLEDGMENTS

HQ (t) = (

Yong Zhang is supported by the starting grant273732 of Wuhan University.

t)(iY X ) 4 +(t )(2X X + Y Y ) 4

(A5)

with t [0, /2]. The magic gate R has the exponential form given by
Appendix A: Exponential formulations of the Bell transform B, Q, R with associated Hamitonians
12 ) R = ei 4 (iY X Z Z ) ei 4 (Z 1

(A6)

In this paper, we study the application of four maximally entangling Clifford gates CH (8), B (14), Q (16), R (20) in teleportation-based quantum computation [710], but we do not discuss how to prepare them in experiments. The CH gate can easily performed as a tensor product of the CN OT gate

with a time-dependent Hamiltonian given by HR (t) = ( t)(Z 1 12 ) 4 +(t )(iY X Z Z ), 4

(A7)

10 and equivalently has the other exponential formulation R = e i 4 (X X Z Z ) e 4 (Y X ) with the associated Hamiltonian HR (t) = ( t)(iY X ) 4 +(t )(X X Z Z ) 4

(A8)

(A9)

with t [0, /2]. Note that two-qubit matchgates [18] are generated by Hamiltonians as linear combinations of Z 1 12 , 1 12 Z ,

X X , Y Y , X Y and Y X . In the above Hamiltonians, only the Hamiltonians of the magic gate R has an exceptional term Z Z , so the B gate and Q gate are matchgates and the R gate is a non-matchgate. Quantum computation with matchgates B or Q can be efciently simulated on a classical computer, whereas quantum computation with the parity-preserving gate R can boost universal quantum computation mainly due to the computational power of the term expi/4(Z Z ) , see [21, 43]. Similarly, we can obtain the exponential formulations of the inverses of the Bell transform B 1 , Q1 , R1 with the associated Hamiltonians, for example, B 1 = eiHB t |t=3/4 .

[1] M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, (Cambridge University Press, Cambridge, UK, 2000 and 2011). [2] J. Preskill, Online Lecture Notes on Quantum Computation, http://www.theory.caltech.edu/preskill. [3] C.H. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres and W.K. Wootters, Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels, Phys. Rev. Lett. 70, 1895 (1993). [4] L. Vaidman, Teleportation of Quantum States, Phys. Rev. A 49, 1473-1475 (1994). [5] S.L. Braunstein, G.M. DAriano, G.J. Milburn and M.F. Sacchi, Universal Teleportation with a Twist, Phys. Rev. Let. 84, 34863489 (2000). [6] R. F. Werner, All Teleportation and Dense Coding Schemes, J.Phys. A: Math. Theor. 35, 7081-7094 (2001). [7] D. Gottesman and I. Chuang, Demonstrating the Viability of Universal Quantum Computation Using Teleportation and Single-Qubit Operations, Nature 402, 390 (1999). [8] M.A. Nielsen, Universal Quantum Computation Using Only Projective Measurement, Quantum Memory, and Preparation of the 0 State, Phys. Lett. A 308, 96 (2003). [9] D.W. Leung, Quantum Computation by Measurements, Int. J. Quantum Inf. 2, 33 (2004). [10] Y. Zhang and J-L. Pang, Space-Time Topology in TeleportationBased Quantum Computation, arXiv:1309.0955. [11] D. Gottesman, Stabilizer Codes and Quantum Error Correction Codes, Ph.D. Thesis, CalTech, Pasadena, CA, 1997. [12] Y. Zhang, Teleportation, Braid Group and TemperleyLieb Algebra, J.Phys. A: Math. Theor. 39, 11599-11622 (2006); Y. Zhang, Braid Group, TemperleyLieb Algebra, and Quantum Information and Computation, AMS Contemporary Mathematics 482, 52 (2009). [13] L.H. Kauffman and S.J. Lomonaco Jr., Braiding Operators are Universal Quantum Gates, New Journal of Physics 6, 134 (2004). J. Franko, E.C. Rowell and Z. Wang, Extraspecial 2Groups and Images of Braid Group Representations. J. Knot Theory Ramications 15, 413-428 (2006). H. Dye, Unitary Solutions to the YangBaxter Equation in Dimension Four, Quantum Inform. Process. 2, 117-150 (2003). [14] Y. Zhang, L.H. Kauffman and M.L. Ge, Universal Quantum Gate, YangBaxterization and Hamiltonian. Int. J. Quant. Inform. 4, 669-678 (2005). Y. Zhang, N. Jing and M.L. Ge, Quantum Algebras Associated with Bell States. J.Phys. A: Math. Theor. 41, 055310 (2008). [15] Y. Makhlin, Nonlocal Properties of Two-Qubit Gates and

[16]

[17] [18]

[19]

[20]

[21] [22]

[23]

[24]

[25] [26]

Mixed States and Optimization of Quantum Computations, Quantum. Inf. Process. 1, 243 (2002). K. Fujii and T. Suzuki, On the Magic Matrix by Makhlin and the B-C-H Formula in SO(4). Int. J. Geom. Meth. Mod. Phys. 4, 897-905 2007. K. Fujii, H. Oike and T. Suzuki, More on the Isomorphism SU (2) SU (2) = SO(4). Int. J. Geom. Meth. Mod. Phys. 4, 471-485 (2007). L. Valiant, Quantum Circuits that can be Simulated Classically in Polynomial Time. SIAM J. Computing 31, 1229-1254 (2002). B.M. Terhal and D.P. DiVincenzo, Classical Simulation of Noninteracting-Fermion Quantum Circuits, Phys. Rev. A 65, 032325/1-10 (2002). E. Knill, Fermionic Linear Optics and Matchgates. arXiv:quant-ph/0108033. R. Jozsa and A. Miyake, Matchgates and Classical Simulation of Quantum Circuits, Proc. R. Soc. A 464, 3089-3106 (2008). R. Jozsa, B. Kraus, A. Miyake and J. Watrous, Matchgate and Space-Bounded Quantum Computations are Equivalent, Proc. R. Soc. A 466, 809-830 (2010). M. Van den Nest, Quantum Matchgate Computations and Linear Threshold Gates, Proc. R. Soc. A 467, 821-840 (2011). S. Ramelow, A. Fedrizzi, A. M. Steinberg and A. G. White, Matchgate Quantum Computing and Non-local Process Analysis, New J. Phys. 12, 083027 (2010). D.J. Brod and E.F. Galv ao, Extending Matchgates into Universal Quantum Computation Phys. Rev. A 84, 022310 (2011). C.N. Yang, Some Exact Results for the Many Body Problems in One Dimension with Repulsive Delta Function Interaction, Phys. Rev. Lett. 19, 1312-1314 (1967). R.J. Baxter, Partition Function of the Eight-Vertex Lattice Model, Annals Phys. 70, 193-228 (1972). J.H.H. Perk and H. Au-Yang, Yang-Baxter Equations, Encyclopedia of Mathematical Physics, Vol. 5, 465473 (Elsevier Science, Oxford, 2006). Y. Zhang, Integrable Quantum Computation, Quantum Inf. Process. 12, 631-639 (2013). Y. Zhang, Quantum Computing via the Bethe Ansatz, Quantum Inf. Process. 11, 585-590 (2012). Y. Zhang, Quantum Error Correction Code in the Hamiltonian Formulation, arXiv:0801.2561. Y. Zhang, L.H. Kauffman and M.L. Ge, YangBaxterizations, Universal Quantum Gates and Hamiltonians, Quantum Inf. Process. 4, 159-197 (2005). R. Jozsa, Embedding Classical into Quantum Computation, LNCS 5393 Beth Festschrift, J. Calmet, W. Geiselmann, J. Mueller-Quade (Eds.), 43-49 (2008). M.B. Plenio and S. Virmani, An Introduction to Entanglement Measures, Quant. Inf. Comput. 7, 1-51 (2007). D. Bruss, Characterizing Entanglement, J. Math. Phys. 43, 4237 (2002).

11
[27] P. Zanardi, C. Zalka and L. Faoro, Entangling Power of Quantum Evolutions, Phys. Rev. A 62, 030301 (2000). [28] The quantum circuit diagrams in this paper are drawn with the help of the macro package written by Steve Flammia and Bryan Eastin, see the link: http://physics.unm.edu/CQuIC/Qcircuit/. [29] P.O. Boykin, T. Mor, M. Pulver, V. Roychowdhury and F. Vatan, A New Universal and Fault-Tolerant Quantum Basis, Inf. Process. Lett. 75, 101-107 (2000). [30] B. Kraus and J.I. Cirac, Optimal Creation of Entanglement Using a Two-Qubit Gate, Phys. Rev. A 63, 062309 (2001). [31] A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. H. Margolus, P. W. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter. Elementary Gates for Quantum Computation, Phys. Rev. A 52, 3457-3467 (1995). [32] J.L. Brylinski and R. Brylinski, Universal quantum gates, in Mathematics of Quantum Computation, Chapman & Hall/CRC Press, Boca Raton, Florida, 2002 (edited by R. Brylinski and G. Chen). [33] M.J. Bremner, C.M. Dawson, J.L. Dodd, A. Gilchrist1, A.W. Harrow1, D. Mortimer, M.A. Nielsen and T.J. Osborne, Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate, Phys. Rev. Lett. 89, 247902 (2002) [34] Y. Zhang and M.L. Ge, GHZ States, Almost-Complex Structure and YangBaxter Equation, Quantum Inf. Process. 6, 363379 (2007). E.C. Rowell, Y. Zhang, Y.-S. Wu and M.L. Ge, Extraspecial Two-Groups, Generalized YangBaxter Equations and Braiding Quantum Gates, Quant. Inf. Comput. 10, 06850702 (2010). C.-L. Ho, A.I. Solomon and C.-H.Oh, Quantum Entanglement, Unitary Braid Representation and TemperleyLieb Algebra, EPL 92, 30002 (2010). L.-W. Yu, Q. Zhao and M.L. Ge, Factorized Three-body SMatrix Restrained by Yang-Baxter Equation and Quantum Entanglements, arXiv:1311.6198. J.-L. Chen, K. Xue, M.L. Ge, Braiding Transformation, Entanglement Swapping and Berry Phase in Entanglement Space, Phys. Rev. A 76, 042324 (2007). P.-X. Chen, S.-Y. Zhu, and G.-C. Guo, General Form of Genuine Multipartite Entanglement Quantum Channels for Teleportation, Phys. Rev. A 74, 032324 (2006). C.-Y. Cheung and Z.-J. Zhang, Criterion for faithful teleportation with an arbitrary multiparticle channel, Phys. Rev. A 80, 022327 (2009). M.-J. Zhao, Z.-G. Li, X. Li-Jost, S.-M. Fei, Multiqubit Quantum Teleportation, J. Phys. A: Math. Theor. 45, 405303 (2012). W.-L. Li, C.-F. Li and G.-C. Guo, Probabilistic Teleportation and Entanglement Matching, Phys. Rev. A 61, 034301 (2000). P. Agrawal and A.K. Pati, Probabilistic Quantum Teleportation, Phys. Lett. A 305, 12 (2002). G. Gordon and G. Rigolin, Generalized Teleportation Protocol, Phys. Rev. A 73, 042309 (2006). R. Raussendorf and H.J. Briegel, A One-Way Quantum Computer, Phys. Rev. Lett. 86, 5188 (2001). S. Bravyi and A. Kitaev, Fermionic Quantum Computation, Ann. Phys. 298, 210-226 (2002).

[35]

[36]

[37]

[38] [39] [40] [41] [42] [43]