Hidden translation and Orbit Coset in quantum computing

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 1-9

  Friedl, Katalin ^a   Ivanyos, Gábor ^a   Magniez, Frédéric ^b   Santha, Miklos ^b   Sen, Pranab ^c  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b CNRS   (France)

^c UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Algorithms

Indexed keywords

ALGORITHMS; COMPUTER AIDED LANGUAGE TRANSLATION; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

QUANTUM COMPUTING;

QUANTUM THEORY;

EID: 0037770162     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780544     Document Type: Conference Paper

References (23)

1. D. Aharonov. Quantum computation - A review. In Annual Review of Computational Physics, volume VI. World Scientific, 1998.
2. D. Aharonov and A. Ta-Shma. Adiabatic quantum state generation and statistical zero knowledge. These proceedings.
3. L. Babai, G. Cooperman, L. Finkelstein, E. Luks, and A. Seress. Fast Monte Carlo algorithms for permutation groups. J. Comput. System Sci., 50:296-307, 1995.
4. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Phys. Rev. Lett., 87(16), 2001. Article 167902.
5. R. Beals. Quantum computation of Fourier transforms over symmetric groups. In Proc. 29th ACM STOC, pages 48-53, 1997.
6. L. Babai and E. Szemerédi. On the complexity of matrix group problems I. In Proc. 25th FOCS, pages 229-240, 1984.
7. K. Cheung and M. Mosca. Decomposing finite abelian groups. J. Quantum Inf. Comp., 1(3), 2001.
8. W. van Dam, S. Hallgren, and L. Ip. Quantum algorithms for some hidden shift problems. In Proc. 14th ACM-SIAM SODA, 2003.
9. M. Ettinger and P. Høyer. On quantum algorithms for noncommutative hidden subgroups. Adv. in Appl. Math., 25(3):239-251, 2000.
10. D. Gottesman and I. Chuang. Quantum digital signatures. Technical report, Quantum Physics e-Print archive, 2001. http://xxx.lanl.gov/abs/quant-ph/0105032.
11. M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani. Quantum mechanical algorithms for the nonabelian Hidden subgroup Problem. In Proc. 33rd ACM STOC, pages 68-74, 2001.
12. S. Hallgren, A. Russell, and A. Ta-Shma. Normal subgroup reconstruction and quantum computation using group representations. In Proc. 32nd ACM STOC, pages 627-635, 2000.
13. G. Ivanyos, F. Magniez, and M. Santha. Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. In Proc. 13th ACM SPAA, pages 263-270, 2001.
14. A. Kitaev. Quantum measurements and the Abelian Stabilizer Problem. Technical report, Quantum Physics e-Print archive, 1995. http://xxx.lanl.gov/abs/quant-ph/9511026.
15. A. Kitaev. Classical and Quantum Computation. Graduate Studies in Mathematics, vol. 47, American Mathematical Society, 2002.
16. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
17. M. Püschel, M. Rötteler, and T. Beth. Fast quantum Fourier transforms for a class of non-Abelian groups. In Proc. 13th AAECC, volume 1719, pages 148-159. LNCS, 1999.
18. J. Preskill. Quantum information and computation. http://www.theory.caltech.edu/people/preskill/ph229, 1998.
19. M. Rötteler and T. Beth. Polynomial-time solution to the Hidden Subgroup Problem for a class of non-abelian groups. Technical report, Quantum Physics e-Print archive, 1998. http://xxx.lanl.gov/abs/quant-ph/9812070.
20. P. Shor. Algorithms for quantum computation: Discrete logarithm and factoring. SIAM J. Comp., 26(5):1484-1509, 1997.
21. D. Simon. On the power of quantum computation. SIAM J. Comp., 26(5):1474-1483, 1997.
22. M. Sudan. Notes on algebra. Lecture 2.5 of the course Algorithmic Introduction to Coding Theory. Course notes at http://theory.lcs.mit.edu/̃madhu/FT01.
23. J. Watrous. Quantum algorithms for solvable groups. In Proc. 33rd ACM STOC, pages 60-67, 2001.