HackerPapers

arXiv:quant-ph/9601018quant-ph

Approximate Quantum Fourier Transform and Decoherence

Adriano Barenco, Artur Ekert, Kalle-Antti Suominen, Päivi Törmä

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyse 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.

arXiv comments
14 pages, 10 fig. (8 *.eps files). More information on http://eve.physics.ox.ac.uk/QChome.html http://www.physics.helsinki.fi/~kasuomin http://www.physics.helsinki.fi/~kira/group.html
Journal reference
DOI
doi:10.1103/PhysRevA.54.139
Subjects
quant-phQuantum Physics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Nov 2025 to Nov 2025.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Keeping the Internet fast and secure: introducing Merkle Tree Certificates 1 comment

    • > The precision in phase needed to perform an accurate QFT scales EXPONENTIALLY with the number of qubits you're trying to transform. This is false. The gates that appear in the textbook QFT circuit (such as the one shown on wikipedia [1]) do mention angles that are…

      StrilancView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.