Amplitudeforhold og kvantetilstander i nevrale nettverk

[1] Scott Aaronson og Alex Arkhipov "The Computational Complexity of Linear Optics" (2011).
https: / / doi.org/ 10.1145 / 1993636.1993682

[2] Clement Cannone Personlig kommunikasjon (2021).

[3] Clément L. Canonne, Dana Ron og Rocco A. Servedio, "Testing Probability Distributions using Conditional Samples" SIAM Journal on Computing 44, 540–616 (2015).
https: / / doi.org/ 10.1137 / 130945508

[4] Clement L. Canonne, Xi Chen, Gautam Kamath, Amit Levi og Erik Waingarten, "Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning" Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms 321–336 ( 2021).

[5] Giuseppe Carleo, Yusuke Nomura og Masatoshi Imada, "Konstruere eksakte representasjoner av kvante-mangekroppssystemer med dype nevrale nettverk" Nature Communications 9, 5322 (2018).
https:/​/​doi.org/​10.1038/​s41467-018-07520-3

[6] Giuseppe Carleoan og Matthias Troyer "Løse kvantemangekroppsproblemet med kunstige nevrale nettverk" Science 355, 602–606 (2017).
https: / / doi.org/ 10.1126 / science.aag2302

[7] Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh og Arie Matsliah, "On the Power of Conditional Samples in Distribution Testing" Proceedings of the 4th Conference on Innovations in Theoretical Computer Science 561–580 (2013).
https: / / doi.org/ 10.1145 / 2422436.2422497

[8] Martin Dyer, Alan Frieze og Ravi Kannan, "A Random Polynomial-Time Algorithm for Approximating the Volume of Convex Bodies" J. ACM 38, 1–17 (1991).
https: / / doi.org/ 10.1145 / 102782.102783

[9] Alan Frieze, Ravi Kannan og Santosh Vempala, "Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations" J. ACM 51, 1025–1041 (2004).
https: / / doi.org/ 10.1145 / 1039488.1039494

[10] Xun Gaoand Lu-Ming Duan "Effektiv representasjon av kvantetilstander med mange kropper med dype nevrale nettverk" Nature Communications 8, 662 (2017).
https:/​/​doi.org/​10.1038/​s41467-017-00705-2

[11] Vojtech Havlicekand Sergii Strelchuk "Quantum Schur Sampling Circuits can be Strongly Simulated" Phys. Rev. Lett. 121, 060505 (2018).
https: / / doi.org/ 10.1103 / PhysRevLett.121.060505

[12] Geoffrey E. Hinton "Opplæring av eksperters produkter ved å minimere kontrastiv divergens" Neural Computation 14, 1771–1800 (2002).
https: / / doi.org/ 10.1162 / 089976602760128018

[13] Mark Huber "Approximation algorithms for the normalizing constant of Gibbs distributions" The Annals of Applied Probability 25 (2015).
https://​/​doi.org/​10.1214/​14-aap1015

[14] Mark Jerrum "Tilfeldig generering av kombinatoriske strukturer fra en enhetlig distribusjon (utvidet sammendrag)" Proceedings of the 12th Colloquium on Automata, Languages ​​and Programming 290–299 (1985).

[15] Mark R. Jerrum, Leslie G. Valiant og Vijay V. Vazirani, "Tilfeldig generering av kombinatoriske strukturer fra en enhetlig fordeling" Theoretical Computer Science 43, 169–188 (1986).
https:/​/​doi.org/​10.1016/​0304-3975(86)90174-X
https: / / www.sciencedirect.com/ science / artikkel / pii / 030439758690174X

[16] Bjarni Jónsson, Bela Bauer og Giuseppe Carleo, "Neural-nettverkstilstander for klassisk simulering av kvanteberegning" arXiv e-utskrifter arXiv:1808.05232 (2018).
https://​/​doi.org/​10.48550/​ARXIV.1808.05232
arxiv: 1808.05232

[17] Richard M Karp, Michael Luby og Neal Madras, "Monte-Carlo tilnærmingsalgoritmer for oppregningsproblemer" Journal of Algorithms 10, 429–448 (1989).
https:/​/​doi.org/​10.1016/​0196-6774(89)90038-2
https: / / www.sciencedirect.com/ science / artikkel / pii / 0196677489900382

[18] Matthieu Lerasle "Lecture Notes: Selected topics on robust statistical learning theory" arXiv e-prints arXiv:1908.10761 (2019).
https://​/​doi.org/​10.48550/​ARXIV.1908.10761
arxiv: 1908.10761

[19] Philip M. Longand Rocco A. Servedio “Begrensede Boltzmann-maskiner er vanskelige å vurdere eller simulere omtrentlig” Proceedings of the 27th International Conference on International Conference on Machine Learning 703–710 (2010).

[20] James Martens, Arkadev Chattopadhya, Toni Pitassi og Richard Zemel, "On the Representational Efficiency of Restricted Boltzmann Machines" Curran Associates, Inc. (2013).
http://​/​papers.nips.cc/​paper/​5020-on-the-representational-efficiency-of-restricted-boltzmann-machines.pdf

[21] Matija Medvidović og Giuseppe Carleo "Klassisk variasjonssimulering av Quantum Approximate Optimization Algorithm" npj Quantum Information 7, 101 (2021).
https: / / doi.org/ 10.1038 / s41534-021-00440-z
arxiv: 2009.01760

[22] Imdad SB Sardharwalla, Sergii Strelchuk og Richard Jozsa, "Quantum Conditional Query Complexity" Quantum Info. Comput. 17, 541–567 (2017).

[23] P. Smolensky "Informasjonsbehandling i dynamiske systemer: grunnlaget for harmoniteori" MIT Press (1986).

[24] Daniel Štefankovič, Santosh Vempala og Eric Vigoda, "Adaptive Simulated Annealing: A near-Optimal Connection between Sampling and Counting" J. ACM 56 (2009).
https: / / doi.org/ 10.1145 / 1516512.1516520

[25] Ewin Tang "A Quantum-Inspired Classical Algorithm for Recommendation Systems" Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing 217–228 (2019).
https: / / doi.org/ 10.1145 / 3313276.3316310

[26] LG Valiant "Kompleksiteten ved å beregne det permanente" Theoretical Computer Science 8, 189–201 (1979).
https:/​/​doi.org/​10.1016/​0304-3975(79)90044-6
https: / / www.sciencedirect.com/ science / artikkel / pii / 0304397579900446

[27] Maarten Van Den Nest "Simulering av kvantedatamaskiner med sannsynlige metoder" Kvanteinformasjon. Comput. 11, 784–812 (2011).