On the power of random bases in fourier sampling: Hidden subgroup problem in the Heisenberg group

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1399-1411

  Radhakrishnan, Jaikumar ^a,b   Rötteler, Martin ^c   Sen, Pranab ^c  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; POLYNOMIALS; PROBLEM SOLVING; QUANTUM THEORY; RANDOM PROCESSES;

FOURIER SAMPLING; HIDDEN SUBGROUP PROBLEM (HSP); QUANTUM COMPUTING;

FOURIER TRANSFORMS;

EID: 26444514403     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_113     Document Type: Conference Paper

References (20)

1. [AS00] N. Alon and J. Spencer. The probabilistic method. John Wiley and Sons, 2000.
2. [BCvD05] D. Bacon, A. Childs, and W. van Dam. From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. ArXiv preprint quant-ph/0504083, 2005.
3. [CR62] W. C. Curtis and I. Reiner. Representation Theory of Finite Groups and Algebras. Wiley and Sons, 1962.
4. [EHK04] M. Ettinger, P. Høyer, and E. Knill. The quantum query complexity of the hidden subgroup problem is polynomial. Information Processing Letters, 91(1):43-48, 2004. See also ArXiv preprint quant-ph/0401083.
5. [Eme04] J. Emerson. Random quantum circuits and pseudo-random operators: theory and applications. ArXiv preprint quant-ph/0410087, 2004.
6. +03] J. Emerson, Y. Weinstein, M. Saraceno, S. Lloyd, and D. Cory. Pseudo-Random unitary operators for quantum information processing. Science, 302:2098-2100, 2003.
7. +03] K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen. Hidden translation and orbit coset in quantum computing. In Proceedings of the Symposium on Theory of Computing (STOC), pages 1-9, 2003.
8. [Gav04] D. Gavinsky. Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups. Quantum Information and Computation, 4(3):229-235, 2004.
9. [GSVV04] M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. Combinatorica, pages 137-154, 2004.
10. [HRTS03] S. Hallgren, A. Russell, and A. Ta-Shma. The Hidden Subgroup Problem and Quantum Computation Using Group Representations. SIAM Journal on Computing, 32(4):916-934, 2003.
11. [IMS03] G. Ivanyos, F. Magniez, and M. Santha. Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. International Journal of Foundations of Computer Science, pages 723-740, 2003.
12. [Ip03] L. Ip. Shor's algorithm is optimal. Unpublished manuscript, 2003.
13. [Kup03] G. Kuperberg. A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. ArXiv preprint quant-ph/0302112, 2003.
14. [LN94] R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, 2nd edition, 1994.
15. [Mat02] J. Matoušek. Lectures on Discrete Geometry. Graduate Texts in Mathematics. Springer-Verlag, 2002.
16. [MR05] C. Moore and A. Russell. For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets. ArXiv preprint quant-ph/0501177, 2005.
17. [MRRS04] C. Moore, D. Rockmore, A. Russell, and L. Schulman. The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), pages 1113-1122, 2004. ArXiv preprint quant-ph/0503095.
18. [MRS05] C. Moore, A. Russell, and L. Schulman. The symmetric group defies strong Fourier sampling: Part I. ArXiv preprint quant-ph/0501056, 2005.
19. [Ser77] J. P. Serre. Linear Representations of Finite Groups. Springer, 1977.
20. [WF89] W. Wootters and B. Fields. Optimal state-determination by mutually unbiased measurements. Ann. Physics, 191(2):363-381, 1989.