Fetching the paper…
Reading the bibliography…
While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable advantage in quantum devices without demanding quantum error correction, which is crucial for prolonging the coherence time of qubits.
A.R. Meyer and L.J. Stockmeyer, The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space
1972
Earlier work this paper cites.
L.J. Stockmeyer, The polynomial-time hierarchy
1977
Earlier work this paper cites.
L.J. Stockmeyer, On Approximation Algorithms for #P
1985
Earlier work this paper cites.
A. Ehrenfeucht and M. Karpinski, The Computational Complexity of (XOR, AND)-Counting Problems
1990
Earlier work this paper cites.
S. Toda, PP is as hard as the polynomial-time hierarchy
1991
Earlier work this paper cites.
D. Deutsch and R. Jozsa, Rapid Solution of Problems by Quantum Computation
1992
Earlier work this paper cites.
P.W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
1997
Earlier work this paper cites.
L.K. Grover, Quantum Mechanics Helps in Searching for a Needle in a Haystack
1997
Earlier work this paper cites.
D. Gottesman, The Heisenberg Representation of Quantum Computers
1998
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, Demonstrating the Viability of Universal Quantum Computation Using Teleportation and Single-Qubit Operations
1999
Earlier work this paper cites.
R. Raussendorf and H.J. Briegel, A One-Way Quantum Computer
2001
Earlier work this paper cites.
B.M. Terhal, D.P. DiVincenzo, Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
2004
Earlier work this paper cites.
R. Jozsa, An Introduction to Measurement Based Quantum Computation
2005
Earlier work this paper cites.
H.J. Briegel, D.E. Browne, W. Dür, R. Raussendorf, and M. Van den Nest, Measurement-based quantum computation
2009
Earlier work this paper cites.
M.J. Bremner, R. Jozsa, D.J. Shepherd, Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
2011
Cited alongside, same era.
S. Aaronson and A. Arkhipov, The computational complexity of linear optics
2013
Cited alongside, same era.
J.B. Spring et al
2013
Cited alongside, same era.
M. Tillmann, B. Dakić, R. Heilmann, S. Nolte, A. Szameit, and P. Walther, Experimental boson sampling
2013
Cited alongside, same era.
Crespi, A. et al
2013
Cited alongside, same era.
M.A. Broome, A. Fedrizzi, S. Rahimi-Keshari, J. Dove, S. Aaronson, T. Ralph, and A.G. White, Photonic boson sampling in a tunable circuit
2013
Cited alongside, same era.
K. Fujii, Noise Threshold of Quantum Supremacy
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
J. Miller and A. Miyake, Hierarchy of Universal Entanglement in 2D Measurement-based Quantum Computation
2016
Later among the works it cites.
S. Aaronson and L.-J. Chen, Complexity-Theoretic Foundations of Quantum Supremacy Experiments
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Rossi, M. Huber, D. Bruß, and C. Macchiavello, Quantum Hypergraph States
2013
Cited alongside, same era.
T. Morimae, K. Fujii, and J.F. Fitzsimons, On the hardness of classically simulating the one clean qubit model
2014
Cited alongside, same era.
O. Gühne, M. Cuquet, F.E.S. Steinhoff, T. Moroder, M. Rossi, D. Bruß, B. Kraus, and C. Macchiavello, Entanglement and Nonclassical Properties of Hypergraph States
2014
Cited alongside, same era.
M.J. Bremner, A. Montanaro, and D.J. Shepherd, Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations
2016
Cited alongside, same era.
S. Rahimi-Keshari, T.C. Ralph, C.M. Caves, Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
2016
Cited alongside, same era.
E. Farhi and A.W. Harrow, Quantum Supremacy through the Quantum Approximate Optimization Algorithm
2016
Cited alongside, same era.
X. Gao, S.-T. Wang, and L.-M. Duan, Quantum supremacy for simulating a translation-invariant Ising spin model
2017
Closest in time.
B. Fefferman, M. Foss-Feig, and A.V. Gorshkov, Exact sampling hardness of Ising spin models
2017
Closest in time.
F. Shahandeh, A.P. Lund, T.C. Ralph, Quantum Correlations in Nonlocal BosonSampling
2017
Closest in time.
A.P. Lund, M.J. Bremner, T.C. Ralph, Quantum Sampling Problems, BosonSampling and Quantum Supremacy
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
D. Hangleiter, M. Kliesch, M. Schwarz, and J. Eisert, Direct certification of a class of quantum simulations
2017
Closest in time.