Error exponents for entanglement transformations from degenerations

• URL: http://arxiv.org/abs/2409.01130v1
• Date: Mon, 2 Sep 2024 10:08:21 GMT
• Title: Error exponents for entanglement transformations from degenerations
• Authors: Dávid Bugár, Péter Vrana,
• Abstract summary: This paper explores the trade-off relation between the rate and the strong converse exponent for LOCC transformations between pure multipartite states. We characterize anally optimal choice of parameters and derive a single-letter expression for the resulting protocol.
• Score: 10.435741631709403
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper explores the trade-off relation between the rate and the strong converse exponent for asymptotic LOCC transformations between pure multipartite states. Any single-copy probabilistic transformation between a pair of states implies that an asymptotic transformation at rate 1 is possible with an exponentially decreasing success probability. However, it is possible that an asymptotic transformation is feasible with nonzero probability, but there is no transformation between any finite number of copies with the same rate, even probabilistically. In such cases it is not known if the optimal success probability decreases exponentially or faster. A fundamental tool for showing the feasibility of an asymptotic transformation is degeneration. Any degeneration gives rise to a sequence of stochastic LOCC transformations from copies of the initial state plus a sublinear number of GHZ states to the same number of copies of the target state. These protocols involve parameters that can be freely chosen, but the choice affects the success probability. In this paper, we characterize an asymptotically optimal choice of the parameters and derive a single-letter expression for the error exponent of the resulting protocol. In particular, this implies an exponential lower bound on the success probability when the stochastic transformation arises from a degeneration.

Related papers

• Unsupervised Representation Learning from Sparse Transformation Analysis [79.94858534887801]
  We propose to learn representations from sequence data by factorizing the transformations of the latent variables into sparse components. Input data are first encoded as distributions of latent activations and subsequently transformed using a probability flow model.
  arXiv  Detail & Related papers  (2024-10-07T23:53:25Z)
• On the Convergence of Gradient Descent for Large Learning Rates [55.33626480243135]
  We show that convergence is impossible when a fixed step size is used. We provide a proof of this in the case of linear neural networks with a squared loss. We also prove the impossibility of convergence for more general losses without requiring strong assumptions such as Lipschitz continuity for the gradient.
  arXiv  Detail & Related papers  (2024-02-20T16:01:42Z)
• Reversibility of quantum resources through probabilistic protocols [5.2178708158547025]
  We show that it is possible to reversibly interconvert all states in general quantum resource theories. Our methods are based on connecting the transformation rates under probabilistic protocols with strong converse rates for deterministic transformations.
  arXiv  Detail & Related papers  (2023-09-13T18:00:00Z)
• High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance [59.211456992422136]
  We propose algorithms with high-probability convergence results under less restrictive assumptions. These results justify the usage of the considered methods for solving problems that do not fit standard functional classes in optimization.
  arXiv  Detail & Related papers  (2023-02-02T10:37:23Z)
• Overcoming entropic limitations on asymptotic state transformations through probabilistic protocols [12.461503242570641]
  We show that it is no longer the case when one allows protocols that may only succeed with some probability. We show that this is no longer the case when one allows protocols that may only succeed with some probability.
  arXiv  Detail & Related papers  (2022-09-07T18:00:00Z)
• Deterministic Gaussian conversion protocols for non-Gaussian single-mode resources [58.720142291102135]
  We show that cat and binomial states are approximately equivalent for finite energy, while this equivalence was previously known only in the infinite-energy limit. We also consider the generation of cat states from photon-added and photon-subtracted squeezed states, improving over known schemes by introducing additional squeezing operations.
  arXiv  Detail & Related papers  (2022-04-07T11:49:54Z)
• Super-exponential distinguishability of correlated quantum states [0.0]
  A super-exponential decrease for both types of error probabilities is only possible in the trivial case. We show that a qualitatively different behaviour can occur when there is correlation between the samples.
  arXiv  Detail & Related papers  (2022-03-30T17:49:19Z)
• Generic aspects of the resource theory of quantum coherence [0.0]
  We prove that if two $n$-dimensional pure states are chosen independently according to the natural uniform distribution, then the probability that they are comparable as $nrightarrowinfty$. We also study the maximal success probability of incoherent conversions and find an explicit formula for its large-$n$ distribution.
  arXiv  Detail & Related papers  (2020-10-13T16:38:52Z)
• ROOT-SGD: Sharp Nonasymptotics and Near-Optimal Asymptotics in a Single Algorithm [71.13558000599839]
  We study the problem of solving strongly convex and smooth unconstrained optimization problems using first-order algorithms. We devise a novel, referred to as Recursive One-Over-T SGD, based on an easily implementable, averaging of past gradients. We prove that it simultaneously achieves state-of-the-art performance in both a finite-sample, nonasymptotic sense and an sense.
  arXiv  Detail & Related papers  (2020-08-28T14:46:56Z)
• Deriving Differential Target Propagation from Iterating Approximate Inverses [91.3755431537592]
  We show that a particular form of target propagation, relying on learned inverses of each layer, which is differential, gives rise to an update rule which corresponds to an approximate Gauss-Newton gradient-based optimization. We consider several iterative calculations based on local auto-encoders at each layer in order to achieve more precise inversions for more accurate target propagation.
  arXiv  Detail & Related papers  (2020-07-29T22:34:45Z)
• Transition probabilities and transition rates in discrete phase space [0.0]
  We show how the transition rates for any Hamiltonian evolution can be worked out by expanding the Hamiltonian as a linear combination of displacement operators in the discrete phase space.
  arXiv  Detail & Related papers  (2020-07-20T15:22:20Z)

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.