Physics – Quantum Physics
Scientific paper
2002-11-21
Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 489-498 (2003)
Physics
Quantum Physics
12 pages, 2 figures, requires amsmath, amssymb, graphicx, psfrag and theorem packages. To appear in the proceedings of the ACM
Scientific paper
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodicity. The fact that Fourier transforms can also be used to capture shift structure has received far less attention in the context of quantum computation. In this paper, we present three examples of ``unknown shift'' problems that can be solved efficiently on a quantum computer using the quantum Fourier transform. We also define the hidden coset problem, which generalizes the hidden shift problem and the hidden subgroup problem. This framework provides a unified way of viewing the ability of the Fourier transform to capture subgroup and shift structure.
Dam Wim van
Hallgren Sean
Ip Lawrence
No associations
LandOfFree
Quantum Algorithms for some Hidden Shift Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quantum Algorithms for some Hidden Shift Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Algorithms for some Hidden Shift Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-162533