Search NASA⌕ Search

DOE OSTI · 2575491

The Principle of Maximum Conformality Correctly Resolves the Renormalization-Scheme-Dependence Problem

Abstract

In this paper, we clarify a serious misinterpretation and consequent misuse of the Principle of Maximum Conformality (PMC), which also can serve as a mini-review of PMC. In a recently published article, P. M. Stevenson has claimed that “the PMC is ineffective and does nothing to resolve the renormalization-scheme-dependence problem”, concluding incorrectly that the success of PMC predictions is due to the PMC being a “laborious, ad hoc, and back-door” version of the Principle of Minimal Sensitivity (PMS). We show that such conclusions are incorrect, deriving from a misinterpretation of the PMC and an overestimation of the applicability of the PMS. The purpose of the PMC is to achieve precise fixed-order pQCD predictions, free from conventional renormalization schemes and scale ambiguities. We demonstrate that the PMC predictions satisfy all the self-consistency conditions of the renormalization group and standard renormalization-group invariance; the PMC predictions are thus independent of any initial choice of renormalization scheme and scale. The scheme independence of the PMC is also ensured by commensurate scale relations, which relate different observables to each other. Moreover, in the Abelian limit, the PMC dovetails into the well-known Gell-Mann–Low framework, a method universally revered for its precision in QED calculations. Due to the elimination of factorially divergent renormalon terms, the PMC series not only attains a convergence behavior far superior to that of its conventional counterparts but also deftly curtails any residual scale dependence caused by the unknown higher-order terms. This refined convergence, coupled with its robust suppression of residual uncertainties, furnishes a sound and reliable foundation for estimating the contributions from unknown higher-order terms. Anchored in the bedrock of standard renormalization-group invariance, the PMC simultaneously eradicates the factorial divergences and eliminates superfluous systematic errors, which inversely provides a good foundation for achieving high-precision pQCD predictions. Consequently, owing to its rigorous theoretical underpinnings, the PMC is eminently applicable to virtually all high-energy hadronic processes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yan, Jiang [Chongqing Univ. (China)] (ORCID:0000000192478850), Brodsky, Stanley J. [SLAC National Accelerator Laboratory (SLAC), Menlo Park, CA (United States); Stanford Univ., CA (United States)] (ORCID:0000000187863172), Giustino, Leonardo Di [University of Insubria (Italy); Istituto Nazionale di Fisica Nucleare (INFN), Milano (Italy)] (ORCID:000000017746918X), Ratcliffe, Philip G. [University of Insubria (Italy); Istituto Nazionale di Fisica Nucleare (INFN), Milano (Italy)] (ORCID:0000000219135322), Wang, Shengquan [Guizhou Minzu University, Guiyang (China)], Wu, Xinggang [Chongqing Univ. (China)] (ORCID:0000000273431907). 2025-03-09. The Principle of Maximum Conformality Correctly Resolves the Renormalization-Scheme-Dependence Problem. https://doi.org/10.3390/sym17030411

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

Vidyut3d: A GPU accelerated fluid solver for non-equilibrium plasmas on adaptive grids

We present the numerical methods, programming methodology, verification, and performance assessment of a non-equilibrium plasma fluid solver that can effectively utilize current and upcoming central processing and graphics processing unit (CPU+GPU) architectures, in this work. Our plasma fluid model solves the coupled conservation equations for species transport, electrostatic Poisson and electron temperature on adaptive Cartesian grids. Our solver is written using performance portable adaptive-grid/particle management library, AMReX, and is portable over widely available vendor specific GPU architectures. We present verification of our solver using method of manufactured solutions that indicate formal second order accuracy with central diffusion and fifth-order weighted-essentially-non-oscillatory (WENO) advection scheme. We also verify our solver with published literature on capacitive discharges and atmospheric pressure streamer propagation. We demonstrate the use of our solver on two 3D simulation cases: an atmospheric streamer propagation in Ar-H2 mixtures and a low pressure three-electrode radio frequency reactor. Our performance studies on three different CPU+GPU architectures indicate ~ 150-400X speed-up using AMD and NVIDIA GPUs per time step compared to a single CPU core for a 4 million cell simulation with 15 species.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool \texttt{JuliQAOA} to perform classical angle finding for up to $49$ QAOA layers ($p$). Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States (PEPS), Matrix Product State (MPS), and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of $p$ - there are many cases where the performance temporarily decreases as a function of $p$ - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the $100+$ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to $p=5$ on \texttt{ibm\_fez}, up to $p=9$ on \texttt{ibm\_torino}, and up to $p=10$ on \texttt{ibm\_pittsburgh}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗