Approximation of multipartite quantum states: revised version with new applications

• URL: http://arxiv.org/abs/2401.02388v2
• Date: Wed, 30 Oct 2024 19:58:22 GMT
• Title: Approximation of multipartite quantum states: revised version with new applications
• Authors: M. E. Shirokov,
• Abstract summary: An universal approximation technique is proposed for analysis of different characteristics of states of composite infinite-dimensional quantum systems. Results are applied to the study of three important characteristics: the relative entropy of $pi$-entanglement, the Rains bound and the conditional entanglement of mutual information.
• Score: 0.0
• License:
• Abstract: An universal approximation technique for analysis of different characteristics of states of composite infinite-dimensional quantum systems is proposed and used to prove general results concerning the properties of correlation and entanglement measures in such systems. Then these results are applied to the study of three important characteristics: the relative entropy of $\pi$-entanglement, the Rains bound (the unregularized and regularized versions of both characteristics are considered) and the conditional entanglement of mutual information. In particular, we analyse continuity and convexity properties of the above entanglement measures, prove several results simplifying their definitions and establish a finite-dimensional approximation property for these characteristics that allows us to generalize to the infinite-dimensional case the results proved in the finite-dimensional settings.

Related papers

• Improving absolute separability bounds for arbitrary dimensions [0.0]
  Sufficient analytical conditions for separability in composite quantum systems are very scarce and only known for low-dimensional cases. We use linear maps and their inverses to derive powerful analytical conditions, providing tight bounds and extremal points of the set of absolutely separable states.
  arXiv  Detail & Related papers  (2024-10-29T18:00:04Z)
• Normalization in Proportional Feature Spaces [49.48516314472825]
  normalization plays an important central role in data representation, characterization, visualization, analysis, comparison, classification, and modeling. The selection of an appropriate normalization method needs to take into account the type and characteristics of the involved features.
  arXiv  Detail & Related papers  (2024-09-17T17:46:27Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• 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)
• Entanglement monogamy via multivariate trace inequalities [12.814476856584346]
  We derive variational formulas for relative entropies based on restricted measurements of multipartite quantum systems. We give direct, matrix-analysis-based proofs for the faithfulness of squashed entanglement.
  arXiv  Detail & Related papers  (2023-04-28T14:36:54Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• Continuity of characteristics of composite quantum systems [0.0]
  Methods of quantitative and qualitative continuity analysis of characteristics of composite quantum systems are described. New approximation method for obtaining local continuity conditions for various characteristics of quantum systems is proposed and described in detail.
  arXiv  Detail & Related papers  (2022-01-27T12:32:24Z)
• Moments of quantum purity and biorthogonal polynomial recurrence [6.482224543491085]
  We study the statistical behavior of entanglement over the Bures-Hall ensemble as measured by the simplest form of an entanglement entropy - the quantum purity. The main results of this work are the exact second and third moment expressions of quantum purity valid for any subsystem dimensions.
  arXiv  Detail & Related papers  (2021-07-09T19:18:34Z)
• Approximation of multipartite quantum states and the relative entropy of entanglement [0.0]
  We prove several results about analytical properties of the multipartite relative entropy of entanglement and its regularization. We establish a finite-dimensional approximation property for the relative entropy of entanglement and its regularization.
  arXiv  Detail & Related papers  (2021-03-22T18:12:24Z)
• Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Discrete Distributions [63.60499266361255]
  We show that for samples of discrete distributions, profile entropy is a fundamental measure unifying the concepts of estimation, inference, and compression. Specifically, profile entropy a) determines the speed of estimating the distribution relative to the best natural estimator; b) characterizes the rate of inferring all symmetric properties compared with the best estimator over any label-invariant distribution collection; c) serves as the limit of profile compression.
  arXiv  Detail & Related papers  (2020-02-26T17:49:04Z)

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.