Quantum Fourier sampling simplified

Quantum Fourier sampling simplified,10.1145/301250.301336,Lisa Hales,Sean Hallgren

Quantum Fourier sampling simplified   (Citations: 26)
BibTex | RIS | RefWorks Download
We isolate and generalize a technique implicit in manyquantum algorithms, including Shor's algorithms forfactoring and discrete log. In particular, we show thatthe distribution sampled after a Fourier transform overZ p can be eciently approximated by transforming overZ q for any q in a large range. Our result places no restrictionson the superposition to be transformed, generalizingprevious applications. In addition, our proofeasily generalizes to multi-dimensional transforms forany...
Conference: ACM Symposium on Theory of Computing - STOC , pp. 330-338, 1999
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: