Fetching the paper…
Reading the bibliography…
A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum adversarial advantage.
Demonstration of a Parametrically-Activated Entangling Gate Protected from Flux Noise
Hong, S. S. et al · 1901
Earlier work this paper cites.
Universality of entanglement and quantum-computation complexity
Orús, R. & Latorre, J. I · 2004
Earlier work this paper cites.
Entanglement and its role in shor’s algorithm
Kendon, V. M. & Munro, W. J · 2006
Earlier work this paper cites.
Simulating quantum computation by contracting tensor networks
Markov, I. L. & Shi, Y · 2008
Earlier work this paper cites.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Bremner, M. J., Jozsa, R. & Shepherd, D. J · 2010
Earlier work this paper cites.
The computational complexity of linear optics
Aaronson, S. & Arkhipov, A · 2011
Earlier work this paper cites.
Quantum computing and the entanglement frontier
Preskill, J · 2012
Earlier work this paper cites.
Tensor network methods for invariant theory
Biamonte, J., Bergholm, V. & Lanzagorta, M · 2013
Earlier work this paper cites.
A practical introduction to tensor networks: Matrix product states and projected entangled pair states
Orús, R · 2014
Earlier work this paper cites.
Tensor Network Contractions for #SAT
Biamonte, J. D., Morton, J. & Turner, J · 2015
Earlier work this paper cites.
Quantum supremacy through the quantum approximate optimization algorithm
Farhi, E. & Harrow, A. W · 2016
Cited alongside, same era.
Digitized adiabatic quantum computing with a superconducting circuit
Barends, R. et al · 2016
Cited alongside, same era.
Quantum computational supremacy
Harrow, A. W. & Montanaro, A · 2017
Cited alongside, same era.
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Bremner, M. J., Montanaro, A. & Shepherd, D. J · 2017
Cited alongside, same era.
Simulation of low-depth quantum circuits as complex undirected graphical models
Boixo, S., Isakov, S. V., Smelyanskiy, V. N. & Neven, H · 2017
Cited alongside, same era.
Quantum supremacy circuit simulation on sunway taihulight
Li, R., Wu, B., Ying, M., Sun, X. & Yang, G · 2018
Closest in time.
Classical simulation of intermediate-size quantum circuits
Chen, J. et al · 2018
Closest in time.
Complexity Classification of Conjugated Clifford Circuits
Bouland, A., Fitzsimons, J. F. & Koh, D. E · 2018
Closest in time.
Architectures for quantum simulation showing a quantum speedup
Bermejo-Vega, J., Hangleiter, D., Schwarz, M., Raussendorf, R. & Eisert, J · 2018
Closest in time.
Quantum supremacy and the complexity of random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C. & Vazirani, U · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Pednault, E. et al · 2017
Cited alongside, same era.
Complexity-theoretic foundations of quantum supremacy experiments
Aaronson, S. & Chen, L · 2017
Cited alongside, same era.
Quantum machine learning
Biamonte, J. et al · 2017
Cited alongside, same era.
0.5 petabyte simulation of a 45-qubit quantum circuit
Häner, T. & Steiger, D. S · 2017
Cited alongside, same era.
Characterizing quantum supremacy in near-term devices
Boixo, S. et al · 2018
Cited alongside, same era.
Dalzell, A. M., Harrow, A. W., Koh, D. E. & La Placa, R. L · 2018
Closest in time.
Quantum supremacy is both closer and farther than it appears
Markov, I. L., Fatima, A., Isakov, S. & Boixo, S · 2018
Closest in time.
Impossibility of classically simulating one-clean-qubit model with multiplicative error
Fujii, K. et al · 2018
Closest in time.
64-qubit quantum circuit simulation
Chen, Z.-Y. et al · 2018
Closest in time.
https://github.com/Quantum-Machine-Learning-Initiative/Entanglement-QS
Deep quantum labs github · 2019
Closest in time.