Author:
Polyakov Mikhail,Kluycharev Pyotr
Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Shor, P.: Polynomial time algorithms for prime factorization and discrete logarithm on quantum computer. SIAM J. Comput. 26(5), 1484–1509 (1997)
2. Simon, D.: On the power of quantum computations. SIAM J. Comput. 26, 1474–1483 (1994)
3. Kitaev, A.: Quantum computations: algorithms and error correction. Russ. Math. Surv. 51, 1191–1249 (1997)
4. Babai, L.: Graph isomorphism in quasipolynomial time. In: Proceedings of 48th ACM STOC, pp. 684–697 (2016)
5. Regev, O.: Quantum computation and lattice problems. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, pp. 520–530 (2002)