Fetching the paper…
Reading the bibliography…
Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage: In seminal work [Quantum Inf.
Proposed experiment to test local hidden-variable theories
John F. Clauser, Michael A. Horne, Abner Shimony, and Richard A. Holt · 1969
Earlier work this paper cites.
Width-3 permutation branching programs, technical memorandum tm-293
David A. Barrington · 1985
Earlier work this paper cites.
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
Alexander A. Razborov · 1987
Earlier work this paper cites.
Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity
Roman Smolensky · 1987
Earlier work this paper cites.
Founding cryptography on oblivious transfer
Joe Kilian · 1988
Earlier work this paper cites.
Bounded-width polynomial-size branching programs recognize exactly those languages in N C 1 NC^{1}
David A. Barrington · 1989
Earlier work this paper cites.
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
Daniel Gottesman and Isaac Chuang · 1999
Earlier work this paper cites.
Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
Barbara M. Terhal and David P. DiVincenzo · 2004
Earlier work this paper cites.
Quantum Computing, Postselection, and Probabilistic Polynomial-Time, Dec 2004
Scott Aaronson · 2004
Cited alongside, same era.
Bounds on the Power of Constant-Depth Quantum Circuits
Stephen Fenner, Frederic Green, Steven Homer, and Yong Zhang · 2005
Cited alongside, same era.
Identifying Stabilizer States, 2008
Scott Aaronson and Daniel Gottesman · 2008
Cited alongside, same era.
Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond
Maarten Van Den Nes · 2010
Cited alongside, same era.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Michael J. Bremner, Richard Jozsa, and Dan J. Shepherd · 2010
Cited alongside, same era.
The Computational Complexity of Linear Optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Quantum advantage with shallow circuits
Sergey Bravyi, David Gosset, and Robert König · 2018
Later among the works it cites.
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
Adam Bene Watts, Robin Kothari, Luke Schaeffer, and Avishay Tal · 2019
Later among the works it cites.
Genuine quantum nonlocality in the triangle network
Marc-Olivier Renou, Elisa Bäumer, Sadra Boreiri, Nicolas Brunner, Nicolas Gisin, and Salman Beigi · 2019
Later among the works it cites.
Quantum advantage with noisy shallow circuits
Sergey Bravyi, David Gosset, Robert König, and Marco Tomamichel · 2020
Later among the works it cites.
Interactive shallow Clifford circuits: Quantum advantage against NC 1 and beyond
Daniel Grier and Luke Schaeffer · 2020
Later among the works it cites.
Possibilistic simulation of quantum circuits by classical circuits
Daochen Wang · 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Edward Farhi and Aram Wettroth Harrow · 2016
Cited alongside, same era.
Learning stabilizer states by Bell sampling, Jul 2017
Ashley Montanaro · 2017
Cited alongside, same era.
Closest in time.
The classification of Clifford gates over qubits
Daniel Grier and Luke Schaeffer · 2022
Closest in time.
Unconditional Quantum Advantage for Sampling with Shallow Circuits, 2023
Adam Bene Watts and Natalie Parham · 2023
Closest in time.