Towards Optimal Convergence Rates for the Quantum Central Limit Theorem
- URL: http://arxiv.org/abs/2310.09812v1
- Date: Sun, 15 Oct 2023 12:02:43 GMT
- Title: Towards Optimal Convergence Rates for the Quantum Central Limit Theorem
- Authors: Salman Beigi, Hami Mehrabi
- Abstract summary: 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.
- Score: 3.6985338895569204
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum central limit theorem for bosonic 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 optimal rate of convergence for this theorem. We first
show that if an $m$-mode quantum state has a finite moment of order $\max\{3,
2m\}$, then we have $\|\rho - \rho_G\|_1=\mathcal O(n^{-1/2})$. By giving an
explicit example, we verify that this convergence rate is optimal. 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\| \rho_G)= \mathcal
O(n^{-1})$.
Related papers
- 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) - A generic quantum Wielandt's inequality [0.9975341265604578]
It is conjectured that $k$ should be of order $mathcalO(n2)$ in general.
We provide a generic version of quantum Wielandt's inequality, which gives the optimal length with probability one.
We shed new light on a long-standing open problem for Projected Entangled Pair State.
arXiv Detail & Related papers (2023-01-19T18:57:32Z) - Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling [30.53587208999909]
We give a quantum algorithm for computing an $epsilon$-approximate Nash equilibrium of a zero-sum game in a $m times n$ payoff matrix with bounded entries.
Given a standard quantum oracle for accessing the payoff matrix our algorithm runs in time $widetildeO(sqrtm + ncdot epsilon-2.5 + epsilon-3)$ and outputs a classical representation of the $epsilon$-approximate Nash equilibrium.
arXiv Detail & Related papers (2023-01-10T02:56:49Z) - 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) - The Principle of equal Probabilities of Quantum States [0.0]
Boltzmann law $P(epsilon) = frac1langle epsilon rangle-fracepsilonlangle epsilon rangle ; ; ;;;; 0leq epsilon +infty$ where $langle epsilon rangle = E/N$.
kappa quanta, is given by $p(kappa)=fracdisplaystyle binomN+s
arXiv Detail & Related papers (2021-11-17T17:23:46Z) - Stochastic behavior of outcome of Schur-Weyl duality measurement [45.41082277680607]
We focus on the measurement defined by the decomposition based on Schur-Weyl duality on $n$ qubits.
We derive various types of distribution including a kind of central limit when $n$ goes to infinity.
arXiv Detail & Related papers (2021-04-26T15:03:08Z) - PAGE: A Simple and Optimal Probabilistic Gradient Estimator for
Nonconvex Optimization [33.346773349614715]
We propose a novel ProAbistic Gradient Estorimat (fract) for nonepsOmega.
It is easy to implement as it is designed via a small PAGE to vanilla SGD.
Not only converges much faster than SGD in training but also achieves the higher accuracy.
arXiv Detail & Related papers (2020-08-25T09:11:31Z) - 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.