Fetching the paper…
Reading the bibliography…
The quest to identify quantum advantages lies at the heart of quantum technology.
J. S. Bell, On the einstein podolsky rosen paradox, Physics Physique Fizika 1
1964
Earlier work this paper cites.
S. J. Freedman and J. F. Clauser, Experimental test of local hidden-variable theories, Phys. Rev. Lett. 28
1972
Earlier work this paper cites.
A. S. Holevo, Bounds for the quantity of information transmitted by a quantum communication channel, Problems of Information Transmission 9
1973
Earlier work this paper cites.
L. J. Stockmeyer, The polynomial-time hierarchy, Theoretical computer science 3
1976
Earlier work this paper cites.
M. A. Fischler and R. C. Bolles, Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography, Communications of the ACM 24
1981
Earlier work this paper cites.
R. P. Feynman, Simulating physics with computers, International Journal of Theoretical Physics 21
1982
Earlier work this paper cites.
A. Aspect, J. Dalibard, and G. Roger, Experimental test of bell’s inequalities using time-varying analyzers, Phys. Rev. Lett. 49
1982
Earlier work this paper cites.
S. Wiesner, Conjugate coding, ACM Sigact News 15
1983
Earlier work this paper cites.
M. D. Vose, A linear algorithm for generating random numbers with a given distribution, IEEE Transactions on software engineering 17
1991
Earlier work this paper cites.
S. R. White, Density matrix formulation for quantum renormalization groups, Physical Review Letters 69
1992
Earlier work this paper cites.
E. Bernstein and U. Vazirani, Quantum complexity theory, in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing (1993) pp. 11–20
1993
Earlier work this paper cites.
A. Y. Kitaev, Quantum measurements and the abelian stabilizer problem, arXiv preprint quant-ph/9511026 (1995)
1995
Earlier work this paper cites.
R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society Series B: Statistical Methodology 58
1996
Earlier work this paper cites.
L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (1996) pp. 212–219
1996
Earlier work this paper cites.
S. Lloyd, Universal quantum simulators, Science 273
1996
Earlier work this paper cites.
V. Shoup, Lower bounds for discrete logarithms and related problems, in International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 1997) pp. 256–266
1997
Earlier work this paper cites.
D. R. Simon, On the power of quantum computation, SIAM journal on computing 26
1997
Earlier work this paper cites.
D. Boneh, The decision diffie-hellman problem, in International algorithmic number theory symposium (Springer, 1998) pp. 48–63
1998
Earlier work this paper cites.
E. Farhi and S. Gutmann, Quantum computation and decision trees, Physical Review A 58
1998
Earlier work this paper cites.
J. Preskill, Lecture notes for physics 229: Quantum Information and Computation , Lecture notes, California Institute of Technology (1998), september 1998
1998
Earlier work this paper cites.
R. Raz, Exponential separation of quantum and classical communication complexity, in Proceedings of the thirty-first annual ACM symposium on Theory of computing (ACM, 1999) pp. 358–367
1999
Earlier work this paper cites.
P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM review 41
1999
Earlier work this paper cites.
A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, Exponential algorithmic speedup by a quantum walk, in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (2003) pp. 59–68
2003
Earlier work this paper cites.
V. Giovannetti, S. Lloyd, and L. Maccone, Quantum-enhanced measurements: beating the standard quantum limit, Science 306
2004
Earlier work this paper cites.
V. Giovannetti, S. Lloyd, and L. Maccone, Quantum metrology, Physical Review Letters 96
2006
Earlier work this paper cites.
L. Devroye, Nonuniform random variate generation, Handbooks in operations research and management science 13
2006
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, A quantum algorithm for the hamiltonian nand tree, arXiv preprint quant-ph/0702144 (2007)
2007
Earlier work this paper cites.
J. M. Taylor, P. Cappellaro, L. Childress, L. Jiang, D. Budker, P. Hemmer, A. Yacoby, R. Walsworth, and M. Lukin, High-sensitivity diamond magnetometer with nanoscale resolution, Nature Physics 4
2008
Earlier work this paper cites.
S. Goldwasser, Y. T. Kalai, and G. N. Rothblum, One-time programs, in Annual International Cryptology Conference (Springer, 2008) pp. 39–56
2008
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Physical Review Letters 103
2009
Earlier work this paper cites.
O. Regev, On lattices, learning with errors, random linear codes, and cryptography, Journal of the ACM 56
2009
Earlier work this paper cites.
S. Aaronson, Quantum copy-protection and quantum money, in Proceedings of the 24th Annual IEEE Conference on Computational Complexity (IEEE, 2009) pp. 229–242
2009
Earlier work this paper cites.
A. W. Harrow and R. A. Low, Random quantum circuits are approximate 2-designs, Communications in Mathematical Physics 291
2009
Earlier work this paper cites.
H. Buhrman, R. Cleve, S. Massar, and R. De Wolf, Nonlocality and communication complexity, Reviews of modern physics 82
2010
Earlier work this paper cites.
S. Aaronson and A. Arkhipov, The computational complexity of linear optics, Proceedings of the forty-third annual ACM symposium on Theory of computing , 333 (2011)
2011
Earlier work this paper cites.
T. L. S. Collaboration, A gravitational wave observatory operating beyond the quantum shot-noise limit, Nature Physics 7
2011
Earlier work this paper cites.
M. W. Mahoney, Randomized algorithms for matrices and data, Foundations and Trends in Machine Learning 3
2011
Earlier work this paper cites.
R. Demkowicz-Dobrzański, J. Kołodyński, and M. Guţă, The elusive heisenberg limit in quantum-enhanced metrology, Nature communications 3
2012
Earlier work this paper cites.
R. Colbeck and R. Renner, Free randomness can be amplified, Nature Physics 8
2012
Earlier work this paper cites.
National Institute of Standards and Technology, Digital signature standard (dss) (2013), federal standard specifying RSA, DSA, and ECDSA for digital signatures
2013
Earlier work this paper cites.
N. Natarajan, I. S. Dhillon, P. K. Ravikumar, and A. Tewari, Learning with noisy labels, Advances in neural information processing systems 26
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
D. Gottesman, Fault-tolerant quantum computation with constant overhead, Quantum Information & Computation 14
2014
Cited alongside, same era.
R. Orús, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Annals of Physics 349
2014
Cited alongside, same era.
C. H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Theoretical computer science 560
2014
Cited alongside, same era.
A. D. Ludlow, M. M. Boyd, J. Ye, E. Peik, and P. O. Schmidt, Optical atomic clocks, Reviews of Modern Physics 87
2015
Cited alongside, same era.
T. L. Nicholson, S. Campbell, R. Hutson, G. E. Marti, B. Bloom, R. L. McNally, W. Zhang, M. Barrett, M. S. Safronova, G. Strouse, et al. , Systematic evaluation of an atomic clock at 2 × \times 10- 18 total uncertainty, Nature communications 6
2015
2023
Later among the works it cites.
S. Lee, J. Lee, H. Zhai, Y. Tong, A. M. Dalzell, A. Kumar, P. Helms, J. Gray, Z.-H. Cui, W. Liu, et al. , Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry, Nature Communications 14
2023
Later among the works it cites.
D. Ganapathy, W. Jia, M. Nakano, V. Xu, N. Aritomi, T. Cullen, N. Kijbunchoo, S. Dwyer, A. Mullavey, L. McCuller, et al. , Broadband quantum enhancement of the ligo detectors with frequency-dependent squeezing, Physical Review X 13
2023
Later among the works it cites.
J. S. Cotler, D. K. Mark, H.-Y. Huang, F. Hernández, J. Choi, A. L. Shaw, M. Endres, and S. Choi, Emergent quantum state designs from individual many-body wave functions, PRX quantum 4
2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
B. P. Abbott et al. , Observation of gravitational waves from a binary black hole merger, Physical review letters 116
2016
Cited alongside, same era.
I. Lovchinsky, A. Sushkov, E. Urbach, N. P. de Leon, S. Choi, K. De Greve, R. Evans, R. Gertner, E. Bersin, C. Müller, et al. , Nuclear magnetic resonance detection and spectroscopy of single proteins using quantum logic, Science 351
2016
Cited alongside, same era.
F. G. Brandao, A. W. Harrow, and M. Horodecki, Local random quantum circuits are approximate polynomial-designs, Communications in Mathematical Physics 346
2016
Cited alongside, same era.
I. Kerenidis and A. Prakash, Quantum recommendation systems, in Proceedings of the 8th Innovations in Theoretical Computer Science Conference (Schloss Dagstuhl, 2017) pp. 49:1–49:21
2017
Cited alongside, same era.
C. L. Degen, F. Reinhard, and P. Cappellaro, Quantum sensing, Rev. Mod. Phys. 89
2017
Cited alongside, same era.
G. Carleo and M. Troyer, Solving the quantum many-body problem with artificial neural networks, Science 355
2017
Cited alongside, same era.
R. Schnabel, Squeezed states of light and their applications in laser interferometers, Physics Reports 684
2017
Cited alongside, same era.
Later among the works it cites.
H.-Y. Hu, S. Choi, and Y.-Z. You, Classical shadow tomography with locally scrambled quantum dynamics, Physical Review Research 5
2023
Later among the works it cites.
M. C. Caro, H.-Y. Huang, N. Ezzell, J. Gibbs, A. T. Sornborger, L. Cincio, P. J. Coles, and Z. Holmes, Out-of-distribution generalization for learning quantum dynamics, Nature Communications 14
2023
Later among the works it cites.
H.-Y. Huang, S. Chen, and J. Preskill, Learning to predict arbitrary quantum processes, PRX Quantum 4
2023
Later among the works it cites.
D. Gilboa, H. Michaeli, D. Soudry, and J. McClean, Exponential quantum communication advantage in distributed inference and learning, Advances in Neural Information Processing Systems 37
2024
Later among the works it cites.
C.-F. Chen, H.-Y. Huang, J. Preskill, and L. Zhou, Local minima in quantum systems, in Proceedings of the 56th Annual ACM Symposium on Theory of Computing (ACM, 2024) pp. 1845–1858
2024
Later among the works it cites.
2024
Later among the works it cites.
D. Wu, R. Rossi, F. Vicentini, N. Astrakhantsev, F. Becca, X. Cao, J. Carrasquilla, F. Ferrari, A. Georges, M. Hibat-Allah, et al. , Variational benchmarks for quantum many-body problems, Science 386
2024
Later among the works it cites.
T. Begušić, J. Gray, and G. K.-L. Chan, Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance, Science Advances 10
2024
Later among the works it cites.
2024
Later among the works it cites.
A. Morvan, B. Villalonga, X. Mi, S. Mandra, A. Bengtsson, P. Klimov, Z. Chen, S. Hong, C. Erickson, I. Drozdov, et al. , Phase transitions in random circuit sampling, Nature 634
2024
Later among the works it cites.
L. Lewis, H.-Y. Huang, V. T. Tran, S. Lehner, R. Kueng, and J. Preskill, Improved machine learning algorithm for predicting ground state properties, Nature Communications 15
2024
Later among the works it cites.
P. Bhattacharyya, W. Chen, X. Huang, S. Chatterjee, B. Huang, B. Kobrin, Y. Lyu, T. J. Smart, M. Block, E. Wang, et al. , Imaging the meissner effect in hydride superconductors using quantum sensors, Nature 627
2024
Later among the works it cites.
M. Wang, Y. Wang, Z. Liu, G. Xu, B. Yang, P. Yu, H. Sun, X. Ye, J. Zhou, A. F. Goncharov, et al. , Imaging magnetic transition of magnetite to megabar pressures using quantum sensors in diamond anvil cell, Nature Communications 15
2024
Later among the works it cites.
C. Oh, S. Chen, Y. Wong, S. Zhou, H.-Y. Huang, J. A. Nielsen, Z.-H. Liu, J. S. Neergaard-Nielsen, U. L. Andersen, L. Jiang, et al. , Entanglement-enabled advantage for learning a bosonic random displacement channel, Physical Review Letters 133
2024
Later among the works it cites.
2024
Later among the works it cites.
J. Kallaugher, O. Parekh, and N. Voronova, Exponential quantum space advantage for approximating maximum directed cut in the streaming model, in Proceedings of the 56th Annual ACM Symposium on Theory of Computing (2024) pp. 1805–1815
2024
Later among the works it cites.
J. Gibbs, Z. Holmes, M. C. Caro, N. Ezzell, H.-Y. Huang, L. Cincio, A. T. Sornborger, and P. J. Coles, Dynamical simulation via quantum machine learning with provable generalization, Physical Review Research 6
2024
Later among the works it cites.
H.-K. Zhang, S. Liu, and S.-X. Zhang, Absence of barren plateaus in finite local-depth circuits with long-range entanglement, Physical Review Letters 132
2024
Later among the works it cites.
P. Braccia, P. Bermejo, L. Cincio, and M. Cerezo, Computing exact moments of local random quantum circuits via tensor networks, Quantum Machine Intelligence 6
2024
Later among the works it cites.
A. Letcher, S. Woerner, and C. Zoufal, Tight and efficient gradient bounds for parameterized quantum circuits, Quantum 8
2024
Later among the works it cites.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
R. King, Quantum algorithms: A call to action, https://quantumfrontiers.com/2025/04/20/quantum-algorithms-a-call-to-action/ (2025)
2025
Closest in time.
2025
Closest in time.
T. Schuster, J. Haferkamp, and H.-Y. Huang, Random unitaries in extremely low depth, Science 389
2025
Closest in time.
2025
Closest in time.
T. Begušić, K. Hejazi, and G. K. Chan, Simulating quantum circuit expectation values by clifford perturbation theory, The Journal of Chemical Physics 162
2025
Closest in time.
E. Fontana, M. S. Rudolph, R. Duncan, I. Rungger, and C. Cîrstoiu, Classical simulations of noisy variational quantum circuits, npj Quantum Information 11
2025
Closest in time.
N. Dowling, P. Kos, and X. Turkeshi, Magic resources of the heisenberg picture, Physical Review Letters 135
2025
Closest in time.
2025
Closest in time.
D. Gao, D. Fan, C. Zha, J. Bei, G. Cai, J. Cai, S. Cao, F. Chen, J. Chen, K. Chen, et al. , Establishing a new benchmark in quantum computational advantage with 105-qubit zuchongzhi 3.0 processor, Physical Review Letters 134
2025
Closest in time.
A. Schmidhuber, R. O’Donnell, R. Kothari, and R. Babbush, Quartic quantum speedups for planted inference, Physical Review X 15
2025
Closest in time.
Q. T. Nguyen and C. A. Pattison, Quantum fault tolerance with constant-space and logarithmic-time overheads, in Proceedings of the 57th Annual ACM Symposium on Theory of Computing (2025) pp. 730–737
2025
Closest in time.
2025
Closest in time.
Simons Institute for the Theory of Computing, Meta-complexity program, Online Program with Videos and Materials (2023), accessed July 3, 2025. URL: https://simons.berkeley.edu/programs/meta23
2025
Closest in time.
Forrester Research, Global digital economy forecast, 2023 to 2028 (2024), digital economy projected to reach $16.5 trillion by 2028
2028
Closest in time.