Fetching the paper…
Reading the bibliography…
An $n$-qubit quantum circuit is said to be peaked if it has an output probability that is at least inverse-polynomially large as a function of $n$.
Power of one bit of quantum information
Emanuel Knill and Raymond Laflamme · 1998
Earlier work this paper cites.
Large deviations for sums of partly dependent random variables
Svante Janson · 2004
Earlier work this paper cites.
Non-identity check remains QMA-complete for short circuits
Zhengfeng Ji and Xiaodi Wu · 2009
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.
Trading classical and quantum computational resources
Sergey Bravyi, Graeme Smith, and John A Smolin · 2016
Earlier work this paper cites.
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Abhinav Kandala, Antonio Mezzacapo, Kristan Temme, Maika Takita, Markus Brink, Jerry M Chow, and Jay M Gambetta · 2017
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.
Multiqubit clifford groups are unitary 3-designs
Huangjun Zhu · 2017
Cited alongside, same era.
Architectures for quantum simulation showing a quantum speedup
Juan Bermejo-Vega, Dominik Hangleiter, Martin Schwarz, Robert Raussendorf, and Jens Eisert · 2018
Cited alongside, same era.
Quantum advantage with shallow circuits
Sergey Bravyi, David Gosset, and Robert König · 2018
Cited alongside, same era.
quimb: A python package for quantum information and many-body calculations
Johnnie Gray · 2018
Cited alongside, same era.
Simulating large quantum circuits on a small quantum computer
Tianyi Peng, Aram W Harrow, Maris Ozols, and Xiaodi Wu · 2020
Cited alongside, same era.
Classical algorithms for quantum mean values
Sergey Bravyi, David Gosset, and Ramis Movassagh · 2021
Cited alongside, same era.
Efficient classical simulation of random shallow 2d quantum circuits
John C Napp, Rolando L La Placa, Alexander M Dalzell, Fernando GSL Brandao, and Aram W Harrow · 2022
Later among the works it cites.
Quasi-polynomial time approximation of output probabilities of geometrically-local, shallow quantum circuits
Nolan J. Coble and Matthew Coudron · 2022
Later among the works it cites.
Approximating output probabilities of shallow quantum circuits which are geometrically-local in any fixed dimension
Suchetan Dontha, Shi Jie Samuel Tan, Stephen Smith, Sangheon Choi, and Matthew Coudron · 2022
Later among the works it cites.
How much structure is needed for huge quantum speedups?
Scott Aaronson · 2022
Later among the works it cites.
Concentration bounds for quantum states and limitations on the qaoa from polynomial approximations
Anurag Anshu and Tony Metger · 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Information-theoretic bounds on quantum advantage in machine learning
Hsin-Yuan Huang, Richard Kueng, and John Preskill · 2021
Cited alongside, same era.
Later among the works it cites.
Circuit knitting with classical communication
Christophe Piveteau and David Sutter · 2023
Closest in time.