Quantum complexity of testing group commutativity

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1312-1324

  Magniez, Frédéric ^a   Nayak, Ashwin ^b  

^a CNRS   (France)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; QUANTUM THEORY;

BLACK-BOX GROUPS; QUANTUM COMPLEXITY; RANDOMIZED MODELS;

COMPUTER SCIENCE;

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

References (20)

1. Grover, L.: A fast quantum mechanical algorithm for database search. In: Proc. of 28th ACM STOC. (1996) 212-219
2. Mosca, M.: Quantum Computer Algorithms. PhD thesis, Univ. of Oxford (1999)
3. Beals, R., Buhrman, H., Cleve, R., Mosca, M., Wolf, R.: Quantum lower bounds by polynomials. J. of the ACM 48 (2001) 778-797
4. Babai, L., Szemerédi, E.: On the complexity of matrix group problems I. In: Proc. of 25th IEEE FOCS. (1984) 229-240
5. Watrous, J.: Quantum algorithms for solvable groups. In: Proceedings of 33rd Symposium on Theory of Computing, ACM (2001) 60-67
6. Pak, I.: Testing commutativity of a group and the power of randomization. Electronic version at http://www-math.mit.edu/~pak/resezu:cli.html (2000)
7. Szegedy, M.: Quantum speed-up of markov chain based algorithms. In: Proc. of 45th IEEE FOGS. (2004) 32-41 Also arXiv.org report quant-ph/0401053.
8. Ambainis, A.: Quantum walk algorithm for Element Distinctness. In: Proceedings of 45th IEEE FOCS. (2004) 22-31
9. Buhrman, H., Spalek, R.: Quantum verification of matrix products. Technical Report quant-ph/0409035, arXiv archive (2004)
10. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press (2000)
11. Kitaev, A., Shen, A., Vyalyi, M.: Classical and Quantum Computation. Volume 47 of Graduate Studies in Mathematics. AMS (2002)
12. Aaronson, S., Shi, Y.: Quantum lower bound for the collision problem. J. of the ACM 51 (2004) 595-605
13. Kutin, S.: A quantum lower bound for the collision problem. Technical Report quant-ph/0304162, arXiv archive (2003)
14. Ambainis, A.: Quantum lower bounds for collision and element distinctness with small range. Technical Report quant-ph/0305179, arXiv archive (2003)
15. Sinclair, A.: Algorithms for Random Generation and Counting: A Markov Chain Approach. Progress in theoretical computer science. Birkhäuser, Boston (1993)
16. Aldous, D.: Random walks on finite groups and rapidly mixing Markov chains. In: Séminaire de Probabilités XVII. Volume 986 of Lecture Notes in Mathematics., Springer-Verlag (1981-82) 243-297
17. Griffeath, D.: Coupling methods for Markov processes. In Rota, G.C., ed.: Studies in Probability and Ergodic Theory. Academic Press (1978) 1-43
18. Nechaev, V.: Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes 55 (1994) 165-172
19. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Proc. of Eurocrypt. (1997) 255-266
20. Schnorr, C., Jakobsson, M.: Security of signed ElGamal encryption. In: Proc. of 6th Asiacrypt. (2000) 73-89