A c-theorem for the effective central charge in the R=1 replica limit, and applications to systems with measurement-induced randomness

• URL: http://arxiv.org/abs/2507.07959v1
• Date: Thu, 10 Jul 2025 17:41:31 GMT
• Title: A c-theorem for the effective central charge in the R=1 replica limit, and applications to systems with measurement-induced randomness
• Authors: Rushikesh A. Patil, Andreas W. W. Ludwig,
• Abstract summary: We show that the infrared value of $c_texteff$ is always $textitless$ than the central charge $c$ of the unperturbed CFT $S_*$.<n>We consider replica field theories in the limit of $R to 1$ replicas of the form above, shown by Nahum and Jacobsen.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a general theorem demonstrating non-perturbatively the decrease of the "effective central charge" $c_{\text{eff}}=(d c/dR)|_{R=1}$ under renormalization group (RG) flow in the $R\rightarrow1$ replica limit of a $R$-copy $2D$ conformal field theory (CFT) action $S_{*}$ perturbed by a replica interaction of the form $$-\mathbb{S}=-\sum_{a=1}^{R}S_{*}^{(a)}+\Delta\int d^2 x \sum_{\substack{a,b=1\\ a\neq b}}^{R}\varphi^{(a)}(x)\varphi^{(b)}(x).$$ Here $\varphi$ is a scaling field belonging to the CFT with action $S_*$ and the coupling $\Delta$ is relevant in the RG sense. We show that the infrared value of $c_{\text{eff}}$ is always $\textit{less}$ than the central charge $c$ of the unperturbed CFT $S_{*}$. We refer to this result as the "$c$-effective theorem". As an application of this theorem, we consider replica field theories in the limit of $R \to 1$ replicas of the form above, shown by Nahum and Jacobsen [arXiv:2504.01264] to describe $2D$ classical monitored systems, where measurements introduce a form of quenched randomness via Bayes' theorem. Lastly, we discuss a possible relationship of our theorem with the effective central charge $c_{\text{eff}}^{(R\rightarrow0)}=(dc/dR)|_{R=0}$ for the above replica action in the different $R\rightarrow0$ replica limit, which is of relevance to systems with generic uncorrelated impurity-type quenched disorder, as opposed to measurements.

Related papers

• Emergent random matrix universality in quantum operator dynamics [0.0]
  We prove the universality of eigenvalue correlations in random matrix theory.<n>We show that at low frequencies $G_n (z)$ is governed by the Bessel universality class from RMT.<n>We give a new numerical method, the spectral bootstrap, for approximating spectral functions from Lanczos coefficients.
  arXiv  Detail & Related papers  (2025-04-25T12:38:24Z)
• Monge-Kantorovich Fitting With Sobolev Budgets [6.748324975906262]
  We show that when $rho$ is concentrated near an $mtext-d$ set we may interpret this as a manifold learning problem with noisy data.<n>We quantify $nu$'s performance in approximating $rho$ via the Monge-Kantorovich $p$-cost $mathbbW_pp(rho, nu)$, and constrain the complexity by requiring $mathrmsupp nu$ to be coverable by an $f : mathbbRm
  arXiv  Detail & Related papers  (2024-09-25T01:30:16Z)
• On a Neural Implementation of Brenier's Polar Factorization [24.48716080522871]
  In 1991, Brenier proved a theorem that generalizes the polar decomposition for square matrices factored as PSD $times$ unitary -- to any vector field $F:mathbbRdright mathbbRdarrow.<n>We propose a practical implementation of the polar factorization theorem, and explore possible uses within machine learning.
  arXiv  Detail & Related papers  (2024-03-05T15:59:54Z)
• On the $O(\frac{\sqrt{d}}{T^{1/4}})$ Convergence Rate of RMSProp and Its Momentum Extension Measured by $\ell_1$ Norm [54.28350823319057]
  This paper considers the RMSProp and its momentum extension and establishes the convergence rate of $frac1Tsum_k=1T.<n>Our convergence rate matches the lower bound with respect to all the coefficients except the dimension $d$.<n>Our convergence rate can be considered to be analogous to the $frac1Tsum_k=1T.
  arXiv  Detail & Related papers  (2024-02-01T07:21:32Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• The Approximate Degree of DNF and CNF Formulas [95.94432031144716]
  For every $delta>0,$ we construct CNF and formulas of size with approximate degree $Omega(n1-delta),$ essentially matching the trivial upper bound of $n. We show that for every $delta>0$, these models require $Omega(n1-delta)$, $Omega(n/4kk2)1-delta$, and $Omega(n/4kk2)1-delta$, respectively.
  arXiv  Detail & Related papers  (2022-09-04T10:01:39Z)
• A General Derivative Identity for the Conditional Mean Estimator in Gaussian Noise and Some Applications [128.4391178665731]
  Several identities in the literature connect $E[bf X|bf Y=bf y]$ to other quantities such as the conditional variance, score functions, and higher-order conditional moments. The objective of this paper is to provide a unifying view of these identities.
  arXiv  Detail & Related papers  (2021-04-05T12:48:28Z)
• Universal tripartite entanglement in one-dimensional many-body systems [0.0]
  We introduce two related non-negative measures of tripartite entanglement $g$ and $h$. We prove structure theorems which show that states with nonzero $g$ or $h$ have nontrivial tripartite entanglement.
  arXiv  Detail & Related papers  (2020-11-24T02:59:14Z)
• Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals [49.60752558064027]
  We study the fundamental problems of agnostically learning halfspaces and ReLUs under Gaussian marginals. Our lower bounds provide strong evidence that current upper bounds for these tasks are essentially best possible.
  arXiv  Detail & Related papers  (2020-06-29T17:10:10Z)
• Robust Interference Management for SISO Systems with Multiple Over-the-Air Computations [16.52374405363812]
  We consider the over-the-air computation of sums over a shared complex-valued MAC. Finding appropriate Tx-Rx scaling factors balance between a low error in the computation of $s_n$ and the interference induced by it.
  arXiv  Detail & Related papers  (2020-04-21T11:15:26Z)
• A closer look at the approximation capabilities of neural networks [6.09170287691728]
  A feedforward neural network with one hidden layer is able to approximate any continuous function $f$ to any given approximation threshold $varepsilon$. We show that this uniform approximation property still holds even under seemingly strong conditions imposed on the weights.
  arXiv  Detail & Related papers  (2020-02-16T04:58:43Z)
• Curse of Dimensionality on Randomized Smoothing for Certifiable Robustness [151.67113334248464]
  We show that extending the smoothing technique to defend against other attack models can be challenging. We present experimental results on CIFAR to validate our theory.
  arXiv  Detail & Related papers  (2020-02-08T22:02:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.