Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Parallelism for Quantum Computation with Qudits



Dianne M. O'Leary


Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well known that any single-qudit unitary can be decomposed into a sequence of Givens rotations on two-dimensional subspaces of the qudit state space. Using a coupling graph to represent physically allowed couplings between pairs of qudit states, we then show that the logical depth of the parallel gate sequence is equal to the height of an associated tree. The implementation of a given unitary can then optimize the tradeoff between gate time and resources used. These ideas are illustrated for qudits encoded in the ground hyperfine states of the atomic alkalies 87-Rb and 133-Cs. Second, we provide a protocol for implementing parallelized non-local two-qudit gates using the assistance of entangled qubit pairs. Because the entangled qubits can be prepared non-deterministically, this offers the possibility of high fidelity two-qudit gates.
Physical Review A (Atomic, Molecular and Optical Physics)


quantum computing, qudit, universal quantum computation


O'Leary, D. (2006), Parallelism for Quantum Computation with Qudits, Physical Review A (Atomic, Molecular and Optical Physics), [online], (Accessed July 22, 2024)


If you have any questions about this publication or are having problems accessing it, please contact

Created March 31, 2006, Updated January 27, 2020