Fetching the paper…
Reading the bibliography…
In recent years, several experimental groups have claimed demonstrations of ``quantum supremacy'' or computational quantum advantage.
“On the classical hardness of spoofing linear cross-entropy benchmarking” (2020)
Scott Aaronson and Sam Gunn · 1910
Earlier work this paper cites.
“Universal quantum simulators”
Seth Lloyd · 1996
Earlier work this paper cites.
“Quantum speed-up of markov chain based algorithms”
M. Szegedy · 2004
Earlier work this paper cites.
“Classical simulation of quantum supremacy circuits” (2020)
Cupjin Huang, Fang Zhang, Michael Newman, Junjie Cai, Xun Gao, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, Mario Szegedy, Yaoyun Shi, and Jianxin Chen · 2005
Earlier work this paper cites.
“Spoofing linear cross-entropy benchmarking in shallow quantum circuits” (2020)
Boaz Barak, Chi-Ning Chou, and Xun Gao · 2005
Earlier work this paper cites.
“Computational complexity: a modern approach”
Sanjeev Arora and Boaz Barak · 2009
Earlier work this paper cites.
“Quantum algorithm for linear systems of equations”
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Earlier work this paper cites.
“Random quantum circuits are approximate 2-designs”
Aram W. Harrow and Richard A. Low · 2009
Earlier work this paper cites.
“Quantum computing and the entanglement frontier” (2012)
John Preskill · 2012
Earlier work this paper cites.
“Moments of random matrices and weingarten functions” (2013)
Yinzheng Gu · 2013
Earlier work this paper cites.
“Complexity-theoretic foundations of quantum supremacy experiments” (2016)
Scott Aaronson and Lijie Chen · 2016
Earlier work this paper cites.
“Achieving quantum supremacy with sparse and noisy commuting quantum computations”
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd · 2017
Earlier work this paper cites.
“Chaos and complexity by design”
Daniel A. Roberts and Beni Yoshida · 2017
Cited alongside, same era.
“Characterizing quantum supremacy in near-term devices”
Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J. Bremner, John M. Martinis, and Hartmut Neven · 2018
Cited alongside, same era.
“A blueprint for demonstrating quantum supremacy with superconducting qubits”
C. Neill, P. Roushan, K. Kechedzhi, S. Boixo, S. V. Isakov, V. Smelyanskiy, A. Megrant, B. Chiaro, A. Dunsworth, K. Arya, R. Barends, B. Burkett, Y. Chen, Z. Chen, A. Fowler, B. Foxen, M. Giustina, R. Graff, E. Jeffrey, T. Huang, J. Kelly, P. Klimov, E. Lucero, J. Mutus, M. Neeley, C. Quintana, D. Sank, A. Vainsencher, J. Wenner, T. C. White, H. Neven, and J. M. Martinis · 2018
Cited alongside, same era.
“Efficient classical simulation of noisy quantum computation” (2018)
Xun Gao and Luming Duan · 2018
Cited alongside, same era.
“Simulating physics with computers”
Richard P Feynman · 2018
Cited alongside, same era.
“Moments of random quantum circuits and applications in random circuit sampling”
Yinchen Liu · 2021
Later among the works it cites.
“Quantum computational advantage with a programmable photonic processor”
Lars S Madsen, Fabian Laudenbach, Mohsen Falamarzi Askarani, Fabien Rortais, Trevor Vincent, Jacob FF Bulmer, Filippo M Miatto, Leonhard Neuhaus, Lukas G Helt, Matthew J Collins, et al · 2022
Later among the works it cites.
“Simulation of quantum circuits using the big-batch tensor network method”
Feng Pan and Pan Zhang · 2022
Later among the works it cites.
“Solving the sampling problem of the sycamore quantum circuits”
Feng Pan, Keyang Chen, and Pan Zhang · 2022
Later among the works it cites.
“A quantum hamiltonian simulation benchmark”
Yulong Dong, K. Birgitta Whaley, and Lin Lin · 2022
Later among the works it cites.
“A polynomial-time classical algorithm for noisy random circuit sampling” (2022)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Sample complexity of device-independently certified “quantum supremacy””
Dominik Hangleiter, Martin Kliesch, Jens Eisert, and Christian Gogolin · 2019
Cited alongside, same era.
“Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics”
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2019
Cited alongside, same era.
“Quantum certification and benchmarking”
Jens Eisert, Dominik Hangleiter, Nathan Walk, Ingo Roth, Damian Markham, Rhea Parekh, Ulysse Chabaud, and Elham Kashefi · 2020
Cited alongside, same era.
“Strong quantum computational advantage using a superconducting quantum processor”
Yulin Wu, Wan-Su Bao, Sirui Cao, Fusheng Chen, Ming-Cheng Chen, Xiawei Chen, Tung-Hsun Chung, Hui Deng, Yajie Du, Daojin Fan, Ming Gong, Cheng Guo, Chu Guo, Shaojun Guo, Lianchen Han, Linyin Hong, He-Liang Huang, Yong-Heng Huo, Liping Li, Na Li, Shaowei Li, Yuan Li, Futian Liang, Chun Lin, Jin Lin, Haoran Qian, Dan Qiao, Hao Rong, Hong Su, Lihua Sun, Liangyuan Wang, Shiyu Wang, Dachao Wu, Yu Xu, Kai Yan, Weifeng Yang, Yang Yang, Yangsen Ye, Jianghan Yin, Chong Ying, Jiale Yu, Chen Zha, Cha Zhang, Haibin Zhang, Kaili Zhang, Yiming Zhang, Han Zhao, Youwei Zhao, Liang Zhou, Qingling Zhu, Chao-Yang Lu, Cheng-Zhi Peng, Xiaobo Zhu, and Jian-Wei Pan · 2021
Cited alongside, same era.
“Quantum computational advantage via 60-qubit 24-cycle random circuit sampling” (2021)
Qingling Zhu, Sirui Cao, Fusheng Chen, Ming-Cheng Chen, Xiawei Chen, Tung-Hsun Chung, Hui Deng, Yajie Du, Daojin Fan, Ming Gong, Cheng Guo, Chu Guo, Shaojun Guo, Lianchen Han, Linyin Hong, He-Liang Huang, Yong-Heng Huo, Liping Li, Na Li, Shaowei Li, Yuan Li, Futian Liang, Chun Lin, Jin Lin, Haoran Qian, Dan Qiao, Hao Rong, Hong Su, Lihua Sun, Liangyuan Wang, Shiyu Wang, Dachao Wu, Yulin Wu, Yu Xu, Kai Yan, Weifeng Yang, Yang Yang, Yangsen Ye, Jianghan Yin, Chong Ying, Jiale Yu, Chen Zha, Cha Zhang, Haibin Zhang, Kaili Zhang, Yiming Zhang, Han Zhao, Youwei Zhao, Liang Zhou, Chao-Yang Lu, Cheng-Zhi Peng, Xiaobo Zhu, and Jian-Wei Pan · 2021
Cited alongside, same era.
“Closing the “quantum supremacy” gap: achieving real-time simulation of a random quantum circuit using a new sunway supercomputer”
Yong (Alexander) Liu, Xin (Lucy) Liu, Fang (Nancy) Li, Haohuan Fu, Yuling Yang, Jiawei Song, Pengpeng Zhao, Zhen Wang, Dajia Peng, Huarong Chen, Chu Guo, Heliang Huang, Wenzhao Wu, and Dexun Chen · 2021
Cited alongside, same era.
“Classical sampling of random quantum circuits with bounded fidelity” (2021)
Gleb Kalachev, Pavel Panteleev, PengFei Zhou, and Man-Hong Yung · 2021
Cited alongside, same era.
Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, and Umesh Vazirani · 2022
Later among the works it cites.
“The weingarten calculus”
Benoit Collins, Sho Matsumoto, and Jonathan Novak · 2022
Later among the works it cites.
“Computational advantage of quantum random sampling”
Dominik Hangleiter and Jens Eisert · 2023
Later among the works it cites.
“Spoofing cross-entropy measure in boson sampling”
Changhun Oh, Liang Jiang, and Bill Fefferman · 2023
Later among the works it cites.
“A polynomial-time classical algorithm for noisy random circuit sampling”
Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, and Umesh Vazirani · 2023
Later among the works it cites.
“Limitations of linear cross-entropy as a measure for quantum advantage”
Xun Gao, Marcin Kalinowski, Chi-Ning Chou, Mikhail D. Lukin, Boaz Barak, and Soonwon Choi · 2024
Closest in time.
“Polynomial-time classical simulation of noisy iqp circuits with constant depth”
Joel Rajakumar, James D. Watson, and Yi-Kai Liu · 2025
Closest in time.