Fetching the paper…
Reading the bibliography…
One can fix the randomness used by a randomized algorithm, but there is no analogous notion of fixing the quantumness used by a quantum algorithm.
Vanishing-error approximate degree and QMA complexity, 2019
Alexander A. Sherstov and Justin Thaler · 1909
Earlier work this paper cites.
Relativizations of the P=?NP question
Theodore Baker, John Gill, and Robert Solovay · 1975
Earlier work this paper cites.
Two theorems on random polynomial time
Leonard Adleman · 1978
Earlier work this paper cites.
Some connections between nonuniform and uniform complexity classes
Richard M. Karp and Richard J. Lipton · 1980
Earlier work this paper cites.
BPP and the polynomial hierarchy
Clemens Lautemann · 1983
Earlier work this paper cites.
A complexity theoretic approach to randomness
Michael Sipser · 1983
Earlier work this paper cites.
The complexity of approximate counting
Larry Stockmeyer · 1983
Earlier work this paper cites.
Some consequences of non-uniform conditions on uniform classes
Chee-Keng Yap · 1983
Earlier work this paper cites.
Parity, circuits, and the polynomial-time hierarchy
Merrick Furst, James B. Saxe, and Michael Sipser · 1984
Earlier work this paper cites.
On relativized exponential and probabilistic complexity classes
Hans Heller · 1986
Earlier work this paper cites.
Does co-NP have short interactive proofs?
Ravi B. Boppana, Johan Håstad, and Stathis Zachos · 1987
Earlier work this paper cites.
Computational Limitations of Small-Depth Circuits
Johan Håstad · 1987
Earlier work this paper cites.
Non-deterministic exponential time has two-prover interactive protocols
László Babai, Lance Fortnow, and Carsten Lund · 1991
Earlier work this paper cites.
PP is as hard as the polynomial-time hierarchy
Seinosuke Toda · 1991
Earlier work this paper cites.
IP = PSPACE
Adi Shamir · 1992
Earlier work this paper cites.
Constant depth circuits, Fourier transform, and learnability
Nathan Linial, Yishay Mansour, and Noam Nisan · 1993
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996
Earlier work this paper cites.
Quantum computability
Leonard M. Adleman, Jonathan DeMarrais, and Ming-Deh A. Huang · 1997
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani · 1997
Earlier work this paper cites.
Quantum complexity theory
Ethan Bernstein and Umesh Vazirani · 1997
Earlier work this paper cites.
Threshold computation and cryptographic security
Yenjo Han, Lane A. Hemaspaandra, and Thomas Thierauf · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1997
Cited alongside, same era.
On the power of quantum computation
Daniel R. Simon · 1997
Cited alongside, same era.
Complexity limitations on quantum computation
Lance Fortnow and John Rogers · 1998
Cited alongside, same era.
Circuit lower bounds collapse relativized complexity classes
Richard Beigel and Alexis Maciel · 1999
Cited alongside, same era.
Succinct quantum proofs for properties of finite groups
John Watrous · 2000
Cited alongside, same era.
Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen · 2001
Cited alongside, same era.
A full characterization of quantum advice
Scott Aaronson and Andrew Drucker · 2014
Later among the works it cites.
How hard is it to approximate the Jones polynomial?
Greg Kuperberg · 2015
Later among the works it cites.
Complexity theory column 89: The polynomial hierarchy, random oracles, and Boolean circuits
Benjamin Rossman, Rocco A. Servedio, and Li-Yang Tan · 2015
Later among the works it cites.
Degree and sensitivity: tails of two distributions, 2016
Parikshit Gopalan, Rocco Servedio, Avishay Tal, and Avi Wigderson · 2016
Later among the works it cites.
Polynomial Bounds for Decoupling, with Applications
Ryan O’Donnell and Yu Zhao · 2016
Later among the works it cites.
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
Scott Aaronson and Lijie Chen · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Limits on the power of quantum statistical zero-knowledge
John Watrous · 2002
Cited alongside, same era.
Quantum multi-prover interactive proof systems with limited prior entanglement
Hirotada Kobayashi and Keiji Matsumoto · 2003
Cited alongside, same era.
Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur?
Hirotada Kobayashi, Keiji Matsumoto, and Tomoyuki Yamakami · 2003
Cited alongside, same era.
On the power of quantum proofs
Ran Raz and Amir Shpilka · 2004
Cited alongside, same era.
Quantum computing, postselection, and probabilistic polynomial-time
Scott Aaronson · 2005
Cited alongside, same era.
Pulling out the quantumness [online]
Lance Fortnow · 2005
Cited alongside, same era.
Later among the works it cites.
An average-case depth hierarchy theorem for Boolean circuits
Johan Håstad, Benjamin Rossman, Rocco A. Servedio, and Li-Yang Tan · 2017
Later among the works it cites.
A polynomial restriction lemma with applications
Valentine Kabanets, Daniel M. Kane, and Zhenjian Lu · 2017
Later among the works it cites.
An entropy proof of the switching lemma and tight bounds on the decision-tree size of AC0
Benjamin Rossman · 2017
Later among the works it cites.
Forrelation: A problem that optimally separates quantum from classical computing
Scott Aaronson and Andris Ambainis · 2018
Later among the works it cites.
Understanding quantum algorithms via query complexity
Andris Ambainis · 2018
Later among the works it cites.
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)
Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka · 2018
Later among the works it cites.
A quantum polynomial hierarchy and a simple proof of Vyalyi’s theorem
Lieuwe Vinkhuijzen · 2018
Later among the works it cites.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, et al · 2019
Later among the works it cites.
Complexity-Theoretic Limitations on Blind Delegated Quantum Computation
Scott Aaronson, Alexandru Cojocaru, Alexandru Gheorghiu, and Elham Kashefi · 2019
Later among the works it cites.
Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
Hao Huang · 2019
Later among the works it cites.
Oracle separation of BQP and PH
Ran Raz and Avishay Tal · 2019
Later among the works it cites.
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials
Scott Aaronson, Robin Kothari, William Kretschmer, and Justin Thaler · 2020
Later among the works it cites.
Quantum computational advantage using photons
Han-Sen Zhong, Hui Wang, Yu-Hao Deng, Ming-Cheng Chen, Li-Chao Peng, Yi-Han Luo, Jian Qin, Dian Wu, Xing Ding, Yi Hu, Peng Hu, Xiao-Yan Yang, Wei-Jun Zhang, Hao Li, Yuxuan Li, Xiao Jiang, Lin Gan, Guangwen Yang, Lixing You, Zhen Wang, Li Li, Nai-Le Liu, Chao-Yang Lu, and Jian-Wei Pan · 2020
Later among the works it cites.
On the complexity of quantum partition functions, 2021
Sergey Bravyi, Anirban Chowdhury, David Gosset, and Pawel Wocjan · 2021
Closest in time.
Quantum Pseudorandomness and Classical Complexity
William Kretschmer · 2021
Closest in time.