Quantum algorithms without initializing the auxiliary qubits
| dc.creator | Chi, Dong Pyo | |
| dc.creator | Kim, Jeong San | |
| dc.creator | Lee, Soojoon | |
| dc.date | 2005-04-25 | |
| dc.date | 2005-07-08 | |
| dc.date.accessioned | 2026-07-07T06:12:39Z | |
| dc.date.available | 2026-07-07T06:12:39Z | |
| dc.description | In this Letter, we construct the quantum algorithms for the Simon problem and the period-finding problem, which do not require initializing the auxiliary qubits involved in the process of functional evaluation but are as efficient as the original algorithms. In these quantum algorithms, one can use any arbitrarily mixed state as the auxiliary qubits, and furthermore can recover the state of the auxiliary qubits to the original one after completing the computations. Since the recovered state can be employed in any other computations, we obtain that a single preparation of the auxiliary qubits in an arbitrarily mixed state is sufficient to implement the iterative procedure in the Simon algorithm or the period-finding algorithm. | |
| dc.description | 4 pages, typos corrected, references added, accepted for publication in Physical Review Letters | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0504173 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0504173 | |
| dc.identifier | Phys. Rev. Lett. 95, 080504 (2005) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/92849 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum algorithms without initializing the auxiliary qubits | |
| dc.type | text |