Quantum Fourier sampling simplified

Lisa Hales, Sean Hallgren

Research output: Contribution to journalArticle

14 Citations (Scopus)

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 Zp can be efficiently approximated by transforming over Zq 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 constant number of dimensions.

Original languageEnglish (US)
Pages (from-to)330-338
Number of pages9
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
StatePublished - 1999

Fingerprint

Sampling
Fourier transforms

All Science Journal Classification (ASJC) codes

  • Software

Cite this

@article{c2c9eccc520947a5a600f3e985d3498e,
title = "Quantum Fourier sampling simplified",
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 Zp can be efficiently approximated by transforming over Zq 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 constant number of dimensions.",
author = "Lisa Hales and Sean Hallgren",
year = "1999",
language = "English (US)",
pages = "330--338",
journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
issn = "0734-9025",
publisher = "Association for Computing Machinery (ACM)",

}

Quantum Fourier sampling simplified. / Hales, Lisa; Hallgren, Sean.

In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 1999, p. 330-338.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Quantum Fourier sampling simplified

AU - Hales, Lisa

AU - Hallgren, Sean

PY - 1999

Y1 - 1999

N2 - 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 Zp can be efficiently approximated by transforming over Zq 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 constant number of dimensions.

AB - 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 Zp can be efficiently approximated by transforming over Zq 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 constant number of dimensions.

UR - http://www.scopus.com/inward/record.url?scp=0032686325&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032686325&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0032686325

SP - 330

EP - 338

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

SN - 0734-9025

ER -