Author:
Danilin S.,Lebedev A. V.,Vepsäläinen A.,Lesovik G. B.,Blatter G.,Paraoanu G. S.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Statistical and Nonlinear Physics,Computer Science (miscellaneous)
Reference32 articles.
1. Cleve, R., Ekert, A., Macchiavello, C. & Mosca, M. Quantum algorithms revisited. Proc. Roy. Soc. A 454, 339–354 (1998).
2. Shor, P. W. Algorithms for quantum computation: discrete logarithms and factoring. In Proc. 35th Annual Symposium on Foundations of Computer Science (ed. Santa Fe, N.M.) 124–134 (IEEE Computer Society Press, 1994).
3. Smolin, J. A., Smith, G. & Vargo, A. Oversimplifying quantum factoring. Nature 499, 163–165 (2013).
4. Harrow, A. W., Hassidim, A. & Lloyd, S. Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009).
5. Giovannetti, V., Lloyd, S. & Maccone, L. Quantum-enhanced measurements: beating the standard quantum limit. Science 306, 1330–1336 (2004).
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献