Built on

C. E. Porter and R. G. Thomas, Fluctuations of nuclear reaction widths, Physical Review 104
1956
Earlier work this paper cites.
T. A. Brody, J. Flores, J. B. French, P. Mello, A. Pandey, and S. S. Wong, Random-matrix physics: spectrum and strength fluctuations, Reviews of Modern Physics 53
1981
Earlier work this paper cites.
I. L. Markov and Y. Shi, Simulating quantum computation by contracting tensor networks, SIAM Journal on Computing 38
2008
Earlier work this paper cites.
J. Preskill, Quantum computing and the entanglement frontier, arXiv preprint arXiv:1203.5813 (2012)
Original
2012
Earlier work this paper cites.
F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborová, and P. Zhang, Spectral redemption in clustering sparse networks, Proc. Natl. Acad. Sci. USA 110
2013
Earlier work this paper cites.
P. Zhang and C. Moore, Scalable detection of statistically significant communities and hierarchies, using message passing for modularity, Proceedings of the National Academy of Sciences 111
2014
Earlier work this paper cites.
S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, arXiv preprint arXiv:1612.05903 (2016)
Original
2016
Earlier work this paper cites.
S. Boixo, S. V. Isakov, V. N. Smelyanskiy, and H. Neven, Simulation of low-depth quantum circuits as complex undirected graphical models, arXiv preprint arXiv:1712.05384 (2017)
Original
2017
Earlier work this paper cites.
S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14
2018
Earlier work this paper cites.

Similar

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 (2018)
Original
2018
Cited alongside, same era.
J. Chen, F. Zhang, M. Chen, C. Huang, M. Newman, and Y. Shi, Classical simulation of intermediate-size quantum circuits, arXiv preprint arXiv:1805.01450 (2018)
Original
2018
Cited alongside, same era.
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. , Quantum supremacy using a programmable superconducting processor, Nature 574
2019
Cited alongside, same era.
A. Bouland, B. Fefferman, C. Nirkhe, and U. Vazirani, On the complexity and verification of quantum random circuit sampling, Nature Physics 15
2019
Cited alongside, same era.
S. Aaronson and S. Gunn, On the classical hardness of spoofing linear cross-entropy benchmarking, arXiv preprint arXiv:1910.12085 (2019)

Then

F. Zhang, C. Huang, M. Newman, J. Cai, H. Yu, Z. Tian, B. Yuan, H. Xu, J. Wu, X. Gao, et al. , Alibaba cloud quantum development platform: Large-scale classical simulation of quantum circuits, arXiv preprint arXiv:1907.11217 (2019)
Original
2019
Later among the works it cites.
A. Zlokapa, S. Boixo, and D. Lidar, Boundaries of quantum supremacy via random circuit sampling, arXiv preprint arXiv:2005.02464 (2020)
Original
2020
Later among the works it cites.
J. Gray and S. Kourtis, Hyper-optimized tensor network contraction, arXiv preprint arXiv:2002.01935 (2020)
Original
2020
Later among the works it cites.
F. Pan, P. Zhou, S. Li, and P. Zhang, Contracting arbitrary tensor networks: general approximate algorithm and applications in graphical models and quantum circuit simulations, Physical Review Letters 125
2020
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…

2021

Simulating the Sycamore quantum supremacy circuits

Pan, Feng, Zhang, Pan

Understand

We propose a general tensor network method for simulating quantum circuits.

The method is massively more efficient in computing a large number of correlated bitstring amplitudes and probabilities than existing methods.
As an application, we study the sampling problem of Google's Sycamore circuits, which are believed to be beyond the reach of classical supercomputers and have been used to demonstrate quantum supremacy.
Using our method, employing a small computational cluster containing 60 graphical processing units (GPUs), we have generated one million correlated bitstrings with some entries fixed, from the Sycamore circuit with 53 qubits and 20 cycles, with linear cross-entropy benchmark (XEB) fidelity equals 0.739, which is much higher than those in Google's quantum supremacy experiments.

Built on

C. E. Porter and R. G. Thomas, Fluctuations of nuclear reaction widths, Physical Review 104
1956
Earlier work this paper cites.
T. A. Brody, J. Flores, J. B. French, P. Mello, A. Pandey, and S. S. Wong, Random-matrix physics: spectrum and strength fluctuations, Reviews of Modern Physics 53
1981
Earlier work this paper cites.
I. L. Markov and Y. Shi, Simulating quantum computation by contracting tensor networks, SIAM Journal on Computing 38
2008
Earlier work this paper cites.
J. Preskill, Quantum computing and the entanglement frontier, arXiv preprint arXiv:1203.5813 (2012)
Original
2012
Earlier work this paper cites.
F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborová, and P. Zhang, Spectral redemption in clustering sparse networks, Proc. Natl. Acad. Sci. USA 110
2013
Earlier work this paper cites.
P. Zhang and C. Moore, Scalable detection of statistically significant communities and hierarchies, using message passing for modularity, Proceedings of the National Academy of Sciences 111
2014
Earlier work this paper cites.
S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, arXiv preprint arXiv:1612.05903 (2016)
Original
2016
Earlier work this paper cites.
S. Boixo, S. V. Isakov, V. N. Smelyanskiy, and H. Neven, Simulation of low-depth quantum circuits as complex undirected graphical models, arXiv preprint arXiv:1712.05384 (2017)
Original
2017
Earlier work this paper cites.
S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14
2018
Earlier work this paper cites.

Similar

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 (2018)
Original
2018
Cited alongside, same era.
J. Chen, F. Zhang, M. Chen, C. Huang, M. Newman, and Y. Shi, Classical simulation of intermediate-size quantum circuits, arXiv preprint arXiv:1805.01450 (2018)
Original
2018
Cited alongside, same era.
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. , Quantum supremacy using a programmable superconducting processor, Nature 574
2019
Cited alongside, same era.
A. Bouland, B. Fefferman, C. Nirkhe, and U. Vazirani, On the complexity and verification of quantum random circuit sampling, Nature Physics 15
2019
Cited alongside, same era.
S. Aaronson and S. Gunn, On the classical hardness of spoofing linear cross-entropy benchmarking, arXiv preprint arXiv:1910.12085 (2019)

Then

F. Zhang, C. Huang, M. Newman, J. Cai, H. Yu, Z. Tian, B. Yuan, H. Xu, J. Wu, X. Gao, et al. , Alibaba cloud quantum development platform: Large-scale classical simulation of quantum circuits, arXiv preprint arXiv:1907.11217 (2019)
Original
2019
Later among the works it cites.
A. Zlokapa, S. Boixo, and D. Lidar, Boundaries of quantum supremacy via random circuit sampling, arXiv preprint arXiv:2005.02464 (2020)
Original
2020
Later among the works it cites.
J. Gray and S. Kourtis, Hyper-optimized tensor network contraction, arXiv preprint arXiv:2002.01935 (2020)
Original
2020
Later among the works it cites.
F. Pan, P. Zhou, S. Li, and P. Zhang, Contracting arbitrary tensor networks: general approximate algorithm and applications in graphical models and quantum circuit simulations, Physical Review Letters 125
2020
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

2019

Cited alongside, same era.

R. Li, B. Wu, M. Ying, X. Sun, and G. Yang, Quantum supremacy circuit simulation on sunway taihulight, IEEE Transactions on Parallel and Distributed Systems 31

2019

Cited alongside, same era.

C. Guo, Y. Liu, M. Xiong, S. Xue, X. Fu, A. Huang, X. Qiang, P. Xu, J. Liu, S. Zheng, et al. , General-purpose quantum circuit simulator with projected entangled-pair states and the quantum supremacy frontier, arXiv preprint arXiv:1905.08394 (2019)

Original

2019

Cited alongside, same era.

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 5

2019

Cited alongside, same era.

S. Kourtis, C. Chamon, E. R. Mucciolo, and A. d. E. Ruckenstein, Fast counting with tensor networks, SciPost Physics 7

2019

Cited alongside, same era.

Notice that the correlation issue of our method can be significantly relaxed by selecting some large-probability bitstrings, then mixing them with a large number of random samples. For example, if we select 220 220 bitstrings with top probabilities and mix with 999780 999780 random bitstrings, the correlations among the overall 1 1 million bitstrings would be negligible, while the F XEB F_{\mathrm{XEB}} would be 0.002 0.002 , the same as Google’s experiments

Cited in the paper.

https://github.com/Fanerst/simulate_sycamore

Cited in the paper.

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 5

2020

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. , Classical simulation of quantum supremacy circuits, arXiv preprint arXiv:2005.06787 (2020)

Original

2020

Later among the works it cites.

R. Schutski, T. Khakhulin, I. Oseledets, and D. Kolmakov, Simple heuristics for efficient parallel tensor contraction and quantum circuit simulation, Physical Review A 102

2020

Later among the works it cites.

Y. Zhou, E. M. Stoudenmire, and X. Waintal, What limits the simulation of quantum computers?, Physical Review X 10

2020

Later among the works it cites.

Martinis, John M. et al. (2021), Quantum supremacy using a programmable superconducting processor, Dryad, Dataset, https://doi.org/10.5061/dryad.k6t1rj8

2021

Closest in time.