(Enter summary)
Abstract: We isolate and generalize a technique implicit in many
quantum algorithms, including Shor's algorithms for
factoring and discrete log. In particular, we show that
the distribution sampled after a Fourier transform over
Z p can be eciently approximated by transforming over
Z q for any q in a large range. Our result places no restrictions
on the superposition to be transformed, generalizing
previous applications. In addition, our proof
easily generalizes to multi-dimensional transforms for
any... (Update)
Context of citations to this paper: More
...group is not even known. Boneh and Lipton [3] handle a case when a periodic function is not fixed on a coset. Hales and Hallgren [11, 12] generalize the results for the case when the underlying Abelian group is unknown, but an estimate is known for the cardinality of its...
Cited by: More
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John
(Correct)
On Statistical Query Sampling and NMR Quantum Computing - Blum, Yang
(Correct)
The Hidden Subgroup Problem and Quantum Computation Using.. - Hallgren, Russell
(Correct)
Active bibliography (related documents): More All
0.2: Simulating Physics with Computers - Feynman (1982)
(Correct)
0.2: Exact quantum Fourier transforms and discrete logarithm.. - Mosca, Zalka (2003)
(Correct)
0.2: Quantum Computation and Shor's Factoring Algorithm - de Wolf (1999)
(Correct)
Similar documents based on text: More All
0.5: Quantum Algorithms for some Hidden Shift Problems - van Dam, Hallgren, Ip (2003)
(Correct)
0.4: Some More Quantum Communication Complexity - Quantum Computing Course
(Correct)
0.3: A Quantum Fourier Transform Algorithm - Lomont (2004)
(Correct)
Related documents from co-citation: More All
8: Polynomial-time algorithms for prime factorization and discrete logarithms on a ..
- Shor - 1995
6: Quantum cryptanalysis of hidden linear functions (context) - Dan, Lipton - 1995
6: Algorithms for quantum computation: Discrete logarithms and factoring
- Shor - 1994
BibTeX entry: (Update)
L. Hales and S. Hallgren. Quantum Fourier sampling simplified. In Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, pages 330--338, 1999. http://citeseer.ist.psu.edu/hales99quantum.html More
@inproceedings{ hales99quantum,
author = "Lisa Hales and Sean Hallgren",
title = "Quantum {Fourier} sampling simplified",
pages = "330--338",
year = "1999",
url = "citeseer.ist.psu.edu/hales99quantum.html" }
Citations (may not include all citations):
173
Quantum complexity theory
- Bernstein, Vazirani - 1997
144
the power of quantum computation
- Simon - 1994
45
Polynomial-time algorithms for prime factorization and discr.. (context) - Shor - 1997
35
Quantum cryptanalysis of hidden linear functions (context) - Boneh, Lipton - 1995
25
Quantum measurements and the abelian stabilizer problem
- Yu - 1995
23
On quantum algorithms for noncommutative hidden subgroups
- Ettinger, yer - 1999
20
Quantum computation of Fourier transforms over symmetric gro.. (context) - Beals - 1997
13
Generalized FFTS - A Survey of Some Recent Results
- Maslen, Rockmore - 1996
5
A note on computing fourier transforms by quantum programs (context) - Cleve - 1994
1
Appriximate quantum Fourier transform and decoherence (context) - Barenco, Ekert et al. - 1996
Documents on the same site (http://www.cs.berkeley.edu/~hallgren/):
Normal Subgroup Reconstruction and Quantum Computation.. - Hallgren, Russell, al. (2000)
(Correct)
An Improved Quantum Fourier Transform Algorithm and Applications - Hales, Hallgren (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC