Efficient decomposition of quantum gates
| dc.creator | Vartiainen, Juha J. | |
| dc.creator | Mottonen, Mikko | |
| dc.creator | Salomaa, Martti M. | |
| dc.date | 2003-12-30 | |
| dc.date | 2004-04-15 | |
| dc.date.accessioned | 2026-07-07T07:50:31Z | |
| dc.date.available | 2026-07-07T07:50:31Z | |
| dc.description | Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit which is optimal in the sense of fully controlled single-qubit gates and yet is equivalent with the multiqubit gate. In the second step of the optimization, superfluous control bits are eliminated, which eventually results in a smaller total number of the elementary gates. In our scheme the number of controlled NOT gates is $O(4^n)$ which coincides with the theoretical lower bound. | |
| dc.description | 4 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0312218 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0312218 | |
| dc.identifier | Phys. Rev. Lett. 92 177902 (2004) | |
| dc.identifier | doi:10.1103/PhysRevLett.92.177902 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/125186 | |
| dc.subject | Quantum Physics | |
| dc.title | Efficient decomposition of quantum gates | |
| dc.type | text |