Fetching the paper…
Reading the bibliography…
We study a subclass of the Instantaneous Quantum Polynomial-time (IQP) circuit with a varying density of two-qubit gates.
C. E. Porter and R. G. Thomas, Fluctuations of nuclear reaction widths, Phys. Rev. 104
1956
Earlier work this paper cites.
P. Erdős, A. Rényi, et al. , On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci 5
1960
Earlier work this paper cites.
E. Lieb, T. Schultz, and D. Mattis, Two soluble models of an antiferromagnetic chain, Annals of Physics 16
1961
Earlier work this paper cites.
M. E. Fisher and M. N. Barber, Scaling theory for finite-size effects in the critical region, Phys. Rev. Lett. 28
1972
Earlier work this paper cites.
F. Barahona, On the computational complexity of Ising spin glass models, Journal of Physics A: Mathematical and General 15
1982
Earlier work this paper cites.
N. Robertson and P. D. Seymour, Graph minors. ii. algorithmic aspects of tree-width, Journal of algorithms 7
1986
Earlier work this paper cites.
M. Jerrum and A. Sinclair, Polynomial-time approximation algorithms for the Ising model, SIAM Journal on computing 22
1993
Earlier work this paper cites.
M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie, On the learnability of discrete distributions, in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing (1994) pp. 273–282
1994
Earlier work this paper cites.
D. Gottesman, The heisenberg representation of quantum computers, arXiv preprint quant-ph/9807006 (1998)
1998
Earlier work this paper cites.
S.-I. Amari, Natural gradient works efficiently in learning, Neural computation 10
1998
Earlier work this paper cites.
E. Knill, Fermionic linear optics and matchgates, arXiv preprint quant-ph/0108033 (2001)
2001
Earlier work this paper cites.
In principle, the energy-based model itself is neither an evaluator nor a generator, as the RBM contains the spin-glass problem evaluating probability or sampling from which is generally NP-Hard Barahona 1982 . In practical use case, however, where the Markov chain Monte-Carlo generates an accurate sample in a polynomial time, the probability distribution can also be estimated Jerrum and Sinclair 1993 ; Neal 2001 . Thus it is both an evaluator and generator when this condition holds
2001
Earlier work this paper cites.
R. M. Neal, Annealed importance sampling, Statistics and computing 11
2001
Earlier work this paper cites.
L. G. Valiant, Quantum circuits that can be simulated classically in polynomial time, SIAM Journal on Computing 31
2002
Earlier work this paper cites.
B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A 65
2002
Earlier work this paper cites.
2002
Earlier work this paper cites.
S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70
2004
Earlier work this paper cites.
M. A. Nielsen, A geometric approach to quantum circuit lower bounds, arXiv preprint quant-ph/0502070 (2005)
2005
Earlier work this paper cites.
Y. LeCun, S. Chopra, R. Hadsell, M. Ranzato, and F. Huang, A tutorial on energy-based learning, Predicting structured data 1
2006
Earlier work this paper cites.
M. A. Nielsen, M. R. Dowling, M. Gu, and A. C. Doherty, Quantum computation as geometry, Science 311
2006
Earlier work this paper cites.
G. E. Hinton, Boltzmann machine, Scholarpedia 2
2007
Cited alongside, same era.
I. L. Markov and Y. Shi, Simulating quantum computation by contracting tensor networks, SIAM Journal on Computing 38
2008
Cited alongside, same era.
A. Pal and D. A. Huse, Many-body localization phase transition, Phys. Rev. B 82
2010
Cited alongside, same era.
S. Aaronson and A. 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
Cited alongside, same era.
M. J. Bremner, R. Jozsa, and D. J. Shepherd, Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy, Proc. R. Soc. A 467
2011
Cited alongside, same era.
A. Bouland, B. Fefferman, C. Nirkhe, and U. Vazirani, On the complexity and verification of quantum random circuit sampling, Nat. Phys. 15
2019
Later among the works it cites.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell, et al. , Quantum supremacy using a programmable superconducting processor, Nature 574
2019
Later among the works it cites.
2019
Later among the works it cites.
B. Skinner, J. Ruhman, and A. Nahum, Measurement-induced phase transitions in the dynamics of entanglement, Phys. Rev. X 9
2019
Later among the works it cites.
S. Zhou, Z. Yang, A. Hamma, and C. Chamon, Single T gate in a clifford circuit drives transition to universal entanglement spectrum statistics, SciPost Physics 9
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Lee, J. Lee, and S.-i. Oum, Rank-width of random graphs, Journal of Graph Theory 70
2012
Cited alongside, same era.
J. Cardy, Finite-size scaling (Elsevier Science, 2012)
2012
Cited alongside, same era.
C. C. Price and N. B. Perkins, Critical properties of the kitaev-heisenberg model, Phys. Rev. Lett. 109
2012
Cited alongside, same era.
Y. Atas, E. Bogomolny, O. Giraud, and G. Roux, Distribution of the ratio of consecutive level spacings in random matrix ensembles, Phys. Rev. Lett. 110
2013
Cited alongside, same era.
D. Stanford and L. Susskind, Complexity and shock wave geometries, Phys. Rev. D 90
2014
Cited alongside, same era.
2014
Cited alongside, same era.
D. J. Luitz, N. Laflorencie, and F. Alet, Many-body localization edge in the random-field heisenberg chain, Phys. Rev. B 91
2015
Cited alongside, same era.
2020
Later among the works it cites.
2020
Later among the works it cites.
D. Pfau, J. S. Spencer, A. G. Matthews, and W. M. C. Foulkes, Ab initio solution of the many-electron schrödinger equation with deep neural networks, Phys. Rev. Research 2
2020
Later among the works it cites.
C.-Y. Park and M. J. Kastoryano, Geometry of learning neural quantum states, Phys. Rev. Research 2
2020
Later among the works it cites.
L. Leone, S. F. Oliviero, Y. Zhou, and A. Hamma, Quantum chaos is quantum, Quantum 5
2021
Later among the works it cites.
A. Lavasani, Y. Alavirad, and M. Barkeshli, Measurement-induced topological entanglement transitions in symmetric random quantum circuits, Nature Physics 17
2021
Later among the works it cites.
C. Oh, Y. Lim, B. Fefferman, and L. Jiang, Classical simulation of Boson sampling based on graph structure, Phys. Rev. Lett. 128
2022
Closest in time.
N. Maskara, A. Deshpande, A. Ehrenberg, M. C. Tran, B. Fefferman, and A. V. Gorshkov, Complexity phase diagram for interacting and long-range bosonic hamiltonians, Phys. Rev. Lett. 129
2022
Closest in time.
L. S. Madsen, F. Laudenbach, M. F. Askarani, F. Rortais, T. Vincent, J. F. Bulmer, F. M. Miatto, L. Neuhaus, L. G. Helt, M. J. Collins, et al. , Quantum computational advantage with a programmable photonic processor, Nature 606
2022
Closest in time.
C.-Y. Park and M. J. Kastoryano, Expressive power of complex-valued restricted boltzmann machines for solving nonstoquastic hamiltonians, Phys. Rev. B 106
2022
Closest in time.
J. C. Napp, R. L. La Placa, A. M. Dalzell, F. G. Brandao, and A. W. Harrow, Efficient classical simulation of random shallow 2d quantum circuits, Physical Review X 12
2022
Closest in time.
A. M. Dalzell, N. Hunter-Jones, and F. G. Brandão, Random quantum circuits anticoncentrate in log depth, PRX Quantum 3
2022
Closest in time.
2022
Closest in time.
J. Tangpanitanon, S. Thanasilp, M.-A. Lemonde, N. Dangniam, and D. G. Angelakis, Signatures of a sampling quantum advantage in driven quantum many-body systems, Quantum Science and Technology 8
2023
Closest in time.