Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 62 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 36 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 67 tok/s Pro
Kimi K2 192 tok/s Pro
GPT OSS 120B 430 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Restoring canonical partition functions from imaginary chemical potential (1712.01515v1)

Published 5 Dec 2017 in hep-lat

Abstract: Using GPGPU techniques and multi-precision calculation we developed the code to study QCD phase transition line in the canonical approach. The canonical approach is a powerful tool to investigate sign problem in Lattice QCD. The central part of the canonical approach is the fugacity expansion of the grand canonical partition functions. Canonical partition functions $Z_n(T)$ are coefficients of this expansion. Using various methods we study properties of $Z_n(T)$. At the last step we perform cubic spline for temperature dependence of $Z_n(T)$ at fixed $n$ and compute baryon number susceptibility $\chi_B/T2$ as function of temperature. After that we compute numerically $\partial\chi/ \partial T$ and restore crossover line in QCD phase diagram. We use improved Wilson fermions and Iwasaki gauge action on the $163 \times 4$ lattice with $m_{\pi}/m_{\rho} = 0.8$ as a sandbox to check the canonical approach. In this framework we obtain coefficient in parametrization of crossover line $T_c(\mu_B2)=T_c\left(c-\kappa\, \mu_B2/T_c2\right)$ with $\kappa = -0.0453 \pm 0.0099$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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