Strong Converse Bounds for Compression of Mixed States
- URL: http://arxiv.org/abs/2206.09415v1
- Date: Sun, 19 Jun 2022 14:38:37 GMT
- Title: Strong Converse Bounds for Compression of Mixed States
- Authors: Zahra Baghali Khanian
- Abstract summary: We consider many copies of a general mixed-state source $rhoAR$ shared between an encoder and an inaccessible reference system $R$.
For a bipartite state $rhoAR$, we define a new quantity $E_alpha,p(A:R)_rho$.
For any rate below the regularization $lim_alpha to 1+E_alpha,pinfty(A:R)_rho$, the fidelity for the visible compression of ensembles of mixed states exponentially
- Score: 3.04585143845864
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We consider many copies of a general mixed-state source $\rho^{AR}$ shared
between an encoder and an inaccessible reference system $R$. We obtain a strong
converse bound for the compression of this source. This immediately implies a
strong converse for the blind compression of ensembles of mixed states since
this is a special case of the general mixed-state source $\rho^{AR}$. Moreover,
we consider the visible compression of ensembles of mixed states. For a
bipartite state $\rho^{AR}$, we define a new quantity
$E_{\alpha,p}(A:R)_{\rho}$ for $\alpha \in (0,1)\cup (1,\infty)$ as the
$\alpha$-R\'enyi generalization of the entanglement of purification
$E_{p}(A:R)_{\rho}$. For $\alpha=1$, we define
$E_{1,p}(A:R)_{\rho}:=E_{p}(A:R)_{\rho}$. We show that for any rate below the
regularization $\lim_{\alpha \to
1^+}E_{\alpha,p}^{\infty}(A:R)_{\rho}:=\lim_{\alpha \to 1^+} \lim_{n \to
\infty} \frac{E_{\alpha,p}(A^n:R^n)_{\rho^{\otimes n}}}{n}$ the fidelity for
the visible compression of ensembles of mixed states exponentially converges to
zero. We conclude that if this regularized quantity is continuous with respect
to $\alpha$, namely, if $\lim_{\alpha \to
1^+}E_{\alpha,p}^{\infty}(A:R)_{\rho}=E_{p}^{\infty}(A:R)_{\rho}$, then the
strong converse holds for the visible compression of ensembles of mixed states.
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) - 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) - Mapping the space of quantum expectation values [0.0]
For a quantum system with Hilbert space $cal H$ of dimension $N$, a basic question is to understand the set $E_S subset mathbbRn$ of points $vece$.
A related question is to determine whether a given set of expectation values $vec$ lies in $E_S$.
arXiv Detail & Related papers (2023-10-19T19:17:42Z) - $\ell_p$-Regression in the Arbitrary Partition Model of Communication [59.89387020011663]
We consider the randomized communication complexity of the distributed $ell_p$-regression problem in the coordinator model.
For $p = 2$, i.e., least squares regression, we give the first optimal bound of $tildeTheta(sd2 + sd/epsilon)$ bits.
For $p in (1,2)$,we obtain an $tildeO(sd2/epsilon + sd/mathrmpoly(epsilon)$ upper bound.
arXiv Detail & Related papers (2023-07-11T08:51:53Z) - Separable Ball around any Full-Rank Multipartite Product State [0.0]
We find a finite-sized closed ball of separable states centered around $rho_rm prod$ whose radius is $beta.
Using the separable balls around the full-rank product states, we discuss the existence and possible sizes of separable balls around any multipartite separable states.
arXiv Detail & Related papers (2023-05-09T18:00:02Z) - Petz-Rényi Relative Entropy of Thermal States and their Displacements [0.0]
Petz-R'enyi $alpha$-relative entropy $D_alpha(rho||sigma)$ of two displaced thermal states is finite.
We adopt the convention that the minimum of an empty set is equal infinity.
arXiv Detail & Related papers (2023-03-06T18:58:25Z) - Enlarging the notion of additivity of resource quantifiers [62.997667081978825]
Given a quantum state $varrho$ and a quantifier $cal E(varrho), it is a hard task to determine $cal E(varrhootimes N)$.
We show that the one shot distillable entanglement of certain spherically symmetric states can be quantitatively approximated by such an augmented additivity.
arXiv Detail & Related papers (2022-07-31T00:23:10Z) - Low-Rank Approximation with $1/\epsilon^{1/3}$ Matrix-Vector Products [58.05771390012827]
We study iterative methods based on Krylov subspaces for low-rank approximation under any Schatten-$p$ norm.
Our main result is an algorithm that uses only $tildeO(k/sqrtepsilon)$ matrix-vector products.
arXiv Detail & Related papers (2022-02-10T16:10:41Z) - On the Complexity of Minimizing Convex Finite Sums Without Using the
Indices of the Individual Functions [62.01594253618911]
We exploit the finite noise structure of finite sums to derive a matching $O(n2)$-upper bound under the global oracle model.
Following a similar approach, we propose a novel adaptation of SVRG which is both emphcompatible with oracles, and achieves complexity bounds of $tildeO(n2+nsqrtL/mu)log (1/epsilon)$ and $O(nsqrtL/epsilon)$, for $mu>0$ and $mu=0$
arXiv Detail & Related papers (2020-02-09T03:39:46Z)
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.