We develop a multivalued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we establish that arbitrary unitary operations on any number of d-level systems $(d>2)$ can be decomposed into logic gates that operate on only two systems at a time. We show that such multivalued logic gates are experimentally feasible in the context of the linear ion trap scheme for quantum computing. By using d levels in each ion in this scheme, we reduce the number of ions needed for a computation by a factor of ${\mathrm{log}}_{2}d.$ We develop a multivalued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we establish that arbitrary unitary operations on any number of d-level systems $(d>2)$ can be decomposed into logic gates that operate on only two systems at a time. We show that such multivalued logic gates are experimentally feasible in the context of the linear ion trap scheme for quantum computing. By using d levels in each ion in this scheme, we reduce the number of ions needed for a computation by a factor of ${\mathrm{log}}_{2}d.$

arXiv:quant-ph/0002033Physical Review AOct 16, 2000398 citations

Implementation of Quantum Logic Gates Using Trapped Ions

Christopher R. Monroe

APSNov 1, 20010 citations

Quantum gates and quantum computation with trapped ions

J. I. Cirac, P. Zoller, Juan F. Poyatos

Springer eBooksJun 1, 20012 citations

(d>2)

can be decomposed into logic gates that operate on only two systems at a time. We show that such multivalued logic gates are experimentally feasible in the context of the linear ion trap scheme for quantum computing. By using d levels in each ion in this scheme, we reduce the number of ions needed for a computation by a factor of

{\mathrm{log}}_{2}d.