Article | Open | Published:

Geometry of Quantum Computation with Qutrits

Scientific Reports volume 3, Article number: 2594 (2013) | Download Citation

Abstract

Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum computation with n qutrits. We show that the optimal quantum circuits are essentially equivalent to the shortest path between two points in a certain curved geometry of SU(3n). As an example, three-qutrit systems are investigated in detail.

Introduction

Due to the quantum parallelism, quantum computers can solve efficiently problems that are considered intractable on classical computers1, e.g., algorithm for finding the prime factors of an integer2,3 and quantum searching algorithm4. A quantum computation can be described as a sequence of quantum gates, which determines a unitary evolution U performed by the computer. An algorithm is said to be efficient if the number of gates required grows only polynomially with the size of the problem. A central problem of quantum computation is to find efficient quantum circuits to synthesize desired unitary operation U used in such quantum algorithms.

A geometric approach to investigate such quantum circuit complexity for qubit systems has been developed in5,6,7. It is shown that the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry. The main idea is to introduce a Riemannian metric on the space of n-qubit unitary operations, chosen in such a way that the metric distance d(I, U) between the identity operation and a desired unitary U is equivalent to the number of quantum gates required to synthesize U under certain constraints. Hence the distance d(I, U) is a good measure of the difficulty of synthesizing U.

In fact, d-dimensional quantum states (qudits) could be more efficient than qubits in quantum information processing such as key distribution in the presence of several eavesdroppers. They offer advantages such as increased security in a range of quantum information protocols8,9,10,11,12, greater channel capacity for quantum communication13, novel fundamental tests of quantum mechanics14, and more efficient quantum gates15. In particular, hybrid qubit-qutrit system has been extensively studied and already experimentally realized16,17. The higher dimensional version of qubits provides deeper insights in the nature of quantum correlations and can be accessed by encoding qudits in the frequency modes of photon pairs produced by continuous parametric down-conversion.

In particular, the three-dimensional quantum states, qutrits are of special significance. For instance, in the state-independent experimental tests of quantum contextuality, three ground states of the trapped 171Yb+ ion are mapped to a qutrit system and quantum operations are carried out by applying microwaves resonant to the qutrit transition frequencies18. The solid-state system, nitrogen-vacancy center in diamond, can be also served as a qutrit system, in which the electronic spin can be individually addressed, optically polarized, manipulated and measured with optical and microwave excitation. Due to its long coherence time, it is one of the most promising solid state systems as quantum information processors.

In this paper we study the quantum information processing on qutrit systems. We generalize the results for qubit-systems7 to qutrit ones. The efficient quantum circuits in quantum computation with n qutrits are investigated in terms of the geometry of SU(3n). Three-qutrit systems are investigated in detail. Compared with the results for qubit systems7, our results are more fined, in the sense that by using enough one- and two-qutrit gates it is possible to synthesize a unitary operation with sufficient accuracy. While from7, it is not guaranteed that the error of the approximation would be arbitrary small.

Results

A quantum gate on n-qutrit states is a unitary operator U SU(3n) determined by time-dependent Hamiltonian H(t) according to the Schrödinger equation, For qutrit case the Hamiltonian H can be expanded in terms of the Gell-Mann matrices. As the algebra related to the n-qutrit space has rather different properties from the qubits case in which the evolved Pauli matrices have very nice algebraic relations, we first present some needed results about the algebra su(3n).

Let λi, i = 1, …, 8, denote the Gell-Mann matrices,

Let be an operator acting on the αth qutrit with λk and the rest qutrits with identity I. The basis of su(3n) is constituted by {Λs}, s = 1, …, n, where 1 ≤ α1 < α2 < … < αsn, 1 ≤ ki ≤ 8. Λs stands for all operators acting on s qutrits at sites α1, α2, …, αs with Gell-Mann matrices , , …, respectively, and the rest with identity. We call an element in {Λs} an s-body one. By using the commutation relations among the Gell-Mann matrices, it is not difficult to prove the following conclusion:

Lemma 1 All s-body items (s ≥ 3) in the basis of su(3n) can be generated by the Lie bracket products of 1-body and 2-body items.

In the following the operator norm of an operator A will be defined by which is equivalent to the operator norm given by <A, B> = tr AB. The norm of above Gell-Mann matrices satisfies ||λi|| = 1, i = 1, …, 7, and . If we replace λ8 with , the Gell-Mann matrices are then normal with respect to the definition of the operator norm, and the basis of su(3n), still denoted by {Λs}, is normalized.

A general unitary operator U SU(3n) on n-qutrit states can be expressed as U = U1U2Uk for some integer k. According to Lemma 1, every Ui acts non-trivially only on one or two vector components of a quantum state vector, corresponding to a Hamiltonian Hi containing only one and two-body items in {Λs}, s = 1, 2.

The time-dependent Hamiltonian H(t) can be expressed as where: (1) in the first sum , σ ranges over all possible one and two-body interactions; (2) in the second sum , σ ranges over all other more-body interactions; (3) the hσ are real coefficients. We define the measure of the cost of applying a particular Hamiltonian in synthesizing a desired unitary operation U, similar to the qubit case, where p is the penalty paid for applying three- and more-body items.

Eq. (3) gives rise to a natural notion of distance in the space SU(3n) of n-qutrit unitary operators with unit determinant. A curve [U] between the identity operation I and the desired operation U is a smooth function, The length of this curve is given by . As d([U]) is invariant with respect to different parameterizations of [U], one can always set F(H(t)) = 1 by rescaling H(t), and hence U is generated at the time tf = d([U]). The distance d(I, U) between I and U is defined by The function F(H) can be thought of as the norm associated to a right invariant Riemannian metric whose metric tensor g has components: These components are written with respect to a basis for local tangent space corresponding to the coefficients hσ. The distance d(I, U) is equal to the minimal length solution to the geodesic equation, 〈dH/dt, J〉 = iH, [H, J]〉. Here 〈·, ·〉 is the inner product on the tangent space su(3n) defined by the above metric components, and J is an arbitrary operator in su(3n).

From Lemma 1 in the basis {Λs} of su(3n), all the q-body items (q ≥ 3) can be generated by Lie bracket products of 1-body and 2-body items. To find the minimal length solution to the geodesic equation, it is reasonable to choose such metric (6), because the influence of there- and more-body items will be ignorable for sufficiently large p. It is the one- and two-body items that mainly contribute to the minimal geodesic.

We first project the Hamiltonian H(t) onto HP(t) which contains only one- and two-qutrit items. By choosing the penalty p large enough we can ensure that the error in this approximation is small. We then divide the evolution according to HP(t) into small time intervals and approximate with a constant mean Hamiltonian over each interval. We approximate evolution according to the constant mean Hamiltonian over each interval by a sequence of one- and two-qutrit quantum gates. We show that the total errors introduced by these approximations can be made arbitrarily smaller than any desired constant.

Let M be a connected manifold and a connection on a principal G-bundle. The Chow's theorem19 says that the tangent space Mq at any point q M can be divided into two parts, the horizontal space HqM and the vertical space VqM, where and ( denotes the Lie algebra of G). Let be a local frame of HqM. Then any two points on M can be joined by a horizontal curve if the iterated Lie brackets evaluated at q span the tangent space Mq.

Lemma 2 Let p be the penalty paid for applying three- and more-body items. If one chooses p to be sufficiently large, the distance d(I, U) always has a supremum which is independent of p.

Proof

As SU(3n) is a connected and complete manifold, the tangent space at the identity element I can be looked upon as the Lie algebra su(3n). For a given right invariant Riemannian metric (6), there exists a unique geodesic joining I and some point U SU(3n). With the increase of p, the distance d(I, U, p) of the geodesic joining I and U SU(3n) increases monotonically.

On the other hand, according to Lemma 1, 1-body and 2-body items in the basis {Λs} can span the whole space su(3n) in terms of the Lie bracket iterations. Under the metric Eq.(6), from the Chow's theorem we have that the horizontal curve joining I and U SU(3n) is unique, since the subspace spanned by 1-body and 2-body items is invariable. Or there exists such a geodesic that its initial tangent vector lies in the subspace spanned by 1-body and 2-body items. Hence the distance d(I, U, p) has a sup d0 which is independent of p.

Lemma 3 Let HP(t) be the projected Hamiltonian containing only one- and two-body items, obtained from a Hamiltonian H(t) generating a unitary operator U, and UP the corresponding unitary operator generated by HP(t). Then where || · || is the operator norm defined by (2), and p is the penalty parameter in (6).

Proof

Let U and V be unitary operators generated by the time-dependent Hamiltonians H(t) and J(t) respectively,

By integrating above two equations in the interval [0, T], we have where U(T) = U, V(T) = V and U(0) = V(0) = I have been taken into account.

Since we have

Using the triangle inequality and the unitarity of the operator norm || · ||, we obtain:

The Euclidean norm of the Hamiltonian is given by . From the Cauchy-Schwarz inequality, we have 1Moreover, if H contains only three- and more-body items, we have

Therefore which gives rise to (7).

Remark

From Lemma 3, by choosing p sufficiently large, say p = 9n, we can ensure that ||UUP|| ≤ d([U])/3n. Moreover, since the distance d(I, U) is defined by d(I, U) = minµ[U]d[U], Lemma 3 also implies that ||UUP|| ≤ d(I, U)/3n.

Lemma 4 If U is an n-qutrit unitary operator generated by H(t) satisfying ||H(t)|| ≤ c in a time interval [0, Δ], then where is the mean Hamiltonian.

Proof

Recall the Dyson series20:

We choose ti ≤ Δ/(i + 1) and set the first term in the above series to be I. Hence the second term is . We have where we have used the standard norm inequality ||XY|| ≤ ||X|| ||Y||, the condition ||H(t)|| ≤ c, and .

Proposition 1 If A and B are two unitary operators, then

Proof

We begin with N = 2. It is easy to verify that

Now suppose that this inequality holds for N − 1, N ≥ 3, i.e., ||AN−1BN−1|| ≤ (N − 1)||AB||. Then for N we have

Lemma 5 Suppose H is an n-qutrit one- and two-body Hamiltonian whose coefficients satisfy |hσ| ≤ 1. Then there is a unitary operator UA which satisfies and can be synthesized by using at most c1n2/Δ one- and two-tribit gates, where c1 and c2 are constants.

Proof

We need a modified version of the Trotter formula1: let A and B be Hermitian operators, then ei(A+Bt = eiAΔteiBΔt + Ot2). We divide the interval [0, Δ] into N = 1/Δ intervals of size Δ2. In every interval, we define a unitary operator

There are L = 32n2 − 24n = O(n2) one- and two-body items in H. From the modified Trotter formula, there exists a constant c2 such that

By using Proposition 1, we have

It means that one can approximate eiHΔ by using at most Nc1n2 = c1n2/Δ quantum gates for some constant c1.

From the above we have our main result:

Theorem 1 Using O(nKd(I, U)3) () one- and two-qutrit gates it is possible to synthesize a unitary UA satisfying ||UUA|| ≤ c, where c is any constant.

Theorem 1 shows that the optimal way of generating a unitary operator in SU(3n) is to go along the minimal geodesic curve connecting I and U. As an detailed example, we study the three-qutrit systems. In this case the right invariant Riemannian metric (6) turns out to be a more general one21, where , p is the penalty parameter and s is the parameter meaning that one-body Hamiltonians may be applied for free when it is very small, maps the three-qutrit Hamiltonian to the subspace containing only one-body items, to the subspace containing only two-body items, and to the subspace containing only three-body items. According to the properties of the Gell-Mann matrices, they satisfy , , .

Set , , and . From the geodesic equation , where , we have which gives rise to the solution where S(0) = S0, T(0) = T0 and Q(0) = Q0.

The corresponding Hamiltonian has the form: . According to the assumption 〈H(t), H(t)〉 = 1 for all time t, we have , , and . The term in H(t) is of order p−1/2, and hence can be neglected in the large p limit, with an error of order tp−1/2. Also the term containing p−1 in the exponentials of T can be neglected with an error at most of order t2(s1/2p−1 + p−1/2). Therefore one can define an approximate Hamiltonian

The corresponding solution of the Schrödinger equation satisfies

Denote . Then and . Thus we have

Generally one can expect that S0 + Q0 is much lager than T0, and S0 + Q0 is nondegenerate. can be simplified at the first-order perturbation, where denotes the diagonal matrix by removing all the off-diagonal entries from T0 in the eigenbasis of S0 + Q0. Therefore we see that it is possible to synthesize a unitary satisfying , where c is any constant, say c = 1/10.

Discussion

We have investigated the efficient quantum circuits in quantum computation with n qutrits in terms of Riemannian geometry. We have shown that the optimal quantum circuits are essentially equivalent to the shortest path between two points in a certain curved geometry of SU(3n), similar to the qubit case where the geodesic in SU(2n) is involved7. As an example, three-qutrit systems have been investigated in detail. Some algebraic derivations involved for qutrit systems are rather different from the ones in qubit systems. In particular, we used (2) as the norm of operators. The operator norm of M used in7 is defined by ||M||1 = maxψ|ψ〉 = 1{|〈ψ|M|ψ〉|}, which is not unitary invariant in the sense that ||M||1 = ||U M||1 = ||M U||1 is not always true for any unitary operator U. For instance, consider and . One has ||M||1 = 1/2. However, . Generally, from Cauchy-Schwarz inequality one has ||M||1 ≤ ||M||. If MM = I or M = M, then ||M||1 = ||M||.

Moreover, the final results we obtained are finer than the ones in7. Our result shows that if k in formula is taken to be sufficiently large, ||UUA|| can be sufficiently small. However, the approximation error estimation in7 reads

First, since d(I, U) is dependent of the penalty parameter p, there should exist a p-independent bound to guarantee that 2nd(I, U)/p is small for sufficiently large p. Second, if one chooses Δ as scale 1/n2d(I, U), the sum of the last two terms of the right hand side is 9/2 + c2/d(I, U) + O. Therefore the scale should be smaller, for example, 1/nkd(I, U) and k > 3. As Δ takes the scale of 1/n2d(I, U) in7, it can not guarantee that the error in the approximation could be arbitrary small.

Due to the special properties of the Pauli matrices involved in qubit systems, many derivations for qubit systems are different from the ones for qutrit systems. Nevertheless, the derivations for qutrit systems in this paper can be generalized to general high dimensional qudit systems.

Methods

In deriving Theorem 1, we use Lemmas 2-5. Let H(t) be the time-dependent normalized Hamiltonian generating the minimal geodesic of length d(I, U). Let HP(t) be the projected Hamiltonian which contains only the one- and two-body items in H(t) and generates UP. According to Lemma 3, they satisfy Divide the time interval [0, d(I, U)] into N parts with each of length Δ = d(I, U)/N. Let be the unitary operator generated by HP(t) in the jth time interval, and be the unitary operator generated by the mean Hamiltonian . Then using Lemma 4 and inequality we have As F(H) is scaled to be one, , one has . Hence where L = 32n2 – 24n is the number of one- and two-body items in H(t), i.e. the number of the terms in HP(t)).

Applying Lemma 5 to on every time interval, we have that there exists a unitary which can be synthesized by using at most c1n2/Δ one- and two-qutrit gates, and satisfies UP and UA can be generated in terms of and , respectively. We show how to generate UP by use of below. First, can be generated by : with . The unitary operator generated by satisfies which can be transformed into with , where is constant in [Δ, 2Δ]. At last we have generated by the Hamiltonians . UA can be generated similarly.

Therefore

From (10), (11) and (12) we obtain: where and c0 is a constant.

As mentioned in Lemma 2, the distance d(I, U) has a sup d0 for sufficiently large p. For example, we choose a suitable penalty p so that d(I, U, p) satisfies . If we choose Δ to be sufficiently small, e.g. with k sufficiently large, ||UUA|| will be sufficiently small, As we need c1n2/Δ one- and two-body gates to synthesize every , we ultimately need one- and two-body gates.

References

  1. 1.

    & Quantum computation and quantum information. (Cambridge University Press, Cambridge, 2000).

  2. 2.

    Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comp. 26, 1484 (1997).

  3. 3.

    Algorithms for quantum computation: discrete logarithms and factoring. Proceedings of 35th Annual Symposium on Fundamentals of Computer Science (IEEE Press, Los Alamitos), 124 (1994).

  4. 4.

    Quantum Mechanics Helps in Searching for a Needle in a Haystack. Phys. Rev. Lett. 79, 325 (1997).

  5. 5.

    , , & Optimal control, geometry, and quantum computing. Phys. Rev. A 73, 062323 (2006).

  6. 6.

    A geometric approach to quantum circuit lower bounds. Quant. Inform. Comput. 6, 213 (2006).

  7. 7.

    , , & Quantum Computation as Geometry. Science 311, 1133 (2006).

  8. 8.

    et al. Measuring Entangled Qutrits and Their Use for Quantum Bit Commitment. Phys. Rev. Lett. 93, 053601 (2004).

  9. 9.

    , , , & Triggered Qutrits for Quantum Communication Protocols. Phys. Rev. Lett. 92, 167903 (2004).

  10. 10.

    , , , & Experimental quantum cryptography with qutrits. New J. Phys. 8, 75 (2006).

  11. 11.

    & Optimal Eavesdropping in Cryptography with Three-Dimensional Quantum States. Phys. Rev. Lett. 88, 127901 (2002).

  12. 12.

    , , & Security of Quantum Key Distribution Using d-Level Systems. Phys. Rev. Lett. 88, 127902 (2002).

  13. 13.

    , , & Exceeding the Classical Capacity Limit in a Quantum Optical Channel. Phys. Rev. Lett. 90, 167906 (2003).

  14. 14.

    , , , & Bell Inequalities for Arbitrarily High-Dimensional Systems. Phys. Rev. Lett. 88, 040404 (2002).

  15. 15.

    , & Efficient Toffoli gates using qudits. Phys. Rev. A 75, 022313 (2007).

  16. 16.

    et al. Manipulating Biphotonic Qutrits. Phys. Rev. Lett. 100, 060504 (2008).

  17. 17.

    & Entanglement sudden death in qubitCqutrit systems. Phys. Lett. A 372, 579 (2008).

  18. 18.

    et al. State-Independent Experimental Test of Quantum Contextuality with a Single Trapped Ion. Phys. Rev. Lett. 110, 070401 (2013).

  19. 19.

    Chow's theorem and universal holonomic quantum computation. J. Phys. A 35, 5107 (2002).

  20. 20.

    Modern Quantum Mechanics. (Addison-Wesley Publishing Company, Inc, 1994).

  21. 21.

    & The Geometry of Quantum Computation. Quantum. Inform. Comput. 8, 0861-0899 (2008).

Download references

Acknowledgements

The work is supported by NSFC under number 11275131.

Author information

Affiliations

  1. School of Mathematical Sciences, Capital Normal University, Beijing 100037, P. R. China

    • Bin Li
    • , Zu-Huan Yu
    •  & Shao-Ming Fei
  2. School of Mathematics and Statistics, Northeast Normal University, Jilin, Changchun 130024, P. R. China

    • Bin Li

Authors

  1. Search for Bin Li in:

  2. Search for Zu-Huan Yu in:

  3. Search for Shao-Ming Fei in:

Contributions

B.L. and Z.H. and S.M. wrote the main manuscript text. All authors reviewed the manuscript.

Competing interests

The authors declare no competing financial interests.

Corresponding author

Correspondence to Shao-Ming Fei.

About this article

Publication history

Received

Accepted

Published

DOI

https://doi.org/10.1038/srep02594

Further reading

Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.