Built on

Edwin Pednault, John A. Gunnels, Giacomo Nannicini, Lior Horesh, and Robert Wisnieff, “Leveraging secondary storage to simulate deep 54-qubit sycamore circuits,” (2019), arXiv:1910.09534
Original
1910
Earlier work this paper cites.
Nai-Hui Chia, András Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, and Chunhao Wang, “Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning,” arXiv e-prints , arXiv:1910.06151 (2019), arXiv:1910.06151 [cs.DS]
Original
1910
Earlier work this paper cites.
Feng Pan, Pengfei Zhou, Sujie Li, and Pan Zhang, “Contracting arbitrary tensor networks: general approximate algorithm and applications in graphical models and quantum circuit simulations,” (2019), arXiv:1912.03014 [physics.comp-ph]
Original
1912
Earlier work this paper cites.
Steven R. White, “Density matrix formulation for quantum renormalization groups,” Phys. Rev. Lett. 69
1992
Earlier work this paper cites.
C. W. J. Beenakker, “Random-matrix theory of quantum transport,” Rev. Mod. Phys. 69
1997
Earlier work this paper cites.
Guifré Vidal, “Efficient classical simulation of slightly entangled quantum computations,” Phys. Rev. Lett. 91
2003
Earlier work this paper cites.
Scott Aaronson and Daniel Gottesman, “Improved simulation of stabilizer circuits,” Phys. Rev. A 70
2004
Earlier work this paper cites.
M.L. Mehta, Random matrices (3e éd.), Pure and Applied Mathematics , 3rd ed. (Elsevier, London, UK, 2004)
2004
Earlier work this paper cites.
G. Vidal, “Entanglement renormalization,” Phys. Rev. Lett. 99
2007
Earlier work this paper cites.

Similar

Igor L. Markov and Yaoyun. Shi, “Simulating quantum computation by contracting tensor networks,” SIAM Journal on Computing 38
2008
Cited alongside, same era.
F. Verstraete, V. Murg, and J.I. Cirac, “Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems,” Advances in Physics 57
2008
Cited alongside, same era.
Ulrich Schollwöck, “The density-matrix renormalization group in the age of matrix product states,” Annals of Physics 326
2011
Cited alongside, same era.
Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition , 10th ed. (Cambridge University Press, New York, NY, USA, 2011)
2011
Cited alongside, same era.
John Preskill, “Quantum computing and the entanglement frontier,” arXiv e-prints , arXiv:1203.5813 (2012), arXiv:1203.5813 [quant-ph]

Then

Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven, “Characterizing quantum supremacy in near-term devices,” Nature Physics 14
2018
Later among the works it cites.
Jianxin Chen, Fang Zhang, Cupjin Huang, Michael Newman, and Yaoyun Shi, “Classical simulation of intermediate-size quantum circuits,” (2018), arXiv:1805.01450 [quant-ph]
Original
2018
Later among the works it cites.
Bjarni Jónsson, Bela Bauer, and Giuseppe Carleo, “Neural-network states for the classical simulation of quantum computing,” (2018), arXiv:1808.05232 [quant-ph]
Original
2018
Later among the works it cites.
Christopher Bäuerle, D Christian Glattli, Tristan Meunier, Fabien Portier, Patrice Roche, Preden Roulleau, Shintaro Takada, and Xavier Waintal, “Coherent control of single electrons: a review of current progress,” Reports on Progress in Physics 81
2018
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…

2020

What limits the simulation of quantum computers?

Zhou, Yiqing, Stoudenmire, E. Miles, Waintal, Xavier

Understand

It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones.

Perfect quantum computers are unarguably exponentially difficult to simulate: the classical resources required grow exponentially with the number of qubits $N$ or the depth $D$ of the circuit.
Real quantum computing devices, however, are characterized by an exponentially decaying fidelity $\mathcal{F} \sim (1-\epsilon)^{ND}$ with an error rate $\epsilon$ per operation as small as $\approx 1\%$ for current devices.
In this work, we demonstrate that real quantum computers can be simulated at a tiny fraction of the cost that would be needed for a perfect quantum computer.

Built on

Edwin Pednault, John A. Gunnels, Giacomo Nannicini, Lior Horesh, and Robert Wisnieff, “Leveraging secondary storage to simulate deep 54-qubit sycamore circuits,” (2019), arXiv:1910.09534
Original
1910
Earlier work this paper cites.
Nai-Hui Chia, András Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, and Chunhao Wang, “Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning,” arXiv e-prints , arXiv:1910.06151 (2019), arXiv:1910.06151 [cs.DS]
Original
1910
Earlier work this paper cites.
Feng Pan, Pengfei Zhou, Sujie Li, and Pan Zhang, “Contracting arbitrary tensor networks: general approximate algorithm and applications in graphical models and quantum circuit simulations,” (2019), arXiv:1912.03014 [physics.comp-ph]
Original
1912
Earlier work this paper cites.
Steven R. White, “Density matrix formulation for quantum renormalization groups,” Phys. Rev. Lett. 69
1992
Earlier work this paper cites.
C. W. J. Beenakker, “Random-matrix theory of quantum transport,” Rev. Mod. Phys. 69
1997
Earlier work this paper cites.
Guifré Vidal, “Efficient classical simulation of slightly entangled quantum computations,” Phys. Rev. Lett. 91
2003
Earlier work this paper cites.
Scott Aaronson and Daniel Gottesman, “Improved simulation of stabilizer circuits,” Phys. Rev. A 70
2004
Earlier work this paper cites.
M.L. Mehta, Random matrices (3e éd.), Pure and Applied Mathematics , 3rd ed. (Elsevier, London, UK, 2004)
2004
Earlier work this paper cites.
G. Vidal, “Entanglement renormalization,” Phys. Rev. Lett. 99
2007
Earlier work this paper cites.

Similar

Igor L. Markov and Yaoyun. Shi, “Simulating quantum computation by contracting tensor networks,” SIAM Journal on Computing 38
2008
Cited alongside, same era.
F. Verstraete, V. Murg, and J.I. Cirac, “Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems,” Advances in Physics 57
2008
Cited alongside, same era.
Ulrich Schollwöck, “The density-matrix renormalization group in the age of matrix product states,” Annals of Physics 326
2011
Cited alongside, same era.
Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition , 10th ed. (Cambridge University Press, New York, NY, USA, 2011)
2011
Cited alongside, same era.
John Preskill, “Quantum computing and the entanglement frontier,” arXiv e-prints , arXiv:1203.5813 (2012), arXiv:1203.5813 [quant-ph]

Then

Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven, “Characterizing quantum supremacy in near-term devices,” Nature Physics 14
2018
Later among the works it cites.
Jianxin Chen, Fang Zhang, Cupjin Huang, Michael Newman, and Yaoyun Shi, “Classical simulation of intermediate-size quantum circuits,” (2018), arXiv:1805.01450 [quant-ph]
Original
2018
Later among the works it cites.
Bjarni Jónsson, Bela Bauer, and Giuseppe Carleo, “Neural-network states for the classical simulation of quantum computing,” (2018), arXiv:1808.05232 [quant-ph]
Original
2018
Later among the works it cites.
Christopher Bäuerle, D Christian Glattli, Tristan Meunier, Fabien Portier, Patrice Roche, Preden Roulleau, Shintaro Takada, and Xavier Waintal, “Coherent control of single electrons: a review of current progress,” Reports on Progress in Physics 81
2018
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Original

2012

Cited alongside, same era.

Andrew J. Ferris and Guifre Vidal, “Perfect sampling with unitary tensor networks,” Phys. Rev. B 85

2012

Cited alongside, same era.

Akira SaiToh, “A multiprecision c++ library for matrix-product-state simulation of quantum computing: Evaluation of numerical errors,” Journal of Physics: Conference Series 454

2013

Cited alongside, same era.

Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, and Hartmut Neven, “Simulation of low-depth quantum circuits as complex undirected graphical models,” (2017), arXiv:1712.05384 [quant-ph]

Original

2017

Cited alongside, same era.

John Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum 2

2018

Cited alongside, same era.

ITensor Library

Cited in the paper.

Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G. S. L. Brandao, David A. Buell, and et al., “Quantum supremacy using a programmable superconducting processor,” Nature 574

2019

Later among the works it cites.

Chu Guo, Yong Liu, Min Xiong, Shichuan Xue, Xiang Fu, Anqi Huang, Xiaogang Qiang, Ping Xu, Junhua Liu, Shenggen Zheng, He-Liang Huang, Mingtang Deng, Dario Poletti, Wan-Su Bao, and Junjie Wu, “General-purpose quantum circuit simulator with projected entangled-pair states and the quantum supremacy frontier,” Phys. Rev. Lett. 123

2019

Later among the works it cites.

Sebastian Paeckel, Thomas Köhler, Andreas Swoboda, Salvatore R. Manmana, Ulrich Schollwöck, and Claudius Hubig, “Time-evolution methods for matrix-product states,” Annals of Physics 411

2019

Later among the works it cites.

Xavier Waintal, “What determines the ultimate precision of a quantum computer,” Phys. Rev. A 99

2019

Later among the works it cites.