Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Modeling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials
Reference23 articles.
1. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, Quantum lower bounds by polynomials. in Proc. of the 39th Ann. IEEE Symposium on Foundations of Computer Science, 1998, see also http://arXiv.org/abs/quant-ph/9802049, pp. 352–361.
2. Bennett C.H., Bernstein E., Brassard G., and Vazirani U. (1997). “Strengths and weaknesses of quantum computing”. SIAM J. Comput. 26: 1510–1523, see also http:// arXiv.org/abs/quant-ph/9701001
3. Boyer M., Brassard G., Høyer P., Tapp A. (1998). “Tight bounds on quantum searching”. Forschritte Der Physik 46:493–505, see also http://arXiv.org/abs/quant-ph/9605034
4. Brassard G., Høyer P., Mosca M., Tapp A. “Quantum amplitude amplification and estimation,” Quant. Comput. and Inf., AMS, Contemporary Math. Ser., 305, 53–74, (2002), see also http://arXiv.org/abs/quant-ph/0005055
5. Brassard G., Høyer P., Tapp A. (1998). “Quantum counting”. Lect. Notes on Comp. Sci. 1443:820–831, see also http://arXiv.org/abs/quant-ph/9805082
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献