اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAutomated computation meets hot QCD
45
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give a short review on recent progress in the field of automated calculations in finite-temperature field theory, where integration-by-parts techniques have proven (almost) as useful as in the zero-temperature case. Furthermore, we provide one concrete example of an evaluation of a new three-loop master sum-integral that exhibits maximal divergence.
قيم البحث
اقرأ أيضاً
Theoretical predictions for scattering processes with multi-particle final states at next-to-leading order (NLO) in perturbative QCD are essential to fully exploit the physics potential of present and future high-energy colliders. The status of NLO QCD calculations and tools is reviewed.
In this talk, I present the status of attempts to analyze the behavior of the so-called spatial t Hooft loop, which can be taken as an order parameter for the deconfinement phase transition in pure SU(N) gauge theory. While lattice data show a striki
ngly universal scaling of extracted k-string tensions for various values of k and N, the analytic approach to these observables might need some refinement.
We derive a static potential for a heavy quark-antiquark pair propagating in Minkowski time at finite temperature, by defining a suitable gauge-invariant Greens function and computing it to first non-trivial order in Hard Thermal Loop resummed pertur
bation theory. The resulting Debye-screened potential could be used in models that attempt to describe the ``melting of heavy quarkonium at high temperatures. We show, in particular, that the potential develops an imaginary part, implying that thermal effects generate a finite width for the quarkonium peak in the dilepton production rate. For quarkonium with a very heavy constituent mass M, the width can be ignored for T lsim g^2 M/12pi, where g^2 is the strong gauge coupling; for a physical case like bottomonium, it could become important at temperatures as low as 250 MeV. Finally, we point out that the physics related to the finite width originates from the Landau-damping of low-frequency gauge fields, and could be studied non-perturbatively by making use of the classical approximation.
The derivation of the Feynman rules for lattice perturbation theory from actions and operators is complicated, especially for highly improved actions such as HISQ. This task is, however, both important and particularly suitable for automation. We des
cribe a suite of software to generate and evaluate Feynman rules for a wide range of lattice field theories with gluons and (relativistic and/or heavy) quarks. Our programs are capable of dealing with actions as complicated as (m)NRQCD and HISQ. Automated differentiation methods are used to calculate also the derivatives of Feynman diagrams.
Secure multi-party computation (MPC) allows parties to perform computations on data while keeping that data private. This capability has great potential for machine-learning applications: it facilitates training of machine-learning models on private
data sets owned by different parties, evaluation of one partys private model using another partys private data, etc. Although a range of studies implement machine-learning models via secure MPC, such implementations are not yet mainstream. Adoption of secure MPC is hampered by the absence of flexible software frameworks that speak the language of machine-learning researchers and engineers. To foster adoption of secure MPC in machine learning, we present CrypTen: a software framework that exposes popular secure MPC primitives via abstractions that are common in modern machine-learning frameworks, such as tensor computations, automatic differentiation, and modular neural networks. This paper describes the design of CrypTen and measure its performance on state-of-the-art models for text classification, speech recognition, and image classification. Our benchmarks show that CrypTens GPU support and high-performance communication between (an arbitrary number of) parties allows it to perform efficient private evaluation of modern machine-learning models under a semi-honest threat model. For example, two parties using CrypTen can securely predict phonemes in speech recordings using Wav2Letter faster than real-time. We hope that CrypTen will spur adoption of secure MPC in the machine-learning community.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
