Elementary gates of ternary quantum logic circuit

Elementary gates of ternary quantum logic circuit

Yao-Min Di111Email address: Yaomindi@sina.com and Hai-Rui Wei School of Physics Electronic Engineering, Xuzhou Normal University, Xuzhou 221116, China
Department of Physics, Beijing Normal University, Beijing 100875, China
July 15, 2019
Abstract

The elementary gates are basic building blocks of quantum logic circuit. They should be simple, efficient, and easy to implement. In this article, we propose the ternary controlled X (TCX) gate or the ternary controlled Z (TCZ) gate as the two-qutrit elementary gate, which is universal when assisted by arbitrary one-qutrit gates. Based on Cartan decomposition, we give the one-qutrit elementary gates. Also, we discuss the physical implementation of these elementary gates and show that they are feasible with current technology. Then we investigate the synthesis of some important ternary gates, such as the ternary SWAP gate, ternary Toffoli gates and Muthukrishnan-Stroud gates. Finally we extend these elementary gates to a more general case for qudit systems. This work provides a unified description for the synthesis of both binary and multi-valued quantum circuits.

pacs:
03.67.Lx, 03.65.Fd

I Introduction

Quantum computer has attracted a great deal of attention due to its potentialities to solve classical NP problems in polynomial time. In quantum computing, the algorithms are commonly described by the quantum circuit model 1 (). In 1995, Barenco et al. showed that any binary quantum logic circuit can be decomposed into a sequence of one-qubit gates and CNOT gates 2 (). The process of constructing quantum circuits by these elementary gates is called synthesis by many authors. The complexity of quantum circuit can be measured in terms of the number of elementary gates required. Achieving gate arrays of less complexity is crucial as it reduces not only the resource but also the errors.

Most approaches to quantum computing use two-level quantum systems (qubits). Recent studies have indicated that there are some advantages to expand quantum computer from qubits to multi-level system (qudits). Three level quantum systems, so called qutrits, are the simplest multi-valued systems. There have been many proposals to use multi-level quantum systems to implement the quantum computation and other quantum information processes 3 (); 4 (); 5 (); 6 (); 7 (); 8 (). In experiment, there have been reports on their applications in simplifying quantum gates 9 (), simulating physical system with spin greater than 1/2 10 (). Multi-level quantum systems have been realized in many ways in the field of optics 11 (); 12 (); 13 (). In solid-state devices, the experimental demonstrations of full quantum state tomography of the qutrit have been reported recently 14 (); 15 (). But multi-valued quantum logic synthesis is still a new and immature research area. The crucial issue which gates is chosen as the elementary gate set of multi-valued quantum circuit is not well solved. The elementary gates are the basic blocks for constructing quantum logic circuit, and they should be universal, simple, effective and easy to implement.

A number of works have been done on multi-valued logic synthesis by some authors. In 2000, Muthukrishnan and Stroud investigated the synthesis of multi-valued quantum circuit 4 () and showed that two two-qudit gates, which are called Muthukrishnan-Stroud gates now, together with the one-qudit gates, are universal for quantum computing. In 2002, Perkowski, Al-Rabadi, and Kerntopf proposed a set of generalized ternary gates (GTG gate) 16 () based on a ternary condition gate and ternary shift gates 17 (). During 2005 to 2006, based on cosine-sine decomposition of matrix 18 (), the synthesis of ternary and more general multi-valued quantum logic circuits was investigated by Khan and Perkowski in Refs.19 () and 20 (), respectively. The multi-valued quantum circuit can be synthesized in terms of quantum multiplexers and uniformly controlled rotations. But these components themselves have a complicated structure and their synthesis needs study further.

On the other hand, two Brylinskies 21 () proved that any two-qudit gate that creates entanglement without ancillas can act as a universal gate for quantum computation, when assisted by arbitrary one-qudit gates. That is to say, “almost every” two-qudit gate is universal when assisted by one-qudit gates. But not all these gates are suitable to be chosen as the two-qudit elementary gate of the quantum multi-valued circuit. Just as the binary quantum circuit, we usually choose CNOT gate or controlled-Z gate as the two-qubit elementary gate although “almost every” two-qubit gate is universal. Two Brylinskies’ proof relies on a long argument using advanced mathematics. No any specific gate is proposed as the two-qudit elementary gate. Alber investigated the purification of bipartite high dimension quantum states with hermitian generalized XOR gate (GXOR gate)et al. 22 (). As a universal bipartite gate for ternary quantum computing, a protocol of the physical implementation of the GXOR gate on ions in a trap was presented by Klimov et al. in 23 (). Wang et al. discussed the entanglement power of operators in qudit systems. They proposed to choose the SUM gate, which is called Feynman gate in computer community, as the elementary bipartite gate for qudit quantum computing 24 (). But little work has done based on these gates for the specific synthesis of multi-valued quantum circuit.

In this article, we focus on the investigation of elementary gates of ternary quantum logic circuits. We propose the ternary controlled X (TCX) gate or the ternary controlled Z (TCZ) gate as the two-qutrit elementary gate. Based on the Cartan decomposition 25 (), the one-qutrit elementary gates are also given. The elementary gates proposed here are essentially binary and which can be implemented with current technology. Also, we expand these elementary gates to a more general case of qudit systems. So many results in binary quantum logic circuits can be generalized to a multi-valued case. They can be used as a unified measure of complexity for various quantum logic circuits.

This article is organized as follows. In Sec. II, we investigate two-qutrit elementary gate for ternary quantum logic circuits and propose the TCX gate or the TCZ gate as the elementary gate. In Sec. III, based on Cartan decomposition we discuss the set of one-qutrit elementary gates and the synthesis of generic one-qutrit gates. The physical implementations of these elementary gates are studied in Sec. IV. And the synthesis of some important ternary quantum gates, such as the ternary SWAP gate, ternary Toffoli gates and Muthukrishnan-Stroud gates, is given in Sec. V. In Sec. VI, we extend our study to a general case for qudit systems. Finally a brief conclusion and future work is given in Sec. VII.

Ii Two-qutrit elementary gates

In one qutrit case, there are three X quantum gates given by the matrices

(1)

Similarly, for every single qubit gate A, we can simply extend it to a set of ternary gate, . The ternary extension of Hadamard gate can be expressed as

(2)

The extension of Z gate is slightly different, we denote them as

(3)
Figure 1: Ternary controlled-X gate.
Figure 2: Transformation among different TCX gates. (a) Transformation of control mode. (b) Transformation of target operations.
Figure 3: TCZ gates and transformation between TCX and TCZ gates.

The TCX gate is a two-qutrit gate which is defined that the gate implements the operation on the target qutrit iff the control qutrit is in the states , . The circuit representation for the TCX gate is shown in Fig. 1 in which the line with a circle represents the control qutrit, while that with a square represents the target qutrit. There are nine different forms for the TCX gate and they can be easily transferred one another as shown in Fig. 2. The TCZ gate is defined that the gate implements the operation on the target qutrit iff the control qutrit is in the states . Similar to the binary controlled Z gate, the control qutrit and target qutrit of TCZ gate are exchangeable. It has nine different forms, which also can be transferred one another by using ternary X gates. The symbol of TCZ gate and its transformation relation with TCX gate are shown in Fig. 3.

The ternary shift gates proposed in Ref. 17 () are basic one-qutrit gates. Operations, symbols and the relations with X operations are listed in Fig. 4. Likewise, the two-qutrit controlled shift gates can be defined. Two-qutrit Feynman gate which is called SUM gate in 24 () is shown in Fig. 5. Here is the controlling input and is the controlled input. The output in control qutrit equals to the input , and the output in target qutrit is the sum of and modulo 3. The synthesis of the ternary Feynman gate base on the TCX gates is shown in Fig. 6. GXOR gate is similar to the Feynman gate, and the difference is that the output is the difference of and modulo 3. Its synthesis is shown in Fig. 7. The GTG gates are the combinations of the controlled shift gates and they are mainly used to investigate the synthesis of permutation quantum gates by some groups 16 (); 17 (). The permutation gate is a gate which unitary matrices have only one 1 in every column and the remaining elements 0.

Figure 4: Ternary shift gates.
Figure 5: Ternary Feyman gate.
Figure 6: Synthesis of ternary Feynman gate.
Figure 7: Synthesis of GXOR gate.

The X operation is more elementary than the shift operation. From the point of view of group theory, the six shift operations constitutes a permutation group , and the and operations are the generators of the group. The TCX gate is an elementary counterpart of the binary CNOT gate. It is simple and easy to implement. While the Feynman gate, GXOR gate and GTG gates have complex structures themselves. So we propose the TCX gate as the two-qutrit elementary gate for qutrit-based quantum computation. Of course, the choice is not unique, and the TCZ gate also can be chosen as the two-qutrit elementary gate.

Iii One-qutrit elementary gates

The complexity of binary quantum logic gate is usually measured by the numbers of CNOT gate and one-qubit , gates. We call the , gates as one-qubit elementary gates. Suppose is the matrix of a one-qutrit gate. Using the Cartan decomposition of Lie group, it can be expressed 26 () as

(4)

where , etc. are all real numbers. Here for and . , , and . The four basic one-qutrit gates, , , , constitutes a set of one-qutrit elementary gates.

The Cartan decomposition of one-qutrit gates is not unique, so the choice of one-qutrit elementary gates is not unique too. From one kind of Cartan decomposition presented in Appendix A, we get another product expression of a single qutrit gate that

(5)

Here is a special unitary transformation in 2-dimensional subspace , and it can be factored further by the Euler decomposition. The Euler decomposition usually has two modes: ZYZ decomposition and XYX decomposition. So the set of one-qutrit elementary gates has two pairs of basic gates in subspaces and respectively. We can take , , , or , , , as one-qutrit elementary gates. The set of one-qutrit elementary gate given in Ref. 26 () is one of them. The synthesis of generic one-qutrit gates is given by Eq. (4) or Eq. (5).

Iv Physical implementation of ternary elementary gates

As we know, there are not many proposals on the physical implementation of ternary gates. In Ref. 4 (), a scheme for the implementation of Muthukrishnan-Stroud gates based on the linear ion trap is given. Also based on the ion trap, a scheme for the GXOR gate is given by Klimov et al. in Ref. 23 (). But these schemes and the gates themselves are rather complicated, and no experimental investigations on them have been reported yet. However, in the last decade, there has been tremendous progress in the experimental development of binary quantum computing, and the problem of constructing a CNOT gate has been addressed from various perspectives and for different physical systems 27 (); 28 (); 29 (); 30 (); 31 (); 32 (); 33 (); 34 (); 35 (); 36 (); 37 (); 38 (); 39 (). The elementary gates proposed here can be implemented by existing technique.

Assume we have a V-type three-level quantum system shown in Fig. 8, which constitutes a qutrit and the two levels of the system and forms a qubit. Two laser beams and are applied to the ion to manipulate and transition, respectively. If a two-qubit CNOT gate is realized in such systems, one of TCX gate is naturally obtained, and the eight other form TCX gates can be obtained by the transformation shown in Fig. 2. The single qutrit gates are implemented by Rabi oscillations between the qutrit levels. Applying the laser pulses in and and choosing suitable phases, this allows us to perform , and , gates respectively 1 (); 40 (). So a set of one-qutrit elementary gates is obtained, and any one-qutrit gate can be implemented according to Eq. (4) or Eq. (8). There are other two types of quantum system, -type and cascade type. We can use , , , or , , , as one-qutrit elementary gates to meet the requirement of manipulating quantum states in these types of quantum system.

Figure 8: V-type three level quantum system.

It is not too difficult to find such a quantum system. Early in 2003, the Innsbruck group implemented the complete Cirac-Zoller protocol 27 () of CONT gate with two calcium ions () in a trap 29 (). The energy level scheme of is given in Ref. 31 (). The original qubit information is encoded in ground state and metastable state. The state has a lifetime s. There is another metastable state in . Its lifetime, which is measured recently by Kreuter et al. 41 (), is about the same as that of the state. The three levels of , one ground state and two metastable states, may constitute a qutrit candidate. The CNOT gate was implemented by Schmidt-Kaler et al. 29 () forms naturally a TCX gate. Two laser pulses are used to manipulate the quadruple transition near 729 nm and the transition near 732 nm, respectively. Rabi oscillations between these levels can implement the one-qutrit elementary gates , and , .

The superconducting quantum information processing devices are typically operated as qubit by restricting it to the two lowest energy eigenstates. By relaxing this restriction, we can operate it as a qutrit or qudit. As mentioned in introduction, the experimental demonstrations of the tomography of a transmon-type superconducting qutrit and a superconducting phase qutrit have been reported in Ref. 14 () and Ref. 15 (), respectively. It means that to prepare arbitrary one-qutrit state and read out with high-fidelity on these systems has been implemented. So the one-qutrit gates can be implemented on the systems by the method described here. Construction of a robust CNOT gate on superconducting qubits has been extensively investigated both in theory and experiment 33 (); 34 (); 35 (); 36 (); 37 (); 38 (). So the condition to implement elementary gates of ternary quantum logic circuit has come to maturity on these superconducting qutrits.

V Synthesis of some important ternary quantum gates

Since the X operations given in Eq. (II) and the four one-qutrit elementary gates all only act on two levels in a qutrit, many results in binary quantum logic circuit can be generalized to ternary quantum logic circuits. The synthesis of binary quantum circuit has been extensively investigated by many groups 1 (); 2 (); 42 (); 43 (); 44 (); 45 (); 46 (); 47 (), and it is rather mature now. The ternary SWAP gate interchanges the states of two qutrits acted by the gate. It is a generalization of binary SWAP gate and can be decomposed into three binary SWAP gates, i.e.,

(6)

Here the can be called as a conditional SWAP gate, and each of them is synthesized by three TCX gates. So the ternary SWAP gate is synthesized by nine TCX gates, as shown in Fig. 9. Likewise, the ternary root SWAP gate can be decomposed into three binary root SWAP gates.

The ternary Toffoli gate has many forms. Here we define an elementary ternary Toffoli gate that two control qutrits are unaffected by the action of the gate, and the target qutrit is acted by the operation iff the two control qutrits are in the states , respectively. By the result of quantum synthesis for the binary Toffoli gate 1 (), the synthesis of the elementary ternary Toffoli gate can be obtained and is illustrated in Fig. 10. It needs six TCX gates and ten single qutrit gates, which are the simple extension of single qubit gates , , and .

Figure 9: Synthesis of ternary SWAP gate.
Figure 10: Synthesis of ternary elementary Toffoli gate.
Figure 11: Synthesis of a typical ternary Toffoli gate.

A typical ternary Toffoli gate is that the two control qutrits remain no change, and the output of target qutrit is iff both two qutrits are in the state , where is the input of the target qutrit. Yang et al. defined a generalized ternary Toffoli gate for multiple qutrit systems in Ref. 48 (), and it is just this kind of ternary Toffoli gate in the three qutrits case. We give its synthesis shown in Fig. 11, which needs six TCX gates and eight one-qutrit elementary gates.

The two Muthukrishnan-Stroud gates are denoted by and respectively. They are two-qutrit controlled gates in which if the control qutrit is set to , then the operation or is applied to the target qutrit respectively. is a family of one-qutrit gates which transfer a definite single qutrit state to the state , that is,

(7)

It does not determine the transform uniquely. Assume , , and , one of expression of the operation can be written as

(8)

The synthesis of based on TCZ gate is shown in Fig. 12. Here

(9)
(10)

The is a single qutrit phase gate which advances the phase of without affecting and states in the qutrit. and its synthesis is shown in Fig. 13.

Figure 12: Synthesis of Muthukrishnan-Stroud gate .
Figure 13: Synthesis of Muthukrishnan-Stroud gate , where , , .

Based on the CSD, Khan and Perkowski investigate the structure of ternary quantum circuit. An arbitrary n qutrit gate can be synthesized with four multiplexers acting on qutrits and three -fold uniformly controlled rotations. The syntheses of these multiplexers and uniformly controlled rotations are much more complicated than that of Muthukrishnan-Stroud gate. We will investigate them in another article.

Vi General multi-valued case

In this section, we generalize the elementary gates to a general multi-valued quantum logic circuit case. We first extend the single qubit X gate to -dimensional quantum systems (qudits) similar to the ternary case. The single qudit gate is a gate which acts the X operation in two-dimensional subspace of -dimensional Hilbert space. Similarly the definition of TCX gate can be naturally generalized to the qudit case. The generalized controlled X (GCX) gate is the two-qudit gate it implements the operation on the target qudit iff the control qudit is in the states (). Likewise, we can define the generalized controlled Z (GCZ) gate. The GCX gate or GCZ gate can be chosen as the two-qudit elementary gate, which is universal for qudit quantum computing, when it is assisted by arbitrary one-qudit gates. The GCX gate has kinds of control mode and different operations. They can be transferred one another by the similar mode shown in Fig. 2. This holds true for the GCZ gate too.

The matrices of -dimensional one-qudit gates are the elements of -dimensional unitary group. From successive Cartan decompositions of group and Euler decompositions, we can show that the set of one-qudit elementary gates has pairs of basic gates acting on different 2-dimensional subspaces. So manipulating a qudit completely needs at least driving fields. The choice of pairs of basic gates is not unique. They are universal if only the corresponding driving fields can connect the levels of the qudit together. Like qutrit case, the pair of basic gates also has two modes: , and , modes. The Cartan decomposition of a one-qudit gate has given in appendix B.

Vii Conclusion and future work

We have investigated the elementary gates for ternary quantum logic circuits. We propose the TCX or the TCZ gates as a two-qutrit elementary gate, with which arbitrary ternary quantum circuits can be synthesized when they are assisted by single qutrit gates. Based on the Cartan decomposition, the one-qutrit elementary gates are also investigated. They have two pairs of basic gates and two modes: , , , , or , , , . Then we have discussed the implementation scheme for the ternary elementary gates and have investigated the synthesis of some important ternary gates. The elementary gates proposed here are simple, efficient and can be implemented with current technology. Moreover, these elementary gates can be easily extended to a more general qudit case, so they constitute unified elements to synthesize quantum logic circuits, whatever they are qubit, qutrit, qudit or hybrid circuits. We can use them as a unified measure for the complexity of various quantum circuits.

The multi-valued and hybrid quantum computing is a new and exciting research area in which there is plenty of work to do. Moreover, to choose suitable quantum system, such as trapped ions, superconducting qutrits or qudits and quantum dots, to investigate the physical implementation of multi-valued quantum logic gates and to undertake the experimental work is crucial for the development of multi-valued quantum information science.

Acknowledgements

We would like to thank Dr. Fu-Guo Deng for his carefully reading the manuscript, improving English, and helpful discussion. The work was supported by the Project of Natural Science Foundation of Jiangsu Education Bureau, China (Grant No. 09KJB140010).

Appendix A Cartan Decompositon of One-Qutrit Gates

The Cartan decomposition of a Lie group depends on the decomposition of its Lie algebras 25 (). Let be a semisimple Lie algebra and there is the decomposition relations

(1)

where and satisfy the commutation relations

(2)

we said the decomposition is the Cartan decomposition of Lie algebra . The is closed under the Lie bracket, so it is a Lie subalgebra of , and that . A maximal Abelian subalgebra contained in is called a Cartan subalgebra. Then using the relation between Lie group and Lie algebra, every element of Lie group can be decomposed as

(3)

where , and .

The one-qutrit gates form a -dimensional unitary group . We have 8 independent ternary Pauli’s matrices: three matrices, three matrices, and the two independent matrices in the three of them. Multiplying these 8 independent Pauli’s matrices by , we get the basis vectors of Lie algebra which we called the qusi-spin basis. Together with identity matrix multiplied by , they constitute the basis vectors of Lie algebra . Take a AIII type Cartan decomposition 25 () of , that is

(4)

Lie subalgebra consists of subagebra and a complex basis . We choose

(5)

and its Cartan subalgebra

(7)

So the one-qutrit matrix can be decomposed as

(8)

Lie subalgebra and Cartan subalgebra of the Cartan decomposition can be different, so the decomposition is not unique, we can get more generic Eq. (5) in Sec.III.

Appendix B Cartan Decompositon of One-Qudit Gates

The one-qudit gates form a group. We can also use the qusi-spin basis. There are matrices, matrices and independent matrices in the of them for a n-dimensional Hilbert space. Multiplying these independent qusi-spin matrices by , we gain the basis vectors of Lie algebra . Together with identity matrix multiplied by , they constitute the basis vectors of Lie algebra . We also take a kind of AIII type Cartan decomposition for , that is

(9)

Lie algebra consists of subagebra and a complex basis . We choose its Cartan subalgebra

(10)

So arbitrary one-qudit matrix can be expressed as

(11)

where group. The matrix can be re-expressed as

(12)

where . That is, can be expressed as a linear combination of s, , so is a product of a serious of s. combines with in and to form , other s are absorbed in s.

From Eq. (12), we can see that the -dimensional one-qudit elementary gates needs one pair of basic gate more than that for the (-1)-dimensional qudit. They come from Euler decompositions of . The (-1)-dimensional qudit matrix can be decomposed further in same mode. The successive decomposition can be done until the qutrit occurs. The one-qutrit elementary gates are two pairs of basic gates, so we can infer that the set of -dimensional one-qudit elementary gates has pairs of basic gates. Likewise the mode of Cartan decomposition and its Cartan subalgebra can be different, the decomposition is not unique, so the choice of pairs of basic gates is not unique too.

References

  • (1) M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000).
  • (2) A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, et al, Phys. Rev. A 52, 3457 (1995).
  • (3) A. D. Greentree, S. G. Schirmer, F. Green, L. C. L. Hollenberg, A. R. Hamilton, and R. G. Clark, Phys. Rev. Lett. 92, 097901 (2004).
  • (4) A. Muthukrishnan, and C. R. Stroud, Jr., Phys. Rev. A 62, 052309 (2000).
  • (5) D. L. Zhou, B. Zeng, Z. Xu, and C. P. Sun, Phys. Rev. A 68, 062303 (2003).
  • (6) B. Tamir, Phys. Rev. A 77, 022326 (2008).
  • (7) H. Bechmann-Pasquinucci, and A. Peres, Phys. Rev. Lett. 85, 3313 (2000).
  • (8) I. Bregman, D. Aharonov, and M. Ben-Or, H. S. Eisenberg, Phys. Rev. A 77, 050301 (2008).
  • (9) B. P. Lanyon, M. Barbieri, M. P. Almeida, T. Jennewein, T. C. Ralph, K. J. Resch, G. J. Pryde, J. L. O’Brien, A. Gilchrist, and A. G. White, Nature Phys. 5, 134 (2009).
  • (10) M. Neeley, M. Ansmann, R. C. Bialczak, M. Hofheinz, E. Lucero, A. D. O’Connell, D. Sank, H. Wang, J. Wenner, A. N. Cleland, M. R. Geller, and J. M. Martinis, Science 325, 722 (2009).
  • (11) R. Inoue, T. Yonehara, Y. Miyamoto, M. Koashi, and M. Kozuma, Phys. Rev. Lett. 103, 110503 (2009).
  • (12) G. Vallone, E. Pomarico, F. De Martini, P. Mataloni, and M. Barbieri, Phys. Rev. A 76, 012319 (2007).
  • (13) S. Straupe, and S. Kulik, Nat. Photonics 4, 585 (2010).
  • (14) R. Bianchetti, S. Filipp, M. Baur, J. M. Fink, C. Lang, L. Steffen, M. Boissonneault, A. Blais, and A. Wallraff, Phys. Rev. Lett. 105, 223601 (2010).
  • (15) Y. Shalibo, Y. Rofe, D. Shwa, F. Zeides, M. Neeley, J. M. Martinis, N. Katz, Bulletin of APS 55, Z26.00013 (2010).
  • (16) M. Perkowski, A. Al-Rabadi, and P. Kerntopf, Proc. Int’s. Symp. on New Paradigm VLSI computing, pp.41-47. Sendai, Japan, December 12-14, (2002).
  • (17) M. H. A. Khan, M. A. Perkowski, and P. Kerntopf, Proc. ISMVL, Tokyo, May 16-19, pp.146-153 (2003).
  • (18) C. C. Paige, and M. Wei, Linear Algebra and Appl. 208/209, 303 (1994).
  • (19) F. S. Khan, and M. Perkowski, Proceedings of the 7th International symposium on representations and methodology of future computing technologies (Tokyo, Japan). pp.114-118 (2005).
  • (20) F. S. Khan, and M. Perkowski, Theor. Comput. Sci. 367, 336 (2006).
  • (21) J. L. Brylinski, and R. Brylinski, e-print arXiv: quant-ph/0108062 (2001).
  • (22) G. Alber, A. Delgado, N. Gisin, and I. Jex, J. Phys. A 34, 8821 (2001).
  • (23) A. B. Klimov, R. Guzmán, J. C. Retamal, and C. Saavedra, Phys. Rev. A 67, 062313 (2003).
  • (24) X. G. Wang, B. C. Sanders, and D. W. Berry, Phys. Rev. A 67, 042323 (2003).
  • (25) S. Helgason, Differential Geometry, Lie Groups and Symmetric Spaces (New York: Academic, 1978).
  • (26) Y. M. Di, J. Zhang, and H. R. Wei, Sci. Chin. G 51, 1668 (2008).
  • (27) J. I. Cirac, and P. Zoller, Phys. Rev. Lett. 74, 4091 (1995).
  • (28) C. Monroe, D. M. Meekhof, B. E. King, W. M. Itano, and D. J. Wineland, Phys. Rev. Lett. 75, 4714 (1995).
  • (29) F. Schmidt-Kaler, H. Häffner, M. Riebe, S. Gulde, G. P. T. Lancaster, T. Deuschle, C. Becher, C. F. Roos, J. Eschner, and R. Blatt, Nature 422, 408 (2003).
  • (30) J. L. O¡äBrien, G. J. Pryde, A. G. White, T. C. Ralph, and D. Branning, Nature 426, 264 (2003).
  • (31) J. Zhang, J. Vala, S. Sastry, and K. B. Whaley, Phys. Rev. A 67, 042313 (2003).
  • (32) S. Gasparoni, J. W. Pan, P. Walther, T. Rudolph, and A. Zeilinger, Phys. Rev. Lett. 93, 020504 (2004).
  • (33) A. Galiautdinov, Phys. Rev. A 75, 052303 (2007).
  • (34) A. Blais, J. Gambetta, A. Wallraff, D. I. Schuster, S. M. Girvin, M. H. Devoret, and R. J. Schoelkopf, Phys. Rev. A 75, 032329 (2007).
  • (35) A. Galiautdinov, Phys. Rev. A 79, 042316 (2009).
  • (36) J. Clarke, F. K. Wilhelm, Nature 453, 1031 (2008).
  • (37) J. Majer, J. M. Chow, J. M. Gambetta, J. Koch, B. R. Johnson, J. A. Schreier, L. Frunzio, D. I. Schuster, A. A. Houck, A. Wallraff, A. Blais, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf, Nature 449, 443 (2007).
  • (38) J. H. Plantenberg, P. C. de Groot, C. J. P. M. Harmans, and J. E. Mooij, Nature 447, 836 (2007).
  • (39) L. Isenhower, E. Urban, X. L. Zhang, A. T. Gill, T. Henage, T. A. Johnson, T. G. Walker, and M. Saffman, Phys. Rev. Lett. 104, 010503 (2010).
  • (40) H. Häffner, C. F. Roos, and R. Blatt, Phys. Reports 469, 155 (2008).
  • (41) A. Kreuter, C. Becher, G. P. T. Lancaster, A. B. Mundt, C. Russo, H. Häffner, C. Roos, W. Hänsel, F. Schmidt-Kaler, R. Blatt, and M. S. Safronova, Phys. Rev. A 71, 032504 (2005).
  • (42) F. Vatan, and C. Williams, Phys. Rev. A 69, 032315 (2004).
  • (43) V. V. Shende, I. L. Markov, and S. S. Bullock, Phys. Rev. A 69, 062321(2004).
  • (44) G. Vidal, and C. M. Dawson, Phys. Rev. A. 69, 010301 (2004).
  • (45) M, Möttönen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa, Phys. Rev. Lett. 93, 130502 (2004).
  • (46) V. V. Shende, S. S. Bullock, and I. L. Markov, IEEE. Trans. on C. A. D. 25 1000 (2006).
  • (47) H. R. Wei, and Y. M. Di, Chin. Phys. Lett. 25, 3107 (2008).
  • (48) G. W. Yang, X. Y. Song, M. Perkowski, and J. Z. Wu, J. Phys. A 38, 9689 (2005).
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
248090
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description