Normal subgroup reconstruction and quantum computation using group representations

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 627-635

  Hallgren, Sean ^a   Russell, Alexander ^b   Ta Shma, Amnon ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABELIAN GROUP; GRAPH ISOMORPHISM; GROUP REPRESENTATION; HIDDEN SUBGROUP PROBLEM; LOG ALGORITHMS; NATURAL GENERALIZATION; QUANTUM ALGORITHMS; SIMON'S ALGORITHM;

ALGORITHMS; QUANTUM COMPUTERS; QUANTUM THEORY; SET THEORY; GRAPH THEORY; PROBLEM SOLVING;

COMPUTATION THEORY; ALGORITHMS;

HIDDEN SUBGROUP PROBLEMS (HSP);

EID: 0033692053     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335392     Document Type: Conference Paper

References (17)

1. Noga Alon and Joel H. Spencer. The Probabilistic Method. John Wiley & Sons, Inc., 1992.
2. Robert Beals. Quantum computation of Fourier transforms over symmetric groups. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 48-53, El Paso, Texas, 4-6 May 1997.
3. Dan Boneh and Richard J. Lipton. Quantum cryptanalysis of hidden linear functions (extended abstract). In Don Coppersmith, editor, Advances in Cryptology - CRYPTO '95, volume 963 of Lecture Notes in Computer Science, pages 424-437. Springer-Verlag, 27-31 August 1995.
4. Persi Diaconis and Daniel Rockmore. Efficient computation of the Fourier transform on finite groups. J. Amer. Math. Soc., 3(2):297-332, 1990.
5. Mark Ettinger and Peter Høyer. On quantum algorithms for noncommutative hidden subgroups. In Symposium on Theoretical Aspects in Computer Science, University of Trier, 4-6 March 1999.
6. Mark Ettinger and Peter Høyer. Quantum state detection via elimination. Technical report, quant-ph/9905099, 1999.
7. Mark Ettinger and Peter Høyer. A quantum observable for the graph isomorphism problem. Technical report, quant-ph/9901029, 1999.
8. Mark Ettinger and Peter Høyer and Emanuel Knill. Hidden subgroup states are almost orthogonal. Technical report, quant-ph/9901034, 1999.
9. M. Goldmann and A. Russell. The computational complexity of solving systems of equations over finite groups. In Fourteenth Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, 4-6 May 1999.
10. Michaelangelo Grigni, Leonard Schulman, and Umesh Vazirani. Unpublished, 1997.
11. Lisa Hales and Sean Hallgren. Quantum fourier sampling simplified. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 330-338, Atlanta, Georgia, 1-4 May 1999.
12. Joe Harris and William Fulton. Representation Theory. Number 129 in Graduate Texts in Mathematics. Springer-Verlag, New York, NY, 1991.
13. Alexey Yu. Kitaev. Quantum measurements and the abelian stabilizer problem. Technical report, quant-ph/9511026, 1995.
14. Johannes Köbler, Uwe Schöning, and Jacobo Torán. The graph isomorphism problem: its structural complexity. Birkhäuser Boston Inc., Boston, MA, 1993.
15. Martin Rötteler and Thomas Beth. Polynomial-time solution to the hidden subgroup problem for a class of non-abelian groups. Technical report, quant-ph/9812070, 1998.
16. Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, October 1997.
17. Daniel R. Simon. On the power of quantum computation. SIAM Journal on Computing, 26(5):1474-1483, October 1997.