@article {15785,
title = {Parallelism for quantum computation with qudits},
journal = {Physical Review APhys. Rev. A},
volume = {74},
year = {2006},
month = {2006///},
pages = {032334 - 032334},
abstract = {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 (time) 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 alkali-metal atoms 87Rb and 133Cs. Second, we provide a protocol for implementing parallelized nonlocal two-qudit gates using the assistance of entangled qubit pairs. Using known protocols for qubit entanglement purification, this offers the possibility of high-fidelity two-qudit gates.},
doi = {10.1103/PhysRevA.74.032334},
url = {http://link.aps.org/doi/10.1103/PhysRevA.74.032334},
author = {O{\textquoteright}Leary,Dianne P. and Brennen,Gavin K. and Bullock,Stephen S.}
}