Publisher
Springer Nature Switzerland
Reference25 articles.
1. Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pp. 333–342 (2011)
2. Cao, Y., et al.: Quantum chemistry in the age of quantum computing. Chem. Rev. 119(19), 10856–10915 (2019)
3. Kairys, P., et al.: Simulating the Shastry-Sutherland Ising model using quantum annealing. Prx Quantum 1(2), 020320 (2020)
4. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999)
5. Zhou, Y., Stoudenmire, E.M., Waintal, X.: What limits the simulation of quantum computers? Phys. Rev. X 10(4), 041038 (2020)