Subject
General Mathematics,General Physics and Astronomy,Statistical and Nonlinear Physics,Applied Mathematics
Reference13 articles.
1. Boyer, M., Brassard, G., Hoyer, P. and Tapp, A., Tight bounds on quantum searching. In Proc.Phys. Comp., 1996 (lanl e-print quant-ph/9605034).
2. Bernstein, E. and Vazirani, U., Quantum complexity theory. In Proc. 25th ACM Symposium on Theory of Computing, 1993 [for full paper, see SIAM Journal on Computing, October 1997, 26(5)].
3. Bennett, C. H., Bernstein, E., Brassard, G., Vazirani, U., Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 1997, 26(5), 1510–1524, October.
4. Deutsch, D., Josza, R., Rapid solution of problems by quantum computation. Proc. Royal Society of London, 1992, A400, 73–90.
5. Shor, P., Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings, 35th Annual Symposium on Fundamentals of Computer Science (FOCS), 1994, pp. 124–134.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献