Uniform Additivity of Tripartite Optimized Correlation Measures

• URL: http://arxiv.org/abs/2412.18586v1
• Date: Tue, 24 Dec 2024 18:28:29 GMT
• Title: Uniform Additivity of Tripartite Optimized Correlation Measures
• Authors: Joshua Levin, Ariel Shlosberg, Vikesh Siddhu, Graeme Smith,
• Abstract summary: We search for optimized linear entropic functions of quantum states whose regularized versions are tractable to compute.<n>We rely on strong subadditivity of the von Neumann entropy to prove that three previously established tripartite optimized correlation measures are additive.
• Score: 6.624754673303328
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Information theory provides a framework for answering fundamental questions about the optimal performance of many important quantum communication and computational tasks. In many cases, the optimal rates of these tasks can be expressed in terms of regularized formulas that consist of linear combinations of von Neumann entropies optimized over state extensions. However, evaluation of regularized formulas is often intractable, since it involves computing a formula's value in the limit of infinitely many copies of a state. To find optimized, linear entropic functions of quantum states whose regularized versions are tractable to compute, we search for linear combinations of entropies on tripartite quantum states that are additive. We use the method of \cite{cross2017uniform}, which considers bipartite formulas, to identify convex polyhedral cones of uniformly additive \emph{tripartite} correlation measures. We rely only on strong subadditivity of the von Neumann entropy and use these cones to prove that three previously established tripartite optimized correlation measures are additive.

Related papers

• Optimal Estimation in Orthogonally Invariant Generalized Linear Models: Spectral Initialization and Approximate Message Passing [36.35215381372567]
  This paper proposes optimal spectral estimators and an approximate message passing (AMP) algorithm.<n>Building on the paradigm of spectrally-d iterative optimization, this paper proposes optimal spectral estimators and an approximate message passing (AMP) algorithm.
  arXiv  Detail & Related papers  (2026-02-09T22:08:09Z)
• Classical feature map surrogates and metrics for quantum control landscapes [0.0]
  We derive and analyze three feature maps of parametrized quantum dynamics, which generalize variational quantum circuits.<n>The Lie-Fourier representation is shown to have a dense spectrum with discrete peaks, that reflects control Hamiltonian properties, but that is compressible in typically found symmetric systems.
  arXiv  Detail & Related papers  (2025-09-30T08:24:13Z)
• Efficient approximation of regularized relative entropies and applications [11.59751616011475]
  We show that the regularized relative entropy can be efficiently approximated within an additive error by a quantum relative entropy program of size. This applies to particular to the regularized relative entropy in adversarial quantum channel discrimination. In particular, when the set of interest does not directly satisfy the required structural assumptions, it can be relaxed to one that does.
  arXiv  Detail & Related papers  (2025-02-21T18:29:45Z)
• Predicting symmetries of quantum dynamics with optimal samples [41.42817348756889]
  Identifying symmetries in quantum dynamics is a crucial challenge with profound implications for quantum technologies.<n>We introduce a unified framework combining group representation theory and subgroup hypothesis testing to predict these symmetries with optimal efficiency.<n>We prove that parallel strategies achieve the same performance as adaptive or indefinite-causal-order protocols.
  arXiv  Detail & Related papers  (2025-02-03T15:57:50Z)
• Solving the homogeneous Bethe-Salpeter equation with a quantum annealer [34.173566188833156]
  The homogeneous Bethe-Salpeter equation (hBSE) was solved for the first time by using a D-Wave quantum annealer. A broad numerical analysis of the proposed algorithms was carried out using both the proprietary simulated-anneaing package and the D-Wave Advantage 4.1 system.
  arXiv  Detail & Related papers  (2024-06-26T18:12:53Z)
• Towards Entanglement Entropy of Random Large-N Theories [0.0]
  We use the replica approach and the notion of shifted Matsubara frequency to compute von Neumann and R'enyi entanglement entropies. We demonstrate the flexibility of the method by applying it to examples of a two-site problem in presence of decoherence.
  arXiv  Detail & Related papers  (2023-03-03T18:21:54Z)
• Simplifying Momentum-based Positive-definite Submanifold Optimization with Applications to Deep Learning [24.97120654216651]
  We show how to solve difficult differential equations with momentum on a submanifold. We do so by proposing a generalized version of the Riemannian normal coordinates. We use our approach to simplify existing approaches for structured covariances and develop matrix-inverse-free $2textnd$orders for deep learning with low precision by using only matrix multiplications.
  arXiv  Detail & Related papers  (2023-02-20T03:31:11Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Integral formula for quantum relative entropy implies data processing inequality [0.0]
  We prove the monotonicity of quantum relative entropy under trace-preserving positive linear maps. For a simple application of such monotonicities, we consider any divergence' that is non-increasing under quantum measurements. An argument due to Hiai, Ohya, and Tsukada is used to show that the infimum of such a divergence' on pairs of quantum states with prescribed trace distance is the same as the corresponding infimum on pairs of binary classical states.
  arXiv  Detail & Related papers  (2022-08-25T16:32:02Z)
• Sum-of-Squares Relaxations for Information Theory and Variational Inference [0.0]
  We consider extensions of the Shannon relative entropy, referred to as $f$-divergences. We derive a sequence of convex relaxations for computing these divergences. We provide more efficient relaxations based on spectral information divergences from quantum information theory.
  arXiv  Detail & Related papers  (2022-06-27T13:22:40Z)
• Convergence conditions for the quantum relative entropy and other applications of the deneralized quantum Dini lemma [0.0]
  We prove two general dominated convergence theorems and the theorem about preserving local continuity under convex mixtures. A simple convergence criterion for the von Neumann entropy is also obtained.
  arXiv  Detail & Related papers  (2022-05-18T17:55:36Z)
• Relative Pose from SIFT Features [50.81749304115036]
  We derive a new linear constraint relating the unknown elements of the fundamental matrix and the orientation and scale. The proposed constraint is tested on a number of problems in a synthetic environment and on publicly available real-world datasets on more than 80000 image pairs.
  arXiv  Detail & Related papers  (2022-03-15T14:16:39Z)
• A Stochastic Newton Algorithm for Distributed Convex Optimization [62.20732134991661]
  We analyze a Newton algorithm for homogeneous distributed convex optimization, where each machine can calculate gradients of the same population objective. We show that our method can reduce the number, and frequency, of required communication rounds compared to existing methods without hurting performance.
  arXiv  Detail & Related papers  (2021-10-07T17:51:10Z)
• The Connection between Discrete- and Continuous-Time Descriptions of Gaussian Continuous Processes [60.35125735474386]
  We show that discretizations yielding consistent estimators have the property of invariance under coarse-graining' This result explains why combining differencing schemes for derivatives reconstruction and local-in-time inference approaches does not work for time series analysis of second or higher order differential equations.
  arXiv  Detail & Related papers  (2021-01-16T17:11:02Z)
• Local optimization on pure Gaussian state manifolds [63.76263875368856]
  We exploit insights into the geometry of bosonic and fermionic Gaussian states to develop an efficient local optimization algorithm. The method is based on notions of descent gradient attuned to the local geometry. We use the presented methods to collect numerical and analytical evidence for the conjecture that Gaussian purifications are sufficient to compute the entanglement of purification of arbitrary mixed Gaussian states.
  arXiv  Detail & Related papers  (2020-09-24T18:00:36Z)
• Fast approximations in the homogeneous Ising model for use in scene analysis [61.0951285821105]
  We provide accurate approximations that make it possible to numerically calculate quantities needed in inference. We show that our approximation formulae are scalable and unfazed by the size of the Markov Random Field. The practical import of our approximation formulae is illustrated in performing Bayesian inference in a functional Magnetic Resonance Imaging activation detection experiment, and also in likelihood ratio testing for anisotropy in the spatial patterns of yearly increases in pistachio tree yields.
  arXiv  Detail & Related papers  (2017-12-06T14:24:34Z)

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.