New algorithms for finite density QCD

11Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Recent progress of the complex Langevin method and the Lefschetz thimble in connection with the sign problem is reviewed. These methods rely on the complexification of the original field manifold and they allow direct simulations of theories with non-real measures. Similarities and differences of the two approaches are pointed out. Results using the complex Langevin method, which allows simulations to evade the sign problem in full QCD, are presented. Promising results of the thimble approach for non-gauge theories are also discussed.

Cite

CITATION STYLE

APA

Sexty, D. (2014). New algorithms for finite density QCD. In Proceedings of Science (Vol. Part F130500). Proceedings of Science (PoS). https://doi.org/10.22323/1.214.0016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free