Parallelism for quantum computation with qudits

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 {sup 87}Rb and {sup 133}Cs. 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.

[1]  C. Monroe,et al.  Experimental entanglement of four particles , 2000, Nature.

[2]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[3]  W Dür,et al.  Entanglement purification for quantum computation. , 2003, Physical review letters.

[4]  Xin He,et al.  Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs , 1988, J. Algorithms.

[5]  Dianne P. O'Leary,et al.  Criteria for exact qudit universality , 2004, quant-ph/0407223.

[6]  Martin Nilsson,et al.  Parallel Quantum Computation and Quantum Codes , 2001, SIAM J. Comput..

[7]  Jr.,et al.  Multivalued logic gates for quantum computation , 2000, quant-ph/0002033.

[8]  D. Gottesman.  Fault-Tolerant Quantum Computation with Higher-Dimensional Systems , 1998, quant-ph/9802007.

[9]  Frederic T. Chong,et al.  A Practical Architecture for Reliable Quantum Computers , 2002, Computer.

[10]  G. Stewart,et al.  Assignment and scheduling in parallel matrix factorization , 1986 .

[11]  I. H. Deutsch,et al.  Quantum state control in optical lattices , 1998 .

[12]  J. Preskill.  Reliable quantum computers , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[13]  Deutsch,et al.  Mesoscopic quantum coherence in an optical lattice , 2000, Physical review letters.

[14]  Isaac L. Chuang,et al.  Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations , 1999, Nature.

[15]  I. Stravinsky,et al.  Gestural Control of Real-Time Concatenative Synthesis in Luna Park Grégory Beller Computer Music , 2011 .

[16]  C. Monroe,et al.  Quantum information processing with atoms and photons , 2002, Nature.

[17]  Domenico D'Alessandro,et al.  The Lie algebra structure and controllability of spin systems , 2002 .

[18]  Andrew G. Glen,et al.  APPL , 2001 .

[19]  D. O’Leary,et al.  Asymptotically optimal quantum circuits for d-level systems. , 2004, Physical review letters.

[20]  J. Eisert,et al.  Optimal local implementation of nonlocal quantum gates , 2000 .