Criteria for Exact Qudit Universality

Published

May 1, 2005

Author(s)

G K. Brennen, Dianne M. O'Leary, Stephen Bullock

Abstract

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 of Mathukrishnanand Stroud describes how to exactly simulate an arbitrary unitary on multiple qudits using a 2d-1 parameter family of single qudit and two qudit gates. Their 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> 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>

Citation

Physical Review A (Atomic, Molecular and Optical Physics)

Volume

71

Pub Type

Journals

Keywords

quantum computation

Citation

Brennen, G. , O'Leary, D. and Bullock, S. (2005), Criteria for Exact Qudit Universality, Physical Review A (Atomic, Molecular and Optical Physics) (Accessed April 18, 2024)