Built on

Charles E Porter and Robert G Thomas, “Fluctuations of nuclear reaction widths,” Physical Review 104
1956
Earlier work this paper cites.
Tómas A Brody, Jorge Flores, J Bruce French, PA Mello, A Pandey, and Samuel SM Wong, “Random-matrix physics: spectrum and strength fluctuations,” Reviews of Modern Physics 53
1981
Earlier work this paper cites.
Mark EJ Newman and Gerard T Barkema, Monte Carlo methods in statistical physics chapter 1-4 (Clarendon Press, 1999)
1999
Earlier work this paper cites.
Igor L Markov and Yaoyun Shi, “Simulating quantum computation by contracting tensor networks,” SIAM Journal on Computing 38
2008
Earlier work this paper cites.
Scott Aaronson and Lijie Chen, “Complexity-theoretic foundations of quantum supremacy experiments,” arXiv preprint arXiv:1612.05903 (2016)
Original
2016
Earlier work this paper cites.
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, and Hartmut 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.
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
Earlier work this paper cites.
Igor L Markov, Aneeqa Fatima, Sergei V Isakov, and Sergio Boixo, “Quantum supremacy is both closer and farther than it appears,” arXiv preprint arXiv:1807.10749 (2018)
Original
2018
Earlier work this paper cites.
Jianxin Chen, Fang Zhang, Mingcheng Chen, Cupjin Huang, Michael Newman, and Yaoyun Shi, “Classical simulation of intermediate-size quantum circuits,” arXiv preprint arXiv:1805.01450 (2018)
Original
2018
Earlier work this paper cites.
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al. , “Quantum supremacy using a programmable superconducting processor,” Nature 574
2019
Earlier work this paper cites.
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani, “On the complexity and verification of quantum random circuit sampling,” Nature Physics 15
2019
Earlier work this paper cites.

Similar

Ramis Movassagh, “Quantum supremacy and random circuits,” arXiv preprint arXiv:1909.06210 (2019)
Original
2019
Cited alongside, same era.
Scott Aaronson and Sam Gunn, “On the classical hardness of spoofing linear cross-entropy benchmarking,” arXiv preprint arXiv:1910.12085 (2019)
Original
2019
Cited alongside, same era.
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,” Physical Review Letters 123
2019
Cited alongside, same era.
Benjamin Villalonga, Sergio Boixo, Bron Nelson, Christopher Henze, Eleanor Rieffel, Rupak Biswas, and Salvatore Mandrà, “A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware,” npj Quantum Information 5

Then

Johnnie Gray and Stefanos Kourtis, “Hyper-optimized tensor network contraction,” Quantum 5
2021
Closest in time.
Haohuan Fu, Yuling Yang, Jiawei Song, Pengpeng Zhao, Zhen Wang, Dajia Peng, Huarong Chen, Chu Guo, Heliang Huang, Wenzhao Wu, et al. , “Closing the” quantum supremacy” gap: achieving real-time simulation of a random quantum circuit using a new sunway supercomputer,” arXiv preprint arXiv:2110.14502 (2021)
Original
2021
Closest in time.
Xin Liu, Chu Guo, Yong Liu, Yuling Yang, Jiawei Song, Jie Gao, Zhen Wang, Wenzhao Wu, Dajia Peng, Pengpeng Zhao, Fang Li, He-Liang Huang, Haohuan Fu, and Dexun Chen, “Redefining the quantum supremacy baseline with a new generation sunway supercomputer,” arXiv preprint arXiv:2111.01066 (2021)
Original
2021
Closest in time.
Xun Gao, Marcin Kalinowski, Chi-Ning Chou, Mikhail D Lukin, Boaz Barak, and Soonwon Choi, “Limitations of linear cross-entropy as a measure for quantum advantage,” arXiv preprint arXiv:2112.01657 (2021)
Original
2021
Closest in time.

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

Solving the sampling problem of the Sycamore quantum circuits

Pan, Feng, Chen, Keyang, Zhang, Pan

Understand

We study the problem of generating independent samples from the output distribution of Google's Sycamore quantum circuits with a target fidelity, which is believed to be beyond the reach of classical supercomputers and has been used to demonstrate quantum supremacy.

We propose a new method to classically solve this problem by contracting the corresponding tensor network just once, and is massively more efficient than existing methods in obtaining a large number of uncorrelated samples with a target fidelity.
For the Sycamore quantum supremacy circuit with $53$ qubits and $20$ cycles, we have generated one million uncorrelated bitstrings $\{\mathbf s\}$ which are sampled from a distribution $\hat P(\mathbf s)=|\hat \psi(\mathbf s)|^2$, where the approximate state $\hat \psi$ has fidelity $F\approx 0.0037$.
The whole computation has cost about $15$ hours on a computational cluster with $512$ GPUs.

Built on

Charles E Porter and Robert G Thomas, “Fluctuations of nuclear reaction widths,” Physical Review 104
1956
Earlier work this paper cites.
Tómas A Brody, Jorge Flores, J Bruce French, PA Mello, A Pandey, and Samuel SM Wong, “Random-matrix physics: spectrum and strength fluctuations,” Reviews of Modern Physics 53
1981
Earlier work this paper cites.
Mark EJ Newman and Gerard T Barkema, Monte Carlo methods in statistical physics chapter 1-4 (Clarendon Press, 1999)
1999
Earlier work this paper cites.
Igor L Markov and Yaoyun Shi, “Simulating quantum computation by contracting tensor networks,” SIAM Journal on Computing 38
2008
Earlier work this paper cites.
Scott Aaronson and Lijie Chen, “Complexity-theoretic foundations of quantum supremacy experiments,” arXiv preprint arXiv:1612.05903 (2016)
Original
2016
Earlier work this paper cites.
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, and Hartmut 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.
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
Earlier work this paper cites.
Igor L Markov, Aneeqa Fatima, Sergei V Isakov, and Sergio Boixo, “Quantum supremacy is both closer and farther than it appears,” arXiv preprint arXiv:1807.10749 (2018)
Original
2018
Earlier work this paper cites.
Jianxin Chen, Fang Zhang, Mingcheng Chen, Cupjin Huang, Michael Newman, and Yaoyun Shi, “Classical simulation of intermediate-size quantum circuits,” arXiv preprint arXiv:1805.01450 (2018)
Original
2018
Earlier work this paper cites.
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al. , “Quantum supremacy using a programmable superconducting processor,” Nature 574
2019
Earlier work this paper cites.
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani, “On the complexity and verification of quantum random circuit sampling,” Nature Physics 15
2019
Earlier work this paper cites.

Similar

Ramis Movassagh, “Quantum supremacy and random circuits,” arXiv preprint arXiv:1909.06210 (2019)
Original
2019
Cited alongside, same era.
Scott Aaronson and Sam Gunn, “On the classical hardness of spoofing linear cross-entropy benchmarking,” arXiv preprint arXiv:1910.12085 (2019)
Original
2019
Cited alongside, same era.
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,” Physical Review Letters 123
2019
Cited alongside, same era.
Benjamin Villalonga, Sergio Boixo, Bron Nelson, Christopher Henze, Eleanor Rieffel, Rupak Biswas, and Salvatore Mandrà, “A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware,” npj Quantum Information 5

Then

Johnnie Gray and Stefanos Kourtis, “Hyper-optimized tensor network contraction,” Quantum 5
2021
Closest in time.
Haohuan Fu, Yuling Yang, Jiawei Song, Pengpeng Zhao, Zhen Wang, Dajia Peng, Huarong Chen, Chu Guo, Heliang Huang, Wenzhao Wu, et al. , “Closing the” quantum supremacy” gap: achieving real-time simulation of a random quantum circuit using a new sunway supercomputer,” arXiv preprint arXiv:2110.14502 (2021)
Original
2021
Closest in time.
Xin Liu, Chu Guo, Yong Liu, Yuling Yang, Jiawei Song, Jie Gao, Zhen Wang, Wenzhao Wu, Dajia Peng, Pengpeng Zhao, Fang Li, He-Liang Huang, Haohuan Fu, and Dexun Chen, “Redefining the quantum supremacy baseline with a new generation sunway supercomputer,” arXiv preprint arXiv:2111.01066 (2021)
Original
2021
Closest in time.
Xun Gao, Marcin Kalinowski, Chi-Ning Chou, Mikhail D Lukin, Boaz Barak, and Soonwon Choi, “Limitations of linear cross-entropy as a measure for quantum advantage,” arXiv preprint arXiv:2112.01657 (2021)
Original
2021
Closest in time.

Beyond the bibliography

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

Open on alphaXiv

alphaXiv is searching for related work…

2019

Cited alongside, same era.

Alexander Zlokapa, Sergio Boixo, and Daniel Lidar, “Boundaries of quantum supremacy via random circuit sampling,” arXiv preprint arXiv:2005.02464 (2020)

Original

2020

Cited alongside, same era.

Cupjin Huang, Fang Zhang, Michael Newman, Junjie Cai, Xun Gao, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, et al. , “Classical simulation of quantum supremacy circuits,” arXiv preprint arXiv:2005.06787 (2020)

Original

2020

Cited alongside, same era.

Yiqing Zhou, E Miles Stoudenmire, and Xavier Waintal, “What limits the simulation of quantum computers?” Physical Review X 10

2020

Cited alongside, same era.

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,” Physical Review Letters 125

2020

Cited alongside, same era.

Johnnie Gray and Stefanos Kourtis, “Hyper-optimized tensor network contraction,” arXiv preprint arXiv:2002.01935 (2020)

Original

2020

Cited alongside, same era.

Yulin Wu, Wan-Su Bao, Sirui Cao, Fusheng Chen, Ming-Cheng Chen, Xiawei Chen, Tung-Hsun Chung, Hui Deng, Yajie Du, Daojin Fan, et al. , “Strong quantum computational advantage using a superconducting quantum processor,” Physical Review Letters 127

2021

Cited alongside, same era.

See Supplemental Material for details about the explicit head-tail splitting of the circuits, the sparse-state contraction method, slicing technique, validations of the approximate sampling method and detailed data about the complexity, estimated fidelity, GPU efficiency

Cited in the paper.

https://developer.nvidia.com/cuquantum-sdk

Cited in the paper.

Cupjin Huang, Fang Zhang, Michael Newman, Xiaotong Ni, Dawei Ding, Junjie Cai, Xun Gao, Tenghui Wang, Feng Wu, Gengyan Zhang, Hsiang-Sheng Ku, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, Mario Szegedy, Yaoyun Shi, Hui-Hai Zhao, Chunqing Deng, and Jianxin Chen, “Efficient parallelization of tensor network contraction for simulating quantum computation,” Nature Computational Science 1

2021

Closest in time.

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.

Cirq Developers, “Cirq,” (2021), See full list of authors on Github: https://github.com/quantumlib/Cirq/graphs/contributors

2021

Closest in time.

Gleb Kalachev, Pavel Panteleev, PengFei Zhou, and Man-Hong Yung, “Classical Sampling of Random Quantum Circuits with Bounded Fidelity,” arXiv:2112.15083 [quant-ph] (2021) , arXiv:2112.15083 [quant-ph]

Original

2021

Closest in time.

Qingling Zhu, Sirui Cao, Fusheng Chen, Ming-Cheng Chen, Xiawei Chen, Tung-Hsun Chung, Hui Deng, Yajie Du, Daojin Fan, Ming Gong, et al. , “Quantum computational advantage via 60-qubit 24-cycle random circuit sampling,” Science Bulletin (2022)

2022

Closest in time.

Feng Pan and Pan Zhang, “Simulation of Quantum Circuits Using the Big-Batch Tensor Network Method,” Physical Review Letters 128

2022

Closest in time.