Papers
Topics
Authors
Recent
Search
2000 character limit reached

Accelerated quantum circuit Monte-Carlo simulation for heavy quark thermalization

Published 26 Dec 2023 in hep-ph, nucl-th, and quant-ph | (2312.16294v2)

Abstract: Thermalization of heavy quarks in the quark-gluon plasma (QGP) is one of the most promising phenomena for understanding the strong interaction. The energy loss and momentum broadening at low momentum can be well described by a stochastic process with drag and diffusion terms. Recent advances in quantum computing, in particular quantum amplitude estimation (QAE), promise to provide a quadratic speed-up in simulating stochastic processes. We introduce and formalize an accelerated quantum circuit Monte-Carlo (aQCMC) framework to simulate heavy quark thermalization. With simplified drag and diffusion coefficients connected by Einstein's relation, we simulate the thermalization of a heavy quark in isotropic and anisotropic mediums using an ideal quantum simulator and compare that to thermal expectations. With Grover-like QAE, we calculate physical observables with quadratically fewer resources, which is a boost over the classical MC simulation that usually requires a large sampling number at the same estimation accuracy.

Authors (2)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. G. D. Moore and D. Teaney, Phys. Rev. C 71, 064904 (2005), arXiv:hep-ph/0412346 .
  2. S. Cao and S. A. Bass, Phys. Rev. C 84, 064902 (2011), arXiv:1108.5101 [nucl-th] .
  3. X. Du and R. Rapp, Phys. Lett. B 834, 137414 (2022), arXiv:2207.00065 [nucl-th] .
  4. A. Beraudo et al., Nucl. Phys. A 979, 21 (2018), arXiv:1803.03824 [nucl-th] .
  5. J. Zhao et al.,   (2023), arXiv:2311.10621 [hep-ph] .
  6. S. Wiesner,   (1996), arXiv:quant-ph/9603028 .
  7. J. Preskill, Quantum 2, 79 (2018).
  8. D. E. Kharzeev and Y. Kikuchi, Phys. Rev. Res. 2, 023342 (2020), arXiv:2001.00698 [hep-ph] .
  9. C. W. Bauer et al.,   (2022), arXiv:2204.03381 [quant-ph] .
  10. S. Woerner and D. J. Egger, npj Quantum Information 5 (2019), 10.1038/s41534-019-0130-6.
  11. A. Montanaro, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471, 20150301 (2015).
  12. L. K. Grover, Phys. Rev. Lett. 79, 325 (1997).
  13. B. Svetitsky, Phys. Rev. D 37, 2484 (1988).
  14. P. Romatschke and M. Strickland, Phys. Rev. D 71, 125008 (2005), arXiv:hep-ph/0408275 .
  15. M. G. Mustafa, Phys. Rev. C 72, 014905 (2005), arXiv:hep-ph/0412402 .
  16. S. Caron-Huot and G. D. Moore, Phys. Rev. Lett. 100, 052301 (2008), arXiv:0708.4232 [hep-ph] .
  17. S. Y. F. Liu and R. Rapp, JHEP 08, 168 (2020), arXiv:2003.12536 [nucl-th] .
  18. X. Du,   (2023), arXiv:2306.02530 [hep-ph] .
  19. B. Scheihing-Hitschfeld and X. Yao, Phys. Rev. D 108, 054024 (2023), arXiv:2306.13127 [hep-ph] .
  20. S. S. Gubser, Phys. Rev. D 76, 126003 (2007), arXiv:hep-th/0611272 .
  21. J. Casalderrey-Solana and D. Teaney, Phys. Rev. D 74, 085012 (2006), arXiv:hep-ph/0605199 .
  22. Y. Akamatsu and M. Asakawa,   (2023), arXiv:2307.09049 [nucl-th] .
  23. L. Ruiz-Perez and J. C. Garcia-Escartin, Quantum Information Processing 16, 1 (2017).
  24. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010).
  25. L. Madden and A. Simonetto, ACM Trans. Quant. Comput. 3, 7 (2022), arXiv:2106.05649 [quant-ph] .
  26. S. Aaronson and P. Rall, “Quantum approximate counting, simplified,” in Symposium on Simplicity in Algorithms (SOSA), pp. 24–32, https://epubs.siam.org/doi/pdf/10.1137/1.9781611976014.5 .

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.