We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states ͉0͘, ͉1͘, …, ͉d −1͘. An important earlier work ͓A. Muthukrishnan and C.R. Stroud, Jr., Phys. Rev. A 62, 052309 ͑2000͔͒ describes how to exactly simulate an arbitrary unitary on multiple qudits using a 2d − 1 parameter family of single qudit and two qudit gates. That technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the QR-matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of H jk x = ប⍀͉͑k͗͘j͉ + ͉j͗͘k͉͒ and H jk y = ប⍀͑i͉k͗͘j͉ − i͉j͗͘k͉͒. A coupling graph results taking nodes 0, …, d − 1 and edges j ↔ k iff H jk x,y are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian H = ប⍀͉d −1,d −1͗͘d −1,d −1͉ is also allowed. We discuss implementation in the eight dimensional ground electronic states of 87 Rb and construct an optimal gate sequence using Raman laser pulses.
A discrete set of single qudit gates and a single two qudit gate is used in REF to synthesize the large unitary matrix using QR decomposition.
Criteria for exact qudit universality
Physical Review A 71, 052318 (2005).
Physics