|
| related topics |
| {algorithm, log, probability} |
| {qubit, qubits, gate} |
| {cos, sin, state} |
| {classical, space, random} |
| {phase, path, phys} |
|
Improved Bounds for the Approximate QFT
Donny Cheung
abstract: It has previously been established that the logarithmic-depth approximate
quantum Fourier transform (AQFT) provides a suitable replacement for the
regular QFT in many quantum algorithms. Since the AQFT is less accurate by
definition, polynomially many more applications of the AQFT are required to
achieve the original accuracy. However, in many quantum algorithms, the smaller
size of the AQFT circuit yields a net improvement over using the QFT.
This paper presents a more thorough analysis of the AQFT circuit, which leads
to the surprising conclusion that for sufficiently large input sizes, the
difference between the QFT and the logarithmic-depth AQFT is negligible. In
effect, the AQFT can be used as an direct replacement for the QFT, yielding
improvements in any application which does not require exact quantum
computation.
- oai_identifier:
- oai:arXiv.org:quant-ph/0403071
- categories:
- quant-ph
- comments:
- 6 pages, 3 figures
- arxiv_id:
- quant-ph/0403071
- journal_ref:
- Proc. of the Winter Intl Symposium of Information and
Communication Technologies (WISICT 2004), pp. 192-197
- created:
- 2004-03-09
Full article ▸
|
|
| related documents |
| 0609160v1 |
| 0207108v1 |
| 0303074v1 |
| 0508156v3 |
| 0208112v1 |
| 0209148v1 |
| 9812057v1 |
| 0206066v1 |
| 0308016v1 |
| 0401067v2 |
| 0612052v2 |
| 0608156v1 |
| 0304174v1 |
| 0403160v1 |
| 0609166v1 |
| 0406104v1 |
| 0610258v1 |
| 0701079v1 |
| 0507262v1 |
| 0703193v2 |
| 0612033v1 |
| 0606242v3 |
| 0507024v1 |
| 0502144v1 |
| 0406146v1 |
|