Fetching the paper…
Reading the bibliography…
Sampling tasks have been successful in establishing quantum advantages both in theory and experiments.
1909
Earlier work this paper cites.
Michel Plancherel and Mittag Leffler, “Contribution à l’étude de la représentation d’une fonction arbitraire par des intégrales définies,” Rendiconti del Circolo Matematico di Palermo 30
1910
Earlier work this paper cites.
R. E. A. C. Paley and A. Zygmund, “A note on analytic functions in the unit circle,” Math. Proc. Camb. Phil. Soc. 28
1932
Earlier work this paper cites.
C. E. Porter and R. G. Thomas, “Fluctuations of Nuclear Reaction Widths,” Physical Review 104
1956
Earlier work this paper cites.
Wassily Hoeffding, “Probability Inequalities for Sums of Bounded Random Variables,” Journal of the American Statistical Association 58
1963
Earlier work this paper cites.
Ingram Olkin and Herman Rubin, “Multivariate Beta Distributions and Independence Properties of the Wishart Distribution,” The Annals of Mathematical Statistics 35
1964
Earlier work this paper cites.
Milton Abramowitz and Irene A Stegun, Handbook of mathematical functions: with formulas, graphs, and mathematical tables , Vol. 55 (Courier Corporation, 1965)
1965
Earlier work this paper cites.
Robert Dorfman, “A Formula for the Gini Coefficient,” The Review of Economics and Statistics 61
1979
Earlier work this paper cites.
Larry Stockmeyer, “On approximation algorithms for # p,” SIAM Journal on Computing 14
1985
Earlier work this paper cites.
Colin McDiarmid, “On the method of bounded differences,” in Surveys in Combinatorics, 1989: Invited Papers at the Twelfth British Combinatorial Conference , London Mathematical Society Lecture Note Series (Cambridge University Press, 1989) p. 148–188
1989
Earlier work this paper cites.
Seinosuke Toda, “Pp is as hard as the polynomial-time hierarchy,” SIAM Journal on Computing 20
1991
Earlier work this paper cites.
Ralph W. Bailey, “Distributional Identities of Beta and Chi-Squared Variates: A Geometrical Interpretation,” The American Statistician 46
1992
Earlier work this paper cites.
Lov K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing , STOC ’96 (Association for Computing Machinery, New York, NY, USA, 1996) p. 212–219
1996
Earlier work this paper cites.
Peter W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing 26
1997
Earlier work this paper cites.
Oded Goldreich, Shari Goldwasser, and Dana Ron, “Property testing and its connection to learning and approximation,” J. ACM 45
1998
Earlier work this paper cites.
S. Kotz, N. Balakrishnan, and N.L. Johnson, Continuous Multivariate Distributions, Models and Applications: Second Edition (John wiley & sons, 2005) pp. 1–722
2005
Earlier work this paper cites.
Kenji Fukumizu, Arthur Gretton, Xiaohai Sun, and Bernhard Schölkopf, “Kernel measures of conditional dependence,” in Advances in Neural Information Processing Systems , Vol. 20, edited by J. Platt, D. Koller, Y. Singer, and S. Roweis (Curran Associates, Inc., 2007)
2007
Earlier work this paper cites.
Michael J. Bremner, Richard Jozsa, and Dan J. Shepherd, “Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 467
2010
Earlier work this paper cites.
2011
Earlier work this paper cites.
Scott Aaronson and Alex Arkhipov, “The computational complexity of linear optics,” in Proceedings of the forty-third annual ACM symposium on Theory of computing (2011) pp. 333–342
2011
Earlier work this paper cites.
Maarten Van Den Nest, “Simulating quantum computers with probabilistic methods,” Quantum Info. Comput. 11
2011
Earlier work this paper cites.
Arthur Gretton, Karsten M. Borgwardt, Malte J. Rasch, Bernhard Schölkopf, and Alexander Smola, “A kernel two-sample test,” Journal of Machine Learning Research 13
2012
Earlier work this paper cites.
Andrew J. Ferris and Guifre Vidal, “Perfect sampling with unitary tensor networks,” Physical Review B 85
2012
Earlier work this paper cites.
Matthew A. Broome, Alessandro Fedrizzi, Saleh Rahimi-Keshari, Justin Dove, Scott Aaronson, Timothy C. Ralph, and Andrew G. White, “Photonic boson sampling in a tunable circuit,” Science 339
2013
Cited alongside, same era.
George Arfken, Hans-Jurgen Weber, and Frank E. Harris, Mathematical Methods for Physicists: A Comprehensive Guide , 7th ed. (Elsevier, 2013)
2013
Cited alongside, same era.
Joe Diestel and Angela Spalsbury, The Joys of Haar Measure , Graduate Studies in Mathematics No. volume 150 (American Mathematical Society, Providence, Rhode Island, 2014)
2014
Cited alongside, same era.
Ryan O’Donnell, Analysis of Boolean Functions (Cambridge University Press, 2014)
2014
Cited alongside, same era.
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd, “Average-case complexity versus approximate simulation of commuting quantum computations,” Physical review letters 117
J. Ignacio Cirac, David Pérez-García, Norbert Schuch, and Frank Verstraete, “Matrix product states and projected entangled pair states: Concepts, symmetries, theorems,” Reviews of Modern Physics 93
2021
Later among the works it cites.
Alexander M Dalzell, Nicholas Hunter-Jones, and Fernando GSL Brandão, “Random quantum circuits anticoncentrate in log depth,” PRX Quantum 3
2022
Later among the works it cites.
2022
Later among the works it cites.
2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Gregory Valiant and Paul Valiant, “An automatic inequality prover and instance optimal identity testing,” SIAM Journal on Computing 46
2017
Cited alongside, same era.
S. Boixo, S.V. Isakov, V.N. Smelyanskiy, et al. , “Characterizing quantum supremacy in near-term devices,” Nature Phys , 595–600 (2018)
2018
Cited alongside, same era.
Jarrod R. McClean, Sergio Boixo, Vadim N. Smelyanskiy, Ryan Babbush, and Hartmut Neven, “Barren plateaus in quantum neural network training landscapes,” Nature Communications 9
2018
Cited alongside, same era.
Mohammad H. Amin, Evgeny Andriyash, Jason Rolfe, Bohdan Kulchytskyy, and Roger Melko, “Quantum boltzmann machine,” Phys. Rev. X 8
2018
Cited alongside, same era.
Seth Lloyd and Christian Weedbrook, “Quantum generative adversarial learning,” Phys. Rev. Lett. 121
2018
Cited alongside, same era.
Johnnie Gray, “quimb: a python library for quantum information and many-body calculations,” Journal of Open Source Software 3
2018
Cited alongside, same era.
Sachin Kasture, Oleksandr Kyriienko, and Vincent E. Elfving, “Protocols for classically training quantum generative models on probability distributions,” Phys. Rev. A 108
2023
Later among the works it cites.
Sinho Chewi, Jaume de Dios Pont, Jerry Li, Chen Lu, and Shyam Narayanan, “Query lower bounds for log-concave sampling,” (2023)
2023
Later among the works it cites.
S. Jerbi, C. Gyurik, S.C. Marshall, R. Molteni, and V. Dunjko, “Shadows of quantum machine learning,” Nat Commun 15 (2024), 10.1038/s41467-024-49877-8
2024
Later among the works it cites.
Casper Gyurik, Alexander Schmidhuber, Robbie King, Vedran Dunjko, and Ryu Hayakawa, “Quantum computing and persistence in topological data analysis,” (2024)
2024
Later among the works it cites.
2024
Later among the works it cites.
M.S. Rudolph, S. Lerch, S. Thanasilp, et al. , “Trainability barriers and opportunities in quantum generative modeling,” npj Quantum Inf (2024)
2024
Later among the works it cites.
2024
Later among the works it cites.
Elies Gil-Fuster, Casper Gyurik, Adrian Perez-Salinas, and Vedran Dunjko, “On the relation between trainability and dequantization of variational quantum learning models,” in International Conference on Representation Learning , Vol. 2025, edited by Y. Yue, A. Garg, N. Peng, F. Sha, and R. Yu (2025) pp. 24069–24093
2025
Closest in time.
A. Barthe, M. Grossi, S. Vallecorsa, et al. , “Parameterized quantum circuits as universal generative models for continuous multivariate distributions,” npj Quantum Inf (2025)
2025
Closest in time.
K. Shen, A. Kurkin, A. Pérez-Salinas, et al. , “Variational quantum generative modeling by sampling expectation values of tunable observables,” npj Quantum Inf (2025)
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
M. Larocca, S. Thanasilp, S. Wang, et al. , “Barren plateaus in variational quantum computing,” Nat Rev Phy , 174–189 (2025)
2025
Closest in time.
M. Cerezo, Martin Larocca, Diego García-Martín, et al. , “Does provable absence of barren plateaus imply classical simulability?” Nature Communications 16
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
Hrant Gharibyan, Mohammed Zuhair Mullath, Nicholas E. Sherman, Vincent P. Su, Hayk Tepanyan, and Yuxuan Zhang, “Heuristic Quantum Advantage with Peaked Circuits,” (2025)
2025
Closest in time.
S. Herbst, Brandić I., and A. Pérez-Salinas, “Code for: ”Limits of quantum generative models with classical sampling hardness”,” https://github.com/sabrinaherbst/sampling-hardness-gqml (2025)
2025
Closest in time.