English
Related papers

Related papers: Lagrangians, Renormalization, and Quantization in …

200 papers

Canonical Huffman code is an optimal prefix-free compression code whose codewords enumerated in the lexicographical order form a list of binary words in non-decreasing lengths. Gagie et al. (2015) gave a representation of this coding…

Data Structures and Algorithms · Computer Science 2021-08-19 Szymon Grabowski , Dominik Köppl

We use a very simple version of the optimized (linear) $\delta $ - expansion by scaling the free part of the Lagrangian with a variational parameter. This method is well suited to calculate the renormalized coupling constant in terms of the…

High Energy Physics - Phenomenology · Physics 2009-10-28 D. Gromes

We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected base length of the output quantum bit string (the base length…

Quantum Physics · Physics 2009-01-19 Markus Mueller , Caroline Rogers , Rajagopal Nagarajan

Universal variable-to-fixed (V-F) length coding of $d$-dimensional exponential family of distributions is considered. We propose an achievable scheme consisting of a dictionary, used to parse the source output stream, making use of the…

Information Theory · Computer Science 2017-08-02 Nematollah Iri , Oliver Kosut

We establish the renormalization property for essentially bounded solutions of the continuity equation associated to $BV$ fields in Wiener spaces, with values in the associated Cameron-Martin space; thus obtaining, by standard arguments,…

Analysis of PDEs · Mathematics 2013-10-22 Dario Trevisan

The coordinate-free formulation of canonical quantization, achieved by a flat-space Brownian motion regularization of phase-space path integrals, is extended to a special class of closed first-class constrained systems that is broad enough…

High Energy Physics - Theory · Physics 2009-10-30 John R. Klauder , Sergei V. Shabanov

We consider the problem of learned transform compression where we learn both, the transform as well as the probability distribution over the discrete codes. We utilize a soft relaxation of the quantization operation to allow for…

Machine Learning · Computer Science 2021-05-05 Magda Gregorová , Marc Desaules , Alexandros Kalousis

We continue the investigation from a previous paper concerning the super-renormalizablity of gauge models going to the third order of the perturbation theory. Here we consider only the Yang-Mills case and we prove that this property is true…

High Energy Physics - Theory · Physics 2013-01-17 Dan-Radu Grigore

We develop a general framework to prove Kraft-type inequalities for prefix-free permutation codes for source coding with various notions of permutation code and prefix. We also show that the McMillan-type converse theorem in most of these…

Information Theory · Computer Science 2016-01-27 Kristo Visk , Ago-Erik Riet

Effective Lagrangians were originally used only at the tree level as so-called phenomenological Lagrangians since they were in general non-renormalizable. Today they are treated as effective field theories valid below a characteristic…

High Energy Physics - Phenomenology · Physics 2009-10-30 Finn Ravndal

Over the last few years, machine learning unlocked previously infeasible features for compression, such as providing guarantees for users' privacy or tailoring compression to specific data statistics (e.g., satellite images or audio…

Information Theory · Computer Science 2026-03-25 Gergely Flamich

Universal fixed-to-variable lossless source coding for memoryless sources is studied in the finite blocklength and higher-order asymptotics regimes. Optimal third-order coding rates are derived for general fixed-to-variable codes and for…

Information Theory · Computer Science 2014-12-16 Oliver Kosut , Lalitha Sankar

The quantization of systems composed of transmission lines connected to lumped circuits poses significant challenges, arising from the interplay between continuous and discrete degrees of freedom. A widely adopted strategy, based on the…

Quantum Physics · Physics 2023-12-21 Carlo Forestiere , Giovanni Miano

We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of {\em subset selection}…

Data Structures and Algorithms · Computer Science 2015-12-22 Ariel Kulik , Hadas Shachnai , Gal Tamir

We analyze the renormalization-group (RG) flows of two effective Lagrangians, one for measurement induced transitions of monitored quantum systems and one for entanglement transitions in random tensor networks. These Lagrangians, previously…

Statistical Mechanics · Physics 2024-09-20 Adam Nahum , Kay Joerg Wiese

New proves of decoupling of massive fields in several quantum field theories are derived in the effective Lagrangian approach based on Wilson renormalization group. In the most interesting case of gauge theories with spontaneous symmetry…

High Energy Physics - Theory · Physics 2009-10-28 L. Girardello , A. Zaffaroni

We formulate the Exact Renormalization Group on the string world sheet for closed string backgrounds. The same techniques that were used for open strings is used here. There are some subtleties. One is that holomorphic factorization of the…

High Energy Physics - Theory · Physics 2015-06-16 B. Sathiapalan

A Lagrange multiplier field restricts the quantum corrections to the Einstein-Hilbert action at one-loop order, yielding a model that is renormalizable and unitary while reproducing the Einstein field equations in the classical limit.

High Energy Physics - Theory · Physics 2026-05-19 D. G. C. McKeon , F. T. Brandt , J. Frenkel , S. Martins-Filho

The principle of maximum entropy (Maxent) is often used to obtain prior probability distributions as a method to obtain a Gibbs measure under some restriction giving the probability that a system will be in a certain state compared to the…

Information Theory · Computer Science 2019-06-26 Hector Zenil , Narsis A. Kiani , Jesper Tegnér

In this work we consider discrete-time multiple-input multiple-output (MIMO) linear-quadratic-Gaussian (LQG) control where the feedback consists of variable length binary codewords. To simplify the decoder architecture, we enforce a strict…

Information Theory · Computer Science 2022-07-27 Travis C. Cuvelier , Takashi Tanaka , Robert W. Heath