Optimal convergence rates in trace distance and relative entropy for the quantum central limit theorem

• URL: http://arxiv.org/abs/2410.21998v2
• Date: Mon, 21 Jul 2025 15:32:49 GMT
• Title: Optimal convergence rates in trace distance and relative entropy for the quantum central limit theorem
• Authors: Salman Beigi, Milad M. Goodarzi, Hami Mehrabi,
• Abstract summary: We show that for a centered $m$-mode quantum state with finite third-order moments, the trace distance between $rhoboxplus n$ and $rho_G$ decays at the optimal rate of $mathcalO(n-1/2)$.<n>For states with finite fourth-order moments, we prove that the relative entropy between $rhoboxplus n$ and $rho_G$ decays at the optimal rate of $mathcalO(n-1)$.
• Score: 2.7855886538423182
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A quantum analogue of the Central Limit Theorem (CLT), first introduced by Cushen and Hudson (1971), states that the $n$-fold convolution $\rho^{\boxplus n}$ of an $m$-mode quantum state $\rho$, with zero first moments and finite second moments, converges weakly, as $n$ increases, to a Gaussian state $\rho_G$ with the same first and second moments. Recently, this result has been extended with estimates of the convergence rate in various distance measures. In this paper, we establish optimal rates of convergence in both the trace distance and quantum relative entropy. Specifically, we show that for a centered $m$-mode quantum state with finite third-order moments, the trace distance between $\rho^{\boxplus n}$ and $\rho_G$ decays at the optimal rate of $\mathcal{O}(n^{-1/2})$. Furthermore, for states with finite fourth-order moments (order $4+\delta$ for an arbitrary small $\delta>0$ if $m>1$), we prove that the relative entropy between $\rho^{\boxplus n}$ and $\rho_G$ decays at the optimal rate of $\mathcal{O}(n^{-1})$. Both of these rates are proven to be optimal, even when assuming the finiteness of all moments of $\rho$. These results relax previous assumptions on higher-order moments, yielding convergence rates that match the best known results in the classical setting. By giving explicit examples we also show that our moment assumptions are essentially minimal. We show that for any $\theta>0$, there exists a quantum state $\rho$ with finite moments of order less than $3-\theta$, such that the convergence rate of $\rho^{\boxplus n}$ to $\rho_G$ in trace distance is not $\mathcal O(n^{-1/2})$. Similarly, we show that for any $\theta>0$, there exists a quantum state $\rho$ with finite moments of order less than $4-\theta$, such that the relative entropy between $\rho^{\boxplus n}$ to $\rho_G$ does not decay at the rate $\mathcal O(n^{-1})$.

Related papers

• Out-of-equilibrium dynamics across the first-order quantum transitions of one-dimensional quantum Ising models [0.0]
  We study the out-of-equilibrium dynamics of one-dimensional quantum Ising models in a transverse field $g$.<n>We consider nearest-neighbor Ising chains of size $L$ with periodic boundary conditions.
  arXiv  Detail & Related papers  (2025-04-14T20:00:27Z)
• Measuring quantum relative entropy with finite-size effect [53.64687146666141]
  We study the estimation of relative entropy $D(rho|sigma)$ when $sigma$ is known.<n>Our estimator attains the Cram'er-Rao type bound when the dimension $d$ is fixed.
  arXiv  Detail & Related papers  (2024-06-25T06:07:20Z)
• Further Understanding of a Local Gaussian Process Approximation: Characterising Convergence in the Finite Regime [1.3518297878940662]
  We show that common choices of kernel functions for a highly accurate and massively scalable GPnn regression model exhibit gradual convergence to behaviour as dataset-size $n$ increases. Similar bounds can be found under model misspecification and combined to give overall rates of convergence of both MSE and an important calibration metric.
  arXiv  Detail & Related papers  (2024-04-09T10:47:01Z)
• Optimal and Efficient Algorithms for Decentralized Online Convex Optimization [51.00357162913229]
  Decentralized online convex optimization (D-OCO) is designed to minimize a sequence of global loss functions using only local computations and communications.<n>We develop a novel D-OCO algorithm that can reduce the regret bounds for convex and strongly convex functions to $tildeO(nrho-1/4sqrtT)$ and $tildeO(nrho-1/2log T)$.<n>Our analysis reveals that the projection-free variant can achieve $O(nT3/4)$ and $O(n
  arXiv  Detail & Related papers  (2024-02-14T13:44:16Z)
• On the $O(\frac{\sqrt{d}}{T^{1/4}})$ Convergence Rate of RMSProp and Its Momentum Extension Measured by $\ell_1$ Norm [59.65871549878937]
  This paper considers the RMSProp and its momentum extension and establishes the convergence rate of $frac1Tsum_k=1T. Our convergence rate matches the lower bound with respect to all the coefficients except the dimension $d$. Our convergence rate can be considered to be analogous to the $frac1Tsum_k=1T.
  arXiv  Detail & Related papers  (2024-02-01T07:21:32Z)
• The classical limit of Quantum Max-Cut [0.18416014644193066]
  We show that the limit of large quantum spin $S$ should be understood as a semiclassical limit. We present two families of classical approximation algorithms for $mathrmQMaxCut_S$ based on rounding the output of a semidefinite program to a product of Bloch coherent states.
  arXiv  Detail & Related papers  (2024-01-23T18:53:34Z)
• Towards Optimal Convergence Rates for the Quantum Central Limit Theorem [3.6985338895569204]
  Quantum central limit theorem for bosonic systems states that the sequence of states $rhoboxplus n$ obtained from the $n$-fold convolution of a centered quantum state converges to a quantum Gaussian state. In this paper, we contribute to the problem of finding optimal rate of convergence for this theorem.
  arXiv  Detail & Related papers  (2023-10-15T12:02:43Z)
• Quantum connection, charges and virtual particles [65.268245109828]
  A quantum bundle $L_hbar$ is endowed with a connection $A_hbar$ and its sections are standard wave functions $psi$ obeying the Schr"odinger equation. We will lift the bundles $L_Cpm$ and connection $A_hbar$ on them to the relativistic phase space $T*R3,1$ and couple them to the Dirac spinor bundle describing both particles and antiparticles.
  arXiv  Detail & Related papers  (2023-10-10T10:27:09Z)
• Observing super-quantum correlations across the exceptional point in a single, two-level trapped ion [48.7576911714538]
  In two-level quantum systems - qubits - unitary dynamics theoretically limit these quantum correlations to $2qrt2$ or 1.5 respectively. Here, using a dissipative, trapped $40$Ca$+$ ion governed by a two-level, non-Hermitian Hamiltonian, we observe correlation values up to 1.703(4) for the Leggett-Garg parameter $K_3$. These excesses occur across the exceptional point of the parity-time symmetric Hamiltonian responsible for the qubit's non-unitary, coherent dynamics.
  arXiv  Detail & Related papers  (2023-04-24T19:44:41Z)
• Geometric relative entropies and barycentric Rényi divergences [16.385815610837167]
  monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure. We show that monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure.
  arXiv  Detail & Related papers  (2022-07-28T17:58:59Z)
• Phase estimation with limited coherence [0.0]
  For pure states, we give the minimum estimation variance attainable, $V(C)$, and the optimal state, in the limit when the probe system size, $n$, is large. We show that the variance exhibits a Heisenberg-like scaling, $V(C) sim a_n/C2$, where $a_n$ decreases to $pi2/3$ as $n$ increases, leading to a dimension-independent relation.
  arXiv  Detail & Related papers  (2022-07-12T16:36:59Z)
• A New Look at the $C^{0}$-formulation of the Strong Cosmic Censorship Conjecture [68.8204255655161]
  We argue that for generic black hole parameters as initial conditions for Einstein equations, the metric is $C0$-extendable to a larger Lorentzian manifold. We prove it violates the "complexity=volume" conjecture for a low-temperature hyperbolic AdS$_d+1$ black hole dual to a CFT living on a ($d-1$)-dimensional hyperboloid $H_d-1$.
  arXiv  Detail & Related papers  (2022-06-17T12:14:33Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Fidelity and entanglement entropy for infinite-order phase transitions [4.453923176362749]
  We study the fidelity and the entanglement entropy for the ground states of quantum systems that have infinite-order quantum phase transitions. In particular, we consider the quantum O(2) model with a spin-$S$ truncation, where there is an infinite-order Gaussian (IOG) transition for $S = 1$. We show that the height of the peak in the fidelity susceptibility ($chi_F$) converges to a finite thermodynamic value as a power law of $1/L$ for the IOG transition and as $1/ln(L)$ for BKT transitions.
  arXiv  Detail & Related papers  (2021-08-23T06:28:50Z)
• Asymptotics of Entropy-Regularized Optimal Transport via Chaos Decomposition [1.7188280334580195]
  This paper is on the properties of a discrete Schr"odinger bridge as $N$ tends to infinity. We derive the first two error terms of orders $N-1/2$ and $N-1$, respectively. The kernels corresponding to the first and second order chaoses are given by Markov operators which have natural interpretations in the Sinkhorn algorithm.
  arXiv  Detail & Related papers  (2020-11-17T21:55:46Z)
• An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
  We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
  arXiv  Detail & Related papers  (2020-08-24T06:50:57Z)
• The Convergence Indicator: Improved and completely characterized parameter bounds for actual convergence of Particle Swarm Optimization [68.8204255655161]
  We introduce a new convergence indicator that can be used to calculate whether the particles will finally converge to a single point or diverge. Using this convergence indicator we provide the actual bounds completely characterizing parameter regions that lead to a converging swarm.
  arXiv  Detail & Related papers  (2020-06-06T19:08:05Z)
• Non-Hermitian and Zeno limit of quantum systems under rapid measurements [0.0]
  We find a scaling collapse in $F(t)$ with respect to $tau$ and compute the total detection probability as well as the moments of the first detection time probability density $F(t)$ in the Zeno limit. We show that both solutions approach the same result in this small $tau$ limit, as long as the initial state $| psi_textin rangle$ is not parallel to the detection state.
  arXiv  Detail & Related papers  (2020-05-01T15:59:13Z)
• A Simple Convergence Proof of Adam and Adagrad [74.24716715922759]
  We show a proof of convergence between the Adam Adagrad and $O(d(N)/st)$ algorithms. Adam converges with the same convergence $O(d(N)/st)$ when used with the default parameters.
  arXiv  Detail & Related papers  (2020-03-05T01:56:17Z)
• Quantum Coupon Collector [62.58209964224025]
  We study how efficiently a $k$-element set $Ssubseteq[n]$ can be learned from a uniform superposition $|Srangle of its elements. We give tight bounds on the number of quantum samples needed for every $k$ and $n$, and we give efficient quantum learning algorithms.
  arXiv  Detail & Related papers  (2020-02-18T16:14:55Z)

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.