Efficient Circuits for Exact-Universal Computations with Qudits
| dc.creator | Brennen, Gavin K. | |
| dc.creator | Bullock, Stephen S. | |
| dc.creator | O'Leary, Dianne P. | |
| dc.date | 2005-09-22 | |
| dc.date.accessioned | 2026-07-07T06:30:29Z | |
| dc.date.available | 2026-07-07T06:30:29Z | |
| dc.description | This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, CINC, is exact-universal. A recent paper (PRL 94 230502) describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state synthesis circuit in much greater detail and prove that it is correct. Also, the (n-2)/(d-2) ancillas required in the original algorithm may be removed without changing the asymptotics. Further, we present a new algorithm for unitary synthesis, inspired by the QR matrix decomposition, which is also asymptotically optimal. | |
| dc.description | 16 pages, 3 figures, 2 tables | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0509161 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0509161 | |
| dc.identifier | Quantum Information and Computation, Vol. 6, 436 (2006) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/98351 | |
| dc.subject | Quantum Physics | |
| dc.title | Efficient Circuits for Exact-Universal Computations with Qudits | |
| dc.type | text |