Fetching the paper…
Reading the bibliography…
Demonstrating quantum advantage requires experimental implementation of a computational task that is hard to achieve using state-of-the-art classical systems.
Statistical mechanics, john wily & sons
Huang, K · 1963
Earlier work this paper cites.
Completely positive linear maps on complex matrices
Choi, M.-D · 1975
Earlier work this paper cites.
Asymptotic behavior of group integrals in the limit of infinite rank
Weingarten, D · 1978
Earlier work this paper cites.
Density matrix formulation for quantum renormalization groups
White, S. R · 1992
Earlier work this paper cites.
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W · 1994
Earlier work this paper cites.
Entangling power of quantum evolutions
Zanardi, P., Zalka, C. & Faoro, L · 2000
Earlier work this paper cites.
Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games
Terhal, B. M. & DiVincenzo, D. P · 2002
Earlier work this paper cites.
Efficient classical simulation of slightly entangled quantum computations
Vidal, G · 2003
Earlier work this paper cites.
Moments and cumulants of polynomial random variables on unitarygroups, the itzykson-zuber integral, and free probability
Collins, B · 2003
Earlier work this paper cites.
Optimal quantum circuits for general two-qubit gates
Vatan, F. & Williams, C · 2004
Earlier work this paper cites.
Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits
Barak, B., Chou, C.-N. & Gao, X · 2005
Earlier work this paper cites.
Scalable noise estimation with random unitary operators
Emerson, J., Alicki, R. & Życzkowski, K · 2005
Earlier work this paper cites.
Integration with respect to the haar measure on unitary, orthogonal and symplectic group
Collins, B. & Śniady, P · 2006
Earlier work this paper cites.
Black holes as mirrors: quantum information in random subsystems
Hayden, P. & Preskill, J · 2007
Earlier work this paper cites.
Randomized benchmarking of quantum gates
Knill, E. et al · 2008
Earlier work this paper cites.
An introduction to bayesian networks and their contemporary applications
Niedermayer, D · 2008
Earlier work this paper cites.
Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems
Verstraete, F., Murg, V. & Cirac, J. I · 2008
Earlier work this paper cites.
Computational complexity: a modern approach (Cambridge University Press, 2009)
Arora, S. & Barak, B · 2009
Earlier work this paper cites.
Random quantum circuits are approximate 2-designs
Harrow, A. W. & Low, R. A · 2009
Earlier work this paper cites.
Exact and approximate unitary 2-designs and their application to fidelity estimation
Dankert, C., Cleve, R., Emerson, J. & Livine, E · 2009
Earlier work this paper cites.
Probabilistic graphical models: principles and techniques (MIT press, 2009)
Koller, D. & Friedman, N · 2009
Earlier work this paper cites.
The computational complexity of linear optics
Aaronson, S. & Arkhipov, A · 2011
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 · 2011
Earlier work this paper cites.
Quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms
Scholl, P. et al · 2012
Earlier work this paper cites.
Quantum computing and the entanglement frontier
Preskill, J · 2012
Earlier work this paper cites.
Robust extraction of tomographic information via randomized benchmarking
Kimmel, S., da Silva, M. P., Ryan, C. A., Johnson, B. R. & Ohki, T · 2014
Earlier work this paper cites.
Estimating the coherence of noise
Wallman, J., Granade, C., Harper, R. & Flammia, S. T · 2015
Earlier work this paper cites.
Introduction to quantum gate set tomography
Greenbaum, D · 2015
Earlier work this paper cites.
Average-case complexity versus approximate simulation of commuting quantum computations
Bremner, M. J., Montanaro, A. & Shepherd, D. J · 2016
Earlier work this paper cites.
Quantum supremacy through the quantum approximate optimization algorithm
Farhi, E. & Harrow, A. W · 2016
Earlier work this paper cites.
Complexity-theoretic foundations of quantum supremacy experiments
Aaronson, S. & Chen, L · 2016
Cited alongside, same era.
Holographic duality from random tensor networks
Hayden, P. et al · 2016
Cited alongside, same era.
Exactly solved models in statistical mechanics (Elsevier, 2016)
Baxter, R. J · 2016
Cited alongside, same era.
Local random quantum circuits are approximate polynomial-designs
Brandao, F. G., Harrow, A. W. & Horodecki, M · 2016
Cited alongside, same era.
Observation of a many-body dynamical phase transition with a 53-qubit quantum simulator
Zhang, J. et al · 2017
Cited alongside, same era.
Quantum computational supremacy
Harrow, A. W. & Montanaro, A · 2017
Cited alongside, same era.
Quantum phases of matter on a 256-atom programmable quantum simulator
Ebadi, S. et al · 2020
Later among the works it cites.
Quantum computational advantage using photons
Zhong, H.-S. et al · 2020
Later among the works it cites.
Hyper-optimized tensor network contraction
Gray, J. & Kourtis, S · 2020
Later among the works it cites.
Classical simulation of quantum supremacy circuits
Huang, C. et al · 2020
Later among the works it cites.
A Survey on Distribution Testing: Your Data is Big. But is it Blue?
Canonne, C. L · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum sampling problems, bosonsampling and quantum supremacy
Lund, A. P., Bremner, M. J. & Ralph, T. C · 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.
Quantum supremacy for simulating a translation-invariant ising spin model
Gao, X., Wang, S.-T. & Duan, L.-M · 2017
Cited alongside, same era.
Architectures for quantum simulation showing quantum supremacy
Bermejo-Vega, J., Hangleiter, D., Schwarz, M., Raussendorf, R. & Eisert, J · 2017
Cited alongside, same era.
Chaos and complexity by design
Roberts, D. A. & Yoshida, B · 2017
Cited alongside, same era.
Hand-waving and interpretive dance: an introductory course on tensor networks
Bridgeman, J. C. & Chubb, C. T · 2017
Cited alongside, same era.
Jian, C.-M., You, Y.-Z., Vasseur, R. & Ludwig, A. W · 2020
Later among the works it cites.
Theory of the phase transition in random unitary circuits with measurements
Bao, Y., Choi, S. & Altman, E · 2020
Later among the works it cites.
Statistical aspects of the quantum supremacy demonstration
Rinott, Y., Shoham, T. & Kalai, G · 2020
Later among the works it cites.
What limits the simulation of quantum computers?
Zhou, Y., Stoudenmire, E. M. & Waintal, X · 2020
Later among the works it cites.
Random quantum circuits anti-concentrate in log depth
Dalzell, A. M., Hunter-Jones, N. & Brandão, F. G · 2020
Later among the works it cites.
Efficient learning of quantum noise
Harper, R., Flammia, S. T. & Wallman, J. J · 2020
Later among the works it cites.
Brakerski, Z., Koppula, V., Vazirani, U. & Vidick, T · 2020
Later among the works it cites.
Strong quantum computational advantage using a superconducting quantum processor
Wu, Y. et al · 2021
Closest in time.
Quantum computational advantage via 60-qubit 24-cycle random circuit sampling
Zhu, Q. et al · 2021
Closest in time.
Phase-programmable gaussian boson sampling using stimulated squeezed light
Zhong, H.-S. et al · 2021
Closest in time.
Noise and the frontier of quantum supremacy
Bouland, A., Fefferman, B., Landau, Z. & Liu, Y · 2021
Closest in time.
Fine-grained analysis and improved robustness of quantum supremacy for random circuit sampling
Kondo, Y., Mori, R. & Movassagh, R · 2021
Closest in time.
Emergent randomness and benchmarking from many-body quantum chaos
Choi, J. et al · 2021
Closest in time.
Benchmarking near-term quantum computers via random circuit sampling
Liu, Y., Otten, M., Bassirianjahromi, R., Jiang, L. & Fefferman, B · 2021
Closest in time.
Simulating the sycamore quantum supremacy circuits
Pan, F. & Zhang, P · 2021
Closest in time.
Fu, H. et al · 2021
Closest in time.
Redefining the Quantum Supremacy Baseline With a New Generation Sunway Supercomputer
Liu, X. et al · 2021
Closest in time.
Solving the sampling problem of the Sycamore quantum supremacy circuits
Pan, F., Chen, K. & Zhang, P · 2021
Closest in time.
https://www.scottaaronson.com/blog/?p=5371 (2021)
The blog of scott aaronson · 2021
Closest in time.
Information scrambling in quantum circuits
Mi, X. et al · 2021
Closest in time.
Recursive multi-tensor contraction for xeb verification of quantum circuits
Kalachev, G., Panteleev, P. & Yung, M.-H · 2021
Closest in time.
Classically-verifiable quantum advantage from a computational bell test
Kahanamoku-Meyer, G. D., Choi, S., Vazirani, U. V. & Yao, N. Y · 2021
Closest in time.
Depth-efficient proofs of quantumness
Liu, Z. & Gheorghiu, A · 2021
Closest in time.
Test of quantumness with small-depth quantum circuits
Hirahara, S. & Gall, F. L · 2021
Closest in time.