scholarly journals Erratum: Hard thermal loops, to quadratic order, in the background of a spatial ’t Hooft loop [Phys. Rev. D 80 , 036004 (2009)]

2020 ◽  
Vol 102 (5) ◽  
Author(s):  
Yoshimasa Hidaka ◽  
Robert D. Pisarski
2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
Jens O. Andersen ◽  
Magdalena Eriksson ◽  
Anders Tranberg

Abstract Inflation is often described through the dynamics of a scalar field, slow-rolling in a suitable potential. Ultimately, this inflaton must be identified with the expectation value of a quantum field, evolving in a quantum effective potential. The shape of this potential is determined by the underlying tree-level potential, dressed by quantum corrections from the scalar field itself and the metric perturbations. Following [1], we compute the effective scalar field equations and the corrected Friedmann equations to quadratic order in both scalar field, scalar metric and tensor perturbations. We identify the quantum corrections from different sources at leading order in slow-roll, and estimate their magnitude in benchmark models of inflation. We comment on the implications of non-minimal coupling to gravity in this context.


2020 ◽  
Vol 15 (1) ◽  
pp. 4-17
Author(s):  
Jean-François Biasse ◽  
Xavier Bonnetain ◽  
Benjamin Pring ◽  
André Schrottenloher ◽  
William Youmans

AbstractWe propose a heuristic algorithm to solve the underlying hard problem of the CSIDH cryptosystem (and other isogeny-based cryptosystems using elliptic curves with endomorphism ring isomorphic to an imaginary quadratic order 𝒪). Let Δ = Disc(𝒪) (in CSIDH, Δ = −4p for p the security parameter). Let 0 < α < 1/2, our algorithm requires:A classical circuit of size $2^{\tilde{O}\left(\log(|\Delta|)^{1-\alpha}\right)}.$A quantum circuit of size $2^{\tilde{O}\left(\log(|\Delta|)^{\alpha}\right)}.$Polynomial classical and quantum memory.Essentially, we propose to reduce the size of the quantum circuit below the state-of-the-art complexity $2^{\tilde{O}\left(\log(|\Delta|)^{1/2}\right)}$ at the cost of increasing the classical circuit-size required. The required classical circuit remains subexponential, which is a superpolynomial improvement over the classical state-of-the-art exponential solutions to these problems. Our method requires polynomial memory, both classical and quantum.


2001 ◽  
Vol 16 (27) ◽  
pp. 1751-1759 ◽  
Author(s):  
XIN WANG ◽  
JIARONG LI ◽  
JUEPING LIU

We present analytical results for the equation of state for hot gluon plasma obtained with an effective perturbation based on hard thermal loops resummation theory. The effective two-loop results depend on Debye screening and finite width of gluons as physical parameters. Considering next-to-leading Debye mass and finite width effects, we find the equation of state to be in good agreement with recent lattice results for T≳2T c .


1994 ◽  
Vol 72 (22) ◽  
pp. 3461-3463 ◽  
Author(s):  
P. F. Kelly ◽  
Q. Liu ◽  
C. Lucchesi ◽  
C. Manuel

2020 ◽  
Vol 23 (3) ◽  
Author(s):  
Paul-Hermann Balduf

Abstract We consider a scalar quantum field ϕ with arbitrary polynomial self-interaction in perturbation theory. If the field variable ϕ is repaced by a global diffeomorphism ϕ(x) = ρ(x) + a1ρ2(x) + …, this field ρ obtains infinitely many additional interaction vertices. We propose a systematic way to compute connected amplitudes for theories involving vertices which are able to cancel adjacent edges. Assuming tadpole graphs vanish, we show that the S-matrix of ρ coincides with the one of ϕ without using path-integral arguments. This result holds even if the underlying field has a propagator of higher than quadratic order in the momentum. The diffeomorphism can be tuned to cancel all contributions of an underlying ϕt-type self interaction at one fixed external offshell momentum, rendering ρ a free theory at this momentum. Finally, we mention one way to extend the diffeomorphism to a non-diffeomorphism transformation involving derivatives without spoiling the combinatoric structure of the global diffeomorphism.


2002 ◽  
Vol 359 (5-6) ◽  
pp. 355-528 ◽  
Author(s):  
Jean-Paul Blaizot ◽  
Edmond Iancu

2000 ◽  
Vol 61 (5) ◽  
Author(s):  
D. Bödeker ◽  
Guy D. Moore ◽  
K. Rummukainen

Author(s):  
SUCHENDRA M. BHANDARKAR ◽  
ANDREAS SIEBERT

Segmentation, feature extraction, recognition and localization are the four stages in range image understanding. Conventional approaches to range image understanding have treated these stages in isolation with a largely bottom-up flow of control and data through these various stages. Strictly bottom-up approaches have proved to be fragile in the face of errors in segmentation due to noise and limitations on sensor resolution and accuracy. Synergetic interaction of these various stages is essential for an image understanding system to exhibit robust behavior. This paper describes the design and implementation of INTEGRA, a range image understanding system that attempts to exploit the synergy between the various stages in the image understanding process. The salient features of INTEGRA are: (i) A synergetic combination of edge- and surface-based segmentation processes that results in more accurate segmentation than would have been possible with either of them alone and (ii) the ability to correct errors made during segmentation in the matching and localization stages. INTEGRA at this time, is limited to recognition and localization of polyhedral objects and is in the process of being enhanced to handle objects with curved surfaces of quadratic order such as spherical, ellipsoidal, cylindrical, and conical surfaces. Experimental results on real range images containing single and multiple polyhedral objects are presented. Future enhancements to INTEGRA are discussed.


Sign in / Sign up

Export Citation Format

Share Document