Approximate quantum Fourier transform and decoherence

Adriano Barenco, Artur Ekert, Kalle-Antti Suominen, and Päivi Törmä
Phys. Rev. A 54, 139 – Published 1 July 1996
PDFExport Citation

Abstract

We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyze quantum networks performing AQFT in the presence of decoherence and show that extensive approximations can be made before the accuracy of AQFT (as compared with regular quantum Fourier transform) is compromised. We show that for some computations an approximation may imply a better performance. © 1996 The American Physical Society.

  • Received 17 January 1996

DOI:https://doi.org/10.1103/PhysRevA.54.139

©1996 American Physical Society

Authors & Affiliations

Adriano Barenco and Artur Ekert

  • Clarendon Laboratory, Department of Physics, University of Oxford, Parks Road, OX1 3PU Oxford, United Kingdom

Kalle-Antti Suominen

  • Theoretical Physics Division, Department of Physics, University of Helsinki, PL 9, 00014 Helsingin yliopisto, Finland

Päivi Törmä

  • Research Institute for Theoretical Physics, University of Helsinki, PL 9, 00014 Helsingin yliopisto, Finland

References (Subscription Required)

Click to Expand
Issue

Vol. 54, Iss. 1 — July 1996

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×