Quantum Fourier sampling simplified

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Quantum Fourier sampling simplified

Full text

Pdf (552 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-first annual ACM symposium on Theory of computing table of contents

Atlanta, Georgia, United States

Pages: 330 - 338

Year of Publication: 1999

ISBN:1-58113-067-8

Authors

Lisa Hales	Group in Logic and the Methodology of Science, University of California at Berkeley
Sean Hallgren	Computer Science Division, University of California at Berkeley

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 35, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/301250.301336 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Bea97	Robert Beals, Quantum computation of Fourier transforms over symmetric groups, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.48-53, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258548]
	BEST96	Adriano Barenco, Artur K. Ekert, Kalle- Antti Suominen, and P/iivi TSrm~. Appriximate quantum Fourier transform and decoherence. Submitted to Physical Review A, January 1996.
	BL95	Dan Boneh , Richard J. Lipton, Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract), Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, p.424-437, August 27-31, 1995
	BV97	Ethan Bernstein , Umesh Vazirani, Quantum Complexity Theory, SIAM Journal on Computing, v.26 n.5, p.1411-1473, Oct. 1997 [doi>10.1137/S0097539796300921]
	Cle94	Richard Cleve. A note on computing fourier transforms by quantum programs. 1994.
	Cop94	D. Coppersmith. An approximate fourier transform useful in quantum factoring. Technical Report RC19642, IBM, 1994.
	EH99	Mark Ettinger and Peter Hoyer. On quantum algorithms for noncommutative hidden subgroups. In Symposium o~ Theoretical Aspects in Computer Science, University of Trier, 4-6 March t999.
	Kit95	Alexey Yu. Kitaev. Quantum measurements and the abelian stabilizer problem. 1995.
	MR96	David K. Maslen , Daniel N. Rockmore, Generalized FFTS - A Survey of Some Recent Results, Dartmouth College, Hanover, NH, 1996
	Sho97	Peter W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, v.26 n.5, p.1484-1509, Oct. 1997 [doi>10.1137/S0097539795293172]
	Sim94	Daniel R. Simon. On the power of quantum computation. In 35th Annual Symposium on Foundations of Computer Science, pages 116-123, Santa Fe, New Mexico, 20- 22 November 1994. I EEE.

CITED BY 4

	Sean Hallgren , Alexander Russell , Amnon Ta-Shma, Normal subgroup reconstruction and quantum computation using group representations, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.627-635, May 21-23, 2000, Portland, Oregon, United States
	Cristopher Moore , Daniel Rockmore , Alexander Russell , Leonard J. Schulman, The power of basis selection in fourier sampling: hidden subgroup problems in affine groups, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, January 11-14, 2004, New Orleans, Louisiana
	Umesh Vazirani, Fourier transforms and quantum computation, Theoretical aspects of computer science: advanced lectures, Springer-Verlag New York, Inc., New York, NY, 2002
	Sean Hallgren, Fast quantum algorithms for computing the unit group and class group of a number field, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA