Fetching the paper…
Reading the bibliography…
For random quantum circuits on $n$ qubits of depth $\Theta(\log n)$ with depolarizing noise, the task of sampling from the output state can be efficiently performed classically using a Pauli path method [Aharonov et al.
“Algorithms for quantum computation: discrete logarithms and factoring”
P.W. Shor · 1994
Earlier work this paper cites.
“Limitations of noisy reversible computation” (1996)
Dorit Aharonov, Michael Ben-Or, Russell Impagliazzo, and Noam Nisan · 1996
Earlier work this paper cites.
“Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer”
Peter W. Shor · 1997
Earlier work this paper cites.
“The heisenberg representation of quantum computers” (1998)
Daniel Gottesman · 1998
Earlier work this paper cites.
“Analytic theory of polynomials”
Q.I. Rahman and G. Schmeisser · 2002
Earlier work this paper cites.
“Improved simulation of stabilizer circuits”
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
“New limits on fault-tolerant quantum computation”
Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, and Falk Unger · 2006
Earlier work this paper cites.
“Fault-tolerant quantum computation with constant error rate”
Dorit Aharonov and Michael Ben-Or · 2008
Earlier work this paper cites.
“Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs”
Nikhil Bansal, Sergey Bravyi, and Barbara M. Terhal · 2009
Earlier work this paper cites.
“Quantum computation and quantum information”
Michael A Nielsen and Isaac L Chuang · 2010
Earlier work this paper cites.
“Quantum simulation”
I. M. Georgescu, S. Ashhab, and Franco Nori · 2014
Earlier work this paper cites.
“A quantum approximate optimization algorithm” (2014)
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Earlier work this paper cites.
“A variational eigenvalue solver on a photonic quantum processor”
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien · 2014
Earlier work this paper cites.
“Hamiltonian simulation with nearly optimal dependence on all parameters”
Dominic W. Berry, Andrew M. Childs, and Robin Kothari · 2015
Earlier work this paper cites.
“Improved classical simulation of quantum circuits dominated by clifford gates”
Sergey Bravyi and David Gosset · 2016
Earlier work this paper cites.
“Quantum Computing in the NISQ era and beyond”
John Preskill · 2018
Earlier work this paper cites.
“Efficient classical simulation of noisy quantum computation” (2018)
Xun Gao and Luming Duan · 2018
Earlier work this paper cites.
“Integrable trotterization: Local conservation laws and boundary driving”
Matthieu Vanicat, Lenart Zadnik, and Toma ž Prosen · 2018
Earlier work this paper cites.
“Low-depth quantum simulation of materials”
Ryan Babbush, Nathan Wiebe, Jarrod McClean, James McClain, Hartmut Neven, and Garnet Kin-Lic Chan · 2018
Earlier work this paper cites.
“Operator hydrodynamics, otocs, and entanglement growth in systems without conservation laws”
C. W. von Keyserlingk, Tibor Rakovszky, Frank Pollmann, and S. L. Sondhi · 2018
Earlier work this paper cites.
“Operator spreading in random unitary circuits”
Adam Nahum, Sagar Vijay, and Jeongwan Haah · 2018
Earlier work this paper cites.
“On the complexity and verification of quantum random circuit sampling”
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2019
Earlier work this paper cites.
“Simulation of qubit quantum circuits via pauli propagation”
Patrick Rall, Daniel Liang, Jeremy Cook, and William Kretschmer · 2019
Earlier work this paper cites.
“Full-stack, real-system quantum computer studies: Architectural comparisons and design insights”
Prakash Murali, Norbert Matthias Linke, Margaret Martonosi, Ali Javadi Abhari, Nhung Hong Nguyen, and Cinthia Huerta Alderete · 2019
Cited alongside, same era.
“Reachability deficits in quantum approximate optimization”
V. Akshay, H. Philathong, M. E. S. Morales, and J. D. Biamonte · 2020
Cited alongside, same era.
“Variational quantum algorithms”
Marco Cerezo, Andrew Arrasmith, Ryan Babbush, Simon C Benjamin, Suguru Endo, Keisuke Fujii, Jarrod R McClean, Kosuke Mitarai, Xiao Yuan, Lukasz Cincio, et al · 2021
Cited alongside, same era.
“Cost function dependent barren plateaus in shallow parametrized quantum circuits”
Marco Cerezo, Akira Sone, Tyler Volkoff, Lukasz Cincio, and Patrick J Coles · 2021
Cited alongside, same era.
“Capacity and quantum geometry of parametrized quantum circuits”
Tobias Haug, Kishor Bharti, and M.S. Kim · 2021
Cited alongside, same era.
“Evidence for the utility of quantum computing before fault tolerance”
Youngseok Kim, Andrew Eddins, Sajant Anand, Ken Xuan Wei, Ewout Van Den Berg, Sami Rosenblatt, Hasan Nayfeh, Yantao Wu, Michael Zaletel, Kristan Temme, et al · 2023
Later among the works it cites.
“Simulation of ibm’s kicked ising experiment with projected entangled pair operator” (2023)
Hai-Jun Liao, Kang Wang, Zong-Sheng Zhou, Pan Zhang, and Tao Xiang · 2023
Later among the works it cites.
“Classical simulations of noisy variational quantum circuits” (2023)
Enrico Fontana, Manuel S Rudolph, Ross Duncan, Ivan Rungger, and Cristina Cîrstoiu · 2023
Later among the works it cites.
“Classical surrogate simulation of quantum systems with lowesa” (2023)
Manuel S Rudolph, Enrico Fontana, Zoë Holmes, and Lukasz Cincio · 2023
Later among the works it cites.
“Classical benchmarking of zero noise extrapolation beyond the exactly-verifiable regime” (2023)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Kouhei Nakaji and Naoki Yamamoto · 2021
Cited alongside, same era.
“Limitations of optimization algorithms on noisy quantum devices”
Daniel Stilck França and Raul Garcia-Patron · 2021
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.
“Theory of trotter error with commutator scaling”
Andrew M. Childs, Yuan Su, Minh C. Tran, Nathan Wiebe, and Shuchen Zhu · 2021
Cited alongside, same era.
“Parallel quantum simulation of large systems on small nisq computers”
Fergus Barratt, James Dborin, Matthias Bal, Vid Stojevic, Frank Pollmann, and Andrew G Green · 2021
Cited alongside, same era.
“Quantum approximate optimization of non-planar graph problems on a planar superconducting processor”
Matthew P Harrigan, Kevin J Sung, Matthew Neeley, Kevin J Satzinger, Frank Arute, Kunal Arya, Juan Atalaya, Joseph C Bardin, Rami Barends, Sergio Boixo, et al · 2021
Cited alongside, same era.
“Error propagation in nisq devices for solving classical optimization problems”
Guillermo González-García, Rahul Trivedi, and J. Ignacio Cirac · 2022
Cited alongside, same era.
Sajant Anand, Kristan Temme, Abhinav Kandala, and Michael Zaletel · 2023
Later among the works it cites.
“Fourier expansion in variational quantum algorithms”
Nikita A. Nemkov, Evgeniy O. Kiktenko, and Aleksey K. Fedorov · 2023
Later among the works it cites.
“Variational hamiltonian simulation for translational invariant systems via classical pre-processing”
Refik Mansuroglu, Timo Eckstein, Ludwig Nützel, Samuel A Wilkinson, and Michael J Hartmann · 2023
Later among the works it cites.
“Conserved charges in the quantum simulation of integrable spin chains”
Kazunobu Maruyoshi, Takuya Okuda, Juan W Pedersen, Ryo Suzuki, Masahito Yamazaki, and Yutaka Yoshida · 2023
Later among the works it cites.
“High-threshold and low-overhead fault-tolerant quantum memory”
Sergey Bravyi, Andrew W Cross, Jay M Gambetta, Dmitri Maslov, Patrick Rall, and Theodore J Yoder · 2024
Closest in time.
“Efficient tensor network simulation of ibm’s eagle kicked ising experiment”
Joseph Tindall, Matthew Fishman, E. Miles Stoudenmire, and Dries Sels · 2024
Closest in time.
“Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments”
Kostyantyn Kechedzhi, SV Isakov, Salvatore Mandrà, Benjamin Villalonga, Xiao Mi, Sergio Boixo, and V Smelyanskiy · 2024
Closest in time.
“Simulating noisy variational quantum algorithms: A polynomial approach”
Yuguo Shao, Fuchuan Wei, Song Cheng, and Zhengwei Liu · 2024
Closest in time.
“Classically spoofing system linear cross entropy score benchmarking” (2024)
Andrew Tanggara, Mile Gu, and Kishor Bharti · 2024
Closest in time.
“Quantum simulations of hadron dynamics in the schwinger model using 112 qubits”
Roland C. Farrell, Marc Illa, Anthony N. Ciavarella, and Martin J. Savage · 2024
Closest in time.
“Scalable circuits for preparing ground states on digital quantum computers: The schwinger model vacuum on 100 qubits”
Roland C. Farrell, Marc Illa, Anthony N. Ciavarella, and Martin J. Savage · 2024
Closest in time.
“Classically computing performance bounds on depolarized quantum circuits”
Sattwik Deb Mishra, Miguel Frías-Pérez, and Rahul Trivedi · 2024
Closest in time.
“The quantum adiabatic algorithm suppresses the proliferation of errors” (2024)
Benjamin F Schiffer, Adrian Franco Rubio, Rahul Trivedi, and J Ignacio Cirac · 2024
Closest in time.
“Noise-induced shallow circuits and absence of barren plateaus” (2024)
Antonio Anna Mele, Armando Angrisani, Soumik Ghosh, Sumeet Khatri, Jens Eisert, Daniel Stilck França, and Yihui Quek · 2024
Closest in time.
“Effect of nonunital noise on random-circuit sampling”
Bill Fefferman, Soumik Ghosh, Michael Gullans, Kohdai Kuroiwa, and Kunal Sharma · 2024
Closest in time.
“A review on quantum approximate optimization algorithm and its variants”
Kostas Blekos, Dean Brand, Andrea Ceschini, Chiao-Hui Chou, Rui-Hao Li, Komal Pandya, and Alessandro Summer · 2024
Closest in time.
“A polynomial-time classical algorithm for noisy quantum circuits” (2024)
Thomas Schuster, Chao Yin, Xun Gao, and Norman Y Yao · 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.