Classical Simulation of Quantum Circuits by Half Gauss Sums-Reference-Cited by-同舟云学术

Classical Simulation of Quantum Circuits by Half Gauss Sums

Published:2022-01-31 Issue:2 Volume:390 Page:471-500
ISSN:0010-3616
Container-title:Communications in Mathematical Physics
language:en
Short-container-title:Commun. Math. Phys.

Author:

Bu Kaifeng^ORCID,Koh Dax Enshan^ORCID

Funder

John Templeton Foundation

National Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Mathematical Physics,Statistical and Nonlinear Physics

Link

https://link.springer.com/content/pdf/10.1007/s00220-022-04320-1.pdf

Reference52 articles.

1. Hua, L.-K.: Introduction to Number Theory. Springer, Berlin (2012)

2. Gauss, C.: Disquisitiones Arithmeticae. Fleischer, Leipzig (1801)

3. Paterson, K.G.: Applications of exponential sums in communications theory. In: Walker, M. (ed.) Cryptography and Coding, pp. 1–24. Springer, Berlin (1999)

4. Goldberg, L.A., Grohe, M., Jerrum, M., Thurley, M.: A complexity dichotomy for partition functions with mixed signs. SIAM J. Comput. 39(7), 3336–3402 (2010)

5. Shparlinski, I.E.: Exponential sums in coding theory, cryptology and algorithms. In: Coding Theory and Cryptology, pp. 323–383. World Scientific (2002)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complexity of Quantum Circuits via Sensitivity, Magic, and Coherence;Communications in Mathematical Physics;2024-06-23

2. Magic of random matrix product states;Physical Review B;2024-05-14

3. Quantum entropy and central limit theorem;Proceedings of the National Academy of Sciences;2023-06-12

4. Resource theory of quantum scrambling;Proceedings of the National Academy of Sciences;2023-04-18

5. Statistical complexity of quantum circuits;Physical Review A;2022-06-17