HybridQ: A Hybrid Simulator for Quantum Circuits

L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

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.

D. Aharonov, “A simple proof that Toffoli and Hadamard are quantum universal,” arXiv preprint quant-ph/0301040

2003

Earlier work this paper cites.

S. Aaronson and D. Gottesman, “Improved simulation of stabilizer circuits,” Phys. Rev. A

2004

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.

R. Jozsa and A. Miyake, “Matchgates and classical simulation of quantum circuits,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

2008

Earlier work this paper cites.

USA: Cambridge University Press, 10th ed., 2011

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition · 2011

Earlier work this paper cites.

J. Johansson, P. Nation, and F. Nori, “QuTiP 2: A Python framework for the dynamics of open quantum systems,” Computer Physics Communications

2013

Earlier work this paper cites.

M. B. Hastings, D. Wecker, B. Bauer, and M. Troyer, “Improving quantum algorithms for quantum chemistry,” arXiv preprint arXiv:1403.1539

Original

2014

Earlier work this paper cites.

D. Wecker, B. Bauer, B. K. Clark, M. B. Hastings, and M. Troyer, “Gate-count estimates for performing quantum chemistry on small quantum computers,” Physical Review A

2014

Earlier work this paper cites.

S. Bravyi and D. Gosset, “Improved classical simulation of quantum circuits dominated by clifford gates,” Physical review letters

2016

Cited alongside, same era.

E. Farhi and A. W. Harrow, “Quantum supremacy through the quantum approximate optimization algorithm,” arXiv preprint arXiv:1602.07674

Original

2016

Cited alongside, same era.

I. L. Markov, A. Fatima, S. V. Isakov, and S. Boixo, “Quantum supremacy is both closer and farther than it appears,” arXiv preprint arXiv:1807.10749

Original

2018

Cited alongside, same era.

“Quimb.” https://github.com/jcmgray/quimb , 2018

2018

Cited alongside, same era.

Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, “Quantum approximate optimization algorithm for maxcut: A fermionic view,” Physical Review A

2018

Cited alongside, same era.

“Cotengra.” https://github.com/jcmgray/cotengra , 2019

2019

Later among the works it cites.

S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Venturelli, and R. Biswas, “From the quantum approximate optimization algorithm to a quantum alternating operator ansatz,” Algorithms

2019

Later among the works it cites.

C. Huang, F. Zhang, M. Newman, J. Cai, X. Gao, Z. Tian, J. Wu, H. Xu, H. Yu, B. Yuan, et al

Original

2020

Later among the works it cites.

G. G. Guerreschi, J. Hogaboam, F. Baruffa, and N. P. Sawaya, “Intel quantum simulator: A cloud-ready high-performance simulator of quantum circuits,” Quantum Science and Technology

2020

Later among the works it cites.

B. Villalonga, D. Lyakh, S. Boixo, H. Neven, T. S. Humble, R. Biswas, E. G. Rieffel, A. Ho, and S. Mandrà, “Establishing the quantum supremacy frontier with a 281 pflop/s simulation,” Quantum Science and Technology