Towards Optimal Convergence Rates for the Quantum Central Limit Theorem

• URL: http://arxiv.org/abs/2310.09812v2
• Date: Mon, 06 Jan 2025 16:02:00 GMT
• Title: Towards Optimal Convergence Rates for the Quantum Central Limit Theorem
• Authors: Salman Beigi, Hami Mehrabi,
• Abstract summary: We contribute to the problem of finding the optimal rate of convergence for this quantum central limit theorem. We introduce a notion of Poincar'e inequality for quantum states and show that if $rho$ satisfies this Poincar'e inequality, then $D(rhoboxplus n| rho_G)= mathcal O(n-1)$.
• Score: 3.130722489512822
• License:
• Abstract: The quantum central limit theorem for bosonic quantum systems states that the sequence of states $\rho^{\boxplus n}$ obtained from the $n$-fold convolution of a centered quantum state $\rho$ converges to a quantum Gaussian state $\rho_G$ that has the same first and second moments as $\rho$. In this paper, we contribute to the problem of finding the optimal rate of convergence for this quantum central limit theorem. We first show that if an $m$-mode quantum state has a finite moment of order $\max\{3, 2m\}$, then we have $\|\rho^{\boxplus n} - \rho_G\|_1=\mathcal O(n^{-1/2})$. We also introduce a notion of Poincar\'e inequality for quantum states and show that if $\rho$ satisfies this Poincar\'e inequality, then $D(\rho^{\boxplus n}\| \rho_G)= \mathcal O(n^{-1})$. By giving an explicit example, we verify that both these convergence rates are optimal.

Related papers

• Von Neumann Entropy and Quantum Algorithmic Randomness [0.0]
  A state $rho=(rho_n)_n=1infty$ is a sequence such that $rho_n$ is a density matrix on $n$ qubits. The von Neumann entropy $H(d)$ of a density matrix $d$ is the Shannon entropy of its eigenvalue distribution.
  arXiv  Detail & Related papers  (2024-12-24T18:09:45Z)
• Coherence in Property Testing: Quantum-Classical Collapses and Separations [42.44394412033434]
  We show that no tester can distinguish subset states of size $2n/8$ from $2n/4$ with probability better than $2-Theta(n)$. We also show connections to disentangler and quantum-to-quantum transformation lower bounds.
  arXiv  Detail & Related papers  (2024-11-06T19:52:15Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Optimal convergence rates in trace distance and relative entropy for the quantum central limit theorem [2.7855886538423182]
  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)$. 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)$.
  arXiv  Detail & Related papers  (2024-10-29T12:35:47Z)
• Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
  We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
  arXiv  Detail & Related papers  (2024-02-23T12:22:03Z)
• 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)
• Ultra-quantum coherent states in a single finite quantum system [0.0]
  A set of $n$ coherent states is introduced in a quantum system with $d$-dimensional Hilbert space $H(d)$. They resolve the identity, and also have a discrete isotropy property. A finite cyclic group acts on the set of these coherent states, and partitions it into orbits.
  arXiv  Detail & Related papers  (2023-11-17T10:05:00Z)
• Quantum Heavy-tailed Bandits [36.458771174473924]
  We study multi-armed bandits (MAB) and linear bandits (SLB) with heavy-tailed rewards and quantum reward. We first propose a new quantum mean estimator for heavy-tailed distributions, which is based on the Quantum Monte Carlo Estimator. Based on our quantum mean estimator, we focus on quantum heavy-tailed MAB and SLB and propose quantum algorithms based on the Upper Confidence Bound (UCB) framework.
  arXiv  Detail & Related papers  (2023-01-23T19:23:10Z)
• The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut [0.07614628596146598]
  We investigate the space complexity of two graph streaming problems: Max-Cut and its quantum analogue, Quantum Max-Cut. Our work resolves the quantum and classical approximability of quantum and classical Max-Cut using $textrmo(n)$ space.
  arXiv  Detail & Related papers  (2022-06-01T03:40:56Z)
• Uncertainties in Quantum Measurements: A Quantum Tomography [52.77024349608834]
  The observables associated with a quantum system $S$ form a non-commutative algebra $mathcal A_S$. It is assumed that a density matrix $rho$ can be determined from the expectation values of observables. Abelian algebras do not have inner automorphisms, so the measurement apparatus can determine mean values of observables.
  arXiv  Detail & Related papers  (2021-12-14T16:29:53Z)
• 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.