Probabilistic Coherence Transformation

• URL: http://arxiv.org/abs/2410.08095v1
• Date: Thu, 10 Oct 2024 16:37:46 GMT
• Title: Probabilistic Coherence Transformation
• Authors: Ao-Xiang Liu, Cong-Feng Qiao,
• Abstract summary: We investigate the probabilistic coherence transformation under strictly incoherent operations. It is found that the large coherence gain can be realized with the price of success probability loss. As an application, it is shown that the conversion from coherence into entanglement may benefit from probabilistic coherence transformation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The coherence transformation is pivotal for quantum technologies, which cannot always be accomplished deterministically. We investigate the probabilistic coherence transformation under strictly incoherent operations. To this end, by virtue of majorization lattice, the greedy and thrifty protocols are adapted for the probabilistic coherence transformation, of which the latter exhibits certain superiority in preserving coherence on average. Intuitively, it is found that the large coherence gain can be realized with the price of success probability loss for coherence transformation, and vice versa. Deterministic and probabilistic coherence transformations between two mixed states are explored. As an application, it is shown that the conversion from coherence into entanglement may benefit from probabilistic coherence transformation.

Related papers

• Error exponents for entanglement transformations from degenerations [10.435741631709403]
  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.
  arXiv  Detail & Related papers  (2024-09-02T10:08:21Z)
• 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)
• Approximation and Estimation Ability of Transformers for Sequence-to-Sequence Functions with Infinite Dimensional Input [50.83356836818667]
  We study the approximation and estimation ability of Transformers as sequence-to-sequence functions with infinite dimensional inputs. Our theoretical results support the practical success of Transformers for high dimensional data.
  arXiv  Detail & Related papers  (2023-05-30T02:44:49Z)
• Real quantum operations and state transformations [44.99833362998488]
  Resource theory of imaginarity provides a useful framework to understand the role of complex numbers. In the first part of this article, we study the properties of real'' (quantum) operations in single-party and bipartite settings. In the second part of this article, we focus on the problem of single copy state transformation via real quantum operations.
  arXiv  Detail & Related papers  (2022-10-28T01:08:16Z)
• 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)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Belief Evolution Network: Probability Transformation of Basic Belief Assignment and Fusion Conflict Probability [4.286327408435937]
  We give a new interpretation of basic belief assignment transformation into probability distribution. We also use directed acyclic network called belief evolution network to describe the causality between the focal elements of a BBA.
  arXiv  Detail & Related papers  (2021-10-07T13:48:36Z)
• Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity [49.66890309455787]
  We introduce the expected co-coercivity condition, explain its benefits, and provide the first last-iterate convergence guarantees of SGDA and SCO. We prove linear convergence of both methods to a neighborhood of the solution when they use constant step-size. Our convergence guarantees hold under the arbitrary sampling paradigm, and we give insights into the complexity of minibatching.
  arXiv  Detail & Related papers  (2021-06-30T18:32:46Z)
• Learned transform compression with optimized entropy encoding [72.20409648915398]
  We consider the problem of learned transform compression where we learn both, the transform and the probability distribution over the discrete codes. We employ a soft relaxation of the quantization operation to allow for back-propagation of gradients and employ vector (rather than scalar) quantization of the latent codes.
  arXiv  Detail & Related papers  (2021-04-07T17:58:01Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)
• A generalization of the symmetrical and optimal probability-to-possibility transformations [0.0]
  This paper studies the advantages and shortcomings of two well-known discrete probability to possibility transformations. It generalizes them and alleviates their shortcomings, showing a big potential for practical application. The paper also introduces a novel fuzzy measure of specificity for probability distributions based on the concept of fuzzy subsethood.
  arXiv  Detail & Related papers  (2019-12-29T17:43: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.