Explicit error bounds for entanglement transformations between sparse multipartite states

• URL: http://arxiv.org/abs/2309.11429v1
• Date: Wed, 20 Sep 2023 16:06:48 GMT
• Title: Explicit error bounds for entanglement transformations between sparse multipartite states
• Authors: D\'avid Bug\'ar, P\'eter Vrana
• Abstract summary: A nontrivial family of such functional exponents has recently been constructed. We derive a new regularised formula for these functionals in terms of a subadditive upper bound. Our results provide explicit bounds on the success probability of transformations by local operations and classical communication.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The trade-off relation between the rate and the strong converse exponent for probabilistic asymptotic entanglement transformations between pure multipartite states can in principle be characterised in terms of a class of entanglement measures determined implicitly by a set of strong axioms. A nontrivial family of such functionals has recently been constructed, but their previously known characterisations have so far only made it possible to evaluate them in very simple cases. In this paper we derive a new regularised formula for these functionals in terms of a subadditive upper bound, complementing the previously known superadditive lower bound. The upper and lower bounds evaluated on tensor powers differ by a logarithmically bounded term, which provides a bound on the convergence rate. In addition, we find that on states satisfying a certain sparsity constraint, the upper bound is equal to the value of the corresponding additive entanglement measure, therefore the regularisation is not needed for such states, and the evaluation is possible via a single-letter formula. Our results provide explicit bounds on the success probability of transformations by local operations and classical communication and, due to the additivity of the entanglement measures, also on the strong converse exponent for asymptotic transformations.

Related papers

• Enriching Disentanglement: From Logical Definitions to Quantitative Metrics [59.12308034729482]
  Disentangling the explanatory factors in complex data is a promising approach for data-efficient representation learning. We establish relationships between logical definitions and quantitative metrics to derive theoretically grounded disentanglement metrics. We empirically demonstrate the effectiveness of the proposed metrics by isolating different aspects of disentangled representations.
  arXiv  Detail & Related papers  (2023-05-19T08:22:23Z)
• 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)
• On the Importance of Gradient Norm in PAC-Bayesian Bounds [92.82627080794491]
  We propose a new generalization bound that exploits the contractivity of the log-Sobolev inequalities. We empirically analyze the effect of this new loss-gradient norm term on different neural architectures.
  arXiv  Detail & Related papers  (2022-10-12T12:49:20Z)
• 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)
• Data-Driven Influence Functions for Optimization-Based Causal Inference [105.5385525290466]
  We study a constructive algorithm that approximates Gateaux derivatives for statistical functionals by finite differencing. We study the case where probability distributions are not known a priori but need to be estimated from data.
  arXiv  Detail & Related papers  (2022-08-29T16:16:22Z)
• Inference on Strongly Identified Functionals of Weakly Identified Functions [71.42652863687117]
  We study a novel condition for the functional to be strongly identified even when the nuisance function is not. We propose penalized minimax estimators for both the primary and debiasing nuisance functions.
  arXiv  Detail & Related papers  (2022-08-17T13:38:31Z)
• Asymptotic continuity of additive entanglement measures [0.0]
  We study rates of transformations between entangled states by local operations and classical communication. For transformations between pure states, the optimal rate between any pair of states can be characterized as the infimum of such upper bounds.
  arXiv  Detail & Related papers  (2021-07-18T21:16:31Z)
• Localisation in quasiperiodic chains: a theory based on convergence of local propagators [68.8204255655161]
  We present a theory of localisation in quasiperiodic chains with nearest-neighbour hoppings, based on the convergence of local propagators. Analysing the convergence of these continued fractions, localisation or its absence can be determined, yielding in turn the critical points and mobility edges. Results are exemplified by analysing the theory for three quasiperiodic models covering a range of behaviour.
  arXiv  Detail & Related papers  (2021-02-18T16:19:52Z)
• Asymptotic state transformations of continuous variable resources [7.742297876120562]
  We study state transformations in continuous variable quantum resource theories. We prove that monotones displaying lower semicontinuity and strong superadditivity can be used to bound transformation rates.
  arXiv  Detail & Related papers  (2020-09-30T18:21:39Z)
• The semiring of dichotomies and asymptotic relative submajorization [0.0]
  We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen's theorem on preordered semirings. We find that an variant of relative submajorization, defined on unnormalized dichotomies, is characterized by real-valued monotones that are multiplicative under the tensor product and additive under the direct sum.
  arXiv  Detail & Related papers  (2020-04-22T14:13:26Z)
• Sequences of lower bounds for entropic uncertainty relations from bistochastic maps [0.0]
  We show a strategy to derive sequences of lower bounds based on alternating sequences of measurements onto A and B. The strategy can allow for an advantage both in the pure state and in the mixed state scenario.
  arXiv  Detail & Related papers  (2019-12-30T16:35:45Z)

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.