Warp-Drive Quantum Computation
| dc.creator | Nakahara, Mikio | |
| dc.creator | Vartiainen, Juha J. | |
| dc.creator | Kondo, Yasushi | |
| dc.creator | Tanimura, Shogo | |
| dc.creator | Hata, Kazuya | |
| dc.date | 2004-11-20 | |
| dc.date | 2004-12-02 | |
| dc.date.accessioned | 2026-07-07T06:11:35Z | |
| dc.date.available | 2026-07-07T06:11:35Z | |
| dc.description | Recently it has been shown that time-optimal quantum computation is attained by using the Cartan decomposition of a unitary matrix. We extend this approach by noting that the unitary group is compact. This allows us to reduce the execution time of a quantum algorithm $U_{\rm alg}$ further by adding an extra gate $W$ to it. This gate $W$ sends $U_{\rm alg}$ to another algorithm $WU_{\rm alg}$ which is executable in a shorter time than $U_{\rm alg}$. We call this technique warp-drive. Here we show both theoretically and experimentally that the execution time of Grover's algorithm is reduced in two-qubit NMR quantum computer. Warp-drive is potentially a powerful tool in accelerating algorithms and reducing the errors in any realization. of a quantum computer | |
| dc.description | 4 pages, 2 figures, and 1 table | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0411153 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0411153 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/92525 | |
| dc.subject | Quantum Physics | |
| dc.title | Warp-Drive Quantum Computation | |
| dc.type | text |