Quantum algorithms for a set of group theoretic problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3701 LNCS, Issue , 2005, Pages 215-227

  Fenner, Stephen A ^a   Zhang, Yong ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; QUANTUM THEORY;

DOUBLE COSET MEMBERSHIP THEORETIC PROBLEMS; GROUP INTERSECTION THEROETIC PROBLEMS; QUANTUM ALGORITHMS;

ALGORITHMS;

EID: 33646191430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560586_18     Document Type: Conference Paper

References (20)

1. Mosca, M.: Quantum Computer Algorithms, PhD thesis, University of Oxford (1999)
2. Jozsa, R.: Quantum factoring, discrete algorithm and the hidden subgroup problem (2000) Manuscript.
3. Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and orbit coset in quantum computing. In: Proceedings of the 35th ACM Symposium on the Theory of Computing. (2003) 1-9
4. Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Physical Review Letters 87 (2001) 167902
5. Aharonov, D., Ta-Shma, A.: Adiabatic quantum state generation and statistical zero knowledge. In: Proceedings of the 35th ACM Symposium on the Theory of Computing. (2003) 20-29
6. Watrous, J.: Quantum algorithms for solvable groups. In: Proceedings of the 33rd ACM Symposium on the Theory of Computing. (2001) 60-67
7. Beals, R., Babai, L.: Las Vegas algorithms for matrix groups. In: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science. (1993) 427-436
8. Ivanyos, G., Magniez, F., Santha, M.: Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. In: Proceedings of 13th ACM Symposium on Parallelism in Algorithms and Architectures. (2001) 263-270
9. Fortnow, L., Rogers, J.: Complexity limitations on quantum computation. Journal of Computer and System Sciences 59 (1999) 240-252
10. Arvind, V., Vinodchandran, N.V.: Solvable black-box group problems are low for PP. Theoretical Computer Science 180 (1997) 17-45
11. Babai, L.: Bounded round interactive proofs in finite groups. SIAM Journal on Computing 5 (1992) 88-111
12. Watrous, J.: Succinct quantum proofs for properties of finite groups. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science. (2000)
13. Burnside, W.: Theory of Groups of Finite Order. Dover Publications, Inc (1955)
14. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)
15. Babai, L., Szemerédi, E.: On the complexity of matrix group problems I. In: Proceedings of the 25th IEEE Symposium on Foundations of Computer Science. (1984) 229-240
16. Babai, L., Cooperman, G., Finkelstein, L., Luks, E., Seress, A.: Fast Monte Carlo algorithms for permutation groups. Journal of Computer and System Sciences 50 (1995) 296-307
17. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38 (1991) 691-729
18. Vadhan, S.: A study of statistical zero knowledge proofs. PhD thesis, M.I.T. (1999)
19. Goldreich, O., Sahai, A., Vadhan, S.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: Proceedings of the 30th ACM Symposium on the Theory of Computing. (1998) 399-408
20. Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite graphs. In: Proceedings of the 23rd ACM Symposium on the Theory of Computing. (1991) 164-174