Fetching the paper…
Reading the bibliography…
Noisy Intermediate-Scale Quantum (NISQ) computers are entering an era in which they can perform computational tasks beyond the capabilities of the most powerful classical computers, thereby achieving "Quantum Supremacy", a major milestone in quantum computing.
R. P. Feynman, “Simulating Physics with Computers,” International Journal Of Theoretical Physics
1982
Earlier work this paper cites.
R. P. Feynman, “Quantum mechanical computers,” Optics news
1985
Earlier work this paper cites.
P. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th Annual Symposium on Foundations of Computer Science
1994
Earlier work this paper cites.
L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC ’96
1996
Earlier work this paper cites.
D. Gottesman, “The heisenberg representation of quantum computers,” arXiv preprint quant-ph/9807006
1998
Earlier work this paper cites.
Cambridge University Press, Cambridge, 2000
M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information · 2000
Earlier work this paper cites.
S. Aaronson and D. Gottesman, “Improved simulation of stabilizer circuits,” Physical Review A
2004
Earlier work this paper cites.
A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head-Gordon, “Chemistry: Simulated quantum computation of molecular energies,” Science
2005
Earlier work this paper cites.
K. De Raedt, K. Michielsen, H. De Raedt, B. Trieu, G. Arnold, M. Richter, T. Lippert, H. Watanabe, and N. Ito, “Massively parallel quantum computer simulator,” Computer Physics Communications
2007
Earlier work this paper cites.
E. Knill, D. Leibfried, R. Reichle, J. Britton, R. Blakestad, J. Jost, C. Langer, R. Ozeri, S. Seidelin, and D. Wineland, “Randomized benchmarking of quantum gates,” Phys. Rev. A
2008
Earlier work this paper cites.
I. L. Markov and Y. Shi, “Simulating quantum computation by contracting tensor networks,” SIAM Journal on Computing
2008
Earlier work this paper cites.
S. Aaronson and A. Arkhipov, “The Computational Complexity of Linear Optics,” in Proceedings of the forty-third annual ACM symposium on Theory of computing
2010
Earlier work this paper cites.
Cambridge, MA: MIT Press, 2011
E. G. Rieffel and W. Polak, Quantum Computing: A Gentle Introduction · 2011
Earlier work this paper cites.
E. Magesan, J. M. Gambetta, and J. Emerson, “Scalable and robust randomized benchmarking of quantum processes,” Phys. Rev. Lett
2011
Earlier work this paper cites.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Phys. Rev. A
2012
Earlier work this paper cites.
E. Magesan, J. M. Gambetta, and J. Emerson, “Characterizing Quantum Gates via Randomized Benchmarking,” Phys. Rev. A
2012
Earlier work this paper cites.
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, and others, “Superconducting quantum circuits at the surface code threshold for fault tolerance,” Nature
2014
Earlier work this paper cites.
J. Kelly, R. Barends, A. G. Fowler, A. Megrant, E. Jeffrey, T. C. White, D. Sank, J. Y. Mutus, B. Campbell, Y. Chen, and others, “State preservation by repetitive error detection in a superconducting quantum circuit,” Nature
2015
Earlier work this paper cites.
D. I. Lyakh, “An efficient tensor transpose algorithm for multicore cpu, intel xeon phi, and nvidia tesla gpu,” Computer Physics Communications
2015
Earlier work this paper cites.
R. Barends, A. Shabani, L. Lamata, J. Kelly, A. Mezzacapo, U. Las Heras, R. Babbush, A. G. Fowler, B. Campbell, Y. Chen, et al
2016
Earlier work this paper cites.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, “Achieving quantum supremacy with sparse and noisy commuting quantum computations,” Quantum
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, “Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations,” Physical Review Letters
2016
Cited alongside, same era.
S. Aaronson and L. Chen, “Complexity-Theoretic Foundations of Quantum Supremacy Experiments,” in LIPIcs-Leibniz International Proceedings in Informatics
C. Neill, P. Roushan, K. Kechedzhi, S. Boixo, S. V. Isakov, V. Smelyanskiy, A. Megrant, B. Chiaro, A. Dunsworth, K. Arya, et al
2018
Later among the works it cites.
J. Preskill, “Quantum computing in the nisq era and beyond,” Quantum
2018
Later among the works it cites.
2018
Later among the works it cites.
Z. Y. Chen, Q. Zhou, C. Xue, X. Yang, G. C. Guo, and G. P. Guo, “64-Qubit Quantum Circuit Simulation,” Science Bulletin
2018
Later among the works it cites.
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
S. Bravyi and D. Gosset, “Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates,” Physical Review Letters
2016
Cited alongside, same era.
T. Häner and D. S. Steiger, “0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit,” in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
2017
Cited alongside, same era.
2017
Cited alongside, same era.
L. S. Bishop, S. Bravyi, A. Cross, J. M. Gambetta, and J. Smolin, “Quantum volume,” Quantum Volume. Technical Report
2017
Cited alongside, same era.
K. A. Britt, F. A. Mohiyaddin, and T. S. Humble, “Quantum accelerators for high-performance computing systems,” in 2017 IEEE International Conference on Rebooting Computing (ICRC)
2017
Cited alongside, same era.
R. S. Bennink, E. M. Ferragut, T. S. Humble, J. A. Laska, J. J. Nutaro, M. G. Pleszkoch, and R. C. Pooser, “Unbiased simulation of near-clifford quantum circuits,” Physical Review A
2017
Cited alongside, same era.
J. Biamonte and V. Bergholm, “Tensor networks in a nutshell,” arXiv preprint arXiv:1708.00006
2017
Cited alongside, same era.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
T. S. Humble, R. J. Sadlier, and K. A. Britt, “Simulated execution of hybrid quantum computing systems,” in Quantum Information Science, Sensing, and Computation X
2018
Later among the works it cites.
A. McCaskey, E. Dumitrescu, M. Chen, D. Lyakh, and T. Humble, “Validating quantum-classical programming models with tensor network simulations,” PLOS ONE
2018
Later among the works it cites.
Available on GitHub at https://github.com/sboixo/GRCS
S. Boixo and C. Neill, “The question of quantum supremacy,” Google AI Blog · 2018
Later among the works it cites.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell, et al
2019
Closest in time.
B. Villalonga, S. Boixo, B. Nelson, C. Henze, E. Rieffel, R. Biswas, and S. Mandrà, “A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware,” NPJ Quantum Information
2019
Closest in time.
“Quantum computation center opens, IBM Research Blog,” September 2019
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
D. I. Lyakh, “Domain-specific virtual processors as a portable programming and execution model for parallel computational workloads on modern heterogeneous high-performance computing architectures,” International Journal of Quantum Chemistry
2019
Closest in time.