Author:
Magniez Frédéric,Nayak Ashwin
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Grover, L.: A fast quantum mechanical algorithm for database search. In: Proc. of 28th ACM STOC, pp. 212–219 (1996)
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, 778–797 (2001)
4. Babai, L., Szemerédi, E.: On the complexity of matrix group problems I. In: Proc. of 25th IEEE FOCS, pp. 229–240 (1984)
5. Watrous, J.: Quantum algorithms for solvable groups. In: Proceedings of 33rd Symposium on Theory of Computing, pp. 60–67. ACM, New York (2001)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献