اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدApplication of the path optimization method to the sign problem in an effective model of QCD with a repulsive vector-type interaction
137
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The path optimization method is applied to a QCD effective model with the Polyakov loop and the repulsive vector-type interaction at finite temperature and density to circumvent the model sign problem. We show how the path optimization method can increase the average phase factor and control the model sign problem. This is the first study which correctly treats the repulsive vector-type interaction in the QCD effective model with the Polyakov-loop via the Markov-chain Monte-Carlo approach. It is shown that the complexification of the temporal component of the gluon field and also the vector-type auxiliary field are necessary to evade the model sign problem within the standard path-integral formulation.
قيم البحث
اقرأ أيضاً
We discuss the sign problem in the Polyakov loop extended Nambu--Jona-Lasinio model with repulsive vector-type interaction by using the path optimization method. In this model, both of the Polyakov loop and the vector-type interaction cause the model
sign problem, and several prescriptions have been utilized even in the mean field treatment. In the path optimization method, integration variables are complexified and the integration path (manifold) is optimized to evade the sign problem, or equivalently to enhance the average phase factor. Within the homogeneous field ansatz, the path is optimized by using the feedforward neural network. We find that the assumptions adopted in previous works, $mathrm{Re},A_8 simeq 0$ and $mathrm{Re},omega simeq 0$, can be justified from the Monte-Carlo configurations sampled on the optimized path. We also derive the Euler-Lagrange equation for the optimal path to satisfy. The two optimized paths, the solution of the Euler-Lagrange equation and the variationally optimized path, agree with each other in the region with large statistical weight.
We apply the path optimization method to a QCD effective model with the Polyakov loop at finite density to circumvent the model sign problem. The Polyakov-loop extended Nambu--Jona-Lasinio model is employed as the typical QCD effective model and then
the hybrid Monte-Carlo method is used to perform the path integration. To control the sign problem, the path optimization method is used with complexification of temporal gluon fields to modify the integral path in the complex space. We show that the average phase factor is well improved on the modified integral-path compared with that on the original one. This indicates that the complexification of temporal gluon fields may be enough to control the sign problem of QCD in the path optimization method.
We introduce the feedforward neural network to attack the sign problem via the path optimization method. The variables of integration is complexified and the integration path is optimized in the complexified space by minimizing the cost function whic
h reflects the seriousness of the sign problem. For the preparation and optimization of the integral path in multi-dimensional systems, we utilize the feedforward neural network. We examine the validity and usefulness of the method in the two-dimensional complex $lambda phi^4$ theory at finite chemical potential as an example of the quantum field theory having the sign problem. We show that the average phase factor is significantly enhanced after the optimization and then we can safely perform the hybrid Monte-Carlo method.
The path optimization has been proposed to weaken the sign problem which appears in some field theories such as finite density QCD. In this method, we optimize the integration path in complex plain to enhance the average phase factor. In this study,
we discuss the application of this method to low dimensional QCD as a first step of finite density QCD.
We investigate the sign problem in field theories by using the path optimization method with use of the neural network. For theories with the sign problem, integral in the complexified variable space is a promising approach to obtain a finite (non-ze
ro) average phase factor. In the path optimization method, the imaginary part of variables are given as functions of the real part, $y_i=y_i({x})$, and are optimized to enhance the average phase factor. The feedforward neural network can be used to give and to optimize functions with many variables. The combined framework, the path optimization with use of the neural network, is applied to the complex $phi^4$ theory at finite density, the 0+1 dimensional QCD at finite density, and the Polyakov loop extended Nambu-Jona-Lasinio (PNJL) model, all of which have the sign problem. In these cases, the average phase factor is found to be enhanced significantly. In the complex $phi^4$ theory, it is demonstrated that the number density is calculated at a high precision. On the optimized path, the imaginary part is found to have strong correlation with the real part on the temporal nearest neighbor site. In the 0+1 dimensional QCD, we compare the results in two different treatments of the link variable: optimization after the diagonal gauge fixing and optimization without the diagonal gauge fixing. These two methods show consistent eigenvalue distribution of the link variables. In the PNJL model with homogeneous field ansatz, finite volume results approach the mean field results as expected, and the phase transition behavior can be described.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
