Revisiting Gaussian genuine entanglement witnesses with modern software

• URL: http://arxiv.org/abs/2412.09757v2
• Date: Thu, 06 Mar 2025 07:59:05 GMT
• Title: Revisiting Gaussian genuine entanglement witnesses with modern software
• Authors: E. Shchukin, P. van Loock,
• Abstract summary: Continuous-variable Gaussian entanglement is an attractive concept in quantum information theory.<n>We present several approaches to reconstruct the most probable physical covariance matrix from a measured non-physical one.<n>We derive an explicit analytical expression for the symplectic trace of a positive definite matrix, which can serve as a simple witness of an entanglement witness.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Continuous-variable Gaussian entanglement is an attractive notion, both as a fundamental concept in quantum information theory, based on the well-established Gaussian formalism for phase-space variables, and as a practical resource in quantum technology, exploiting in particular, unconditional room-temperature squeezed-light quantum optics. The readily available high level of scalability, however, is accompanied by an increased theoretical complexity when the multipartite entanglement of a growing number of optical modes is considered. For such systems, we present several approaches to reconstruct the most probable physical covariance matrix from a measured non-physical one and then test the reconstructed matrix for different kinds of separability (factorizability, concrete partite separability or biseparability) even in the presence of measurement errors. All these approaches are based on formulating the desired properties (physicality or separability) as convex optimization problems, which can be efficiently solved with modern optimization solvers, even when the system grows. To every optimization problem we construct the corresponding dual problem used to verify the optimality of the solution. Besides this numerical part of work, we derive an explicit analytical expression for the symplectic trace of a positive definite matrix, which can serve as a simple witness of an entanglement witness, and extend it for positive semidefinite matrices. In addition, we show that in some cases our optimization problems can be solved analytically. As an application of our analytical approach, we consider small instances of bound entangled or genuine multipartite entangled Gaussian states, including some examples from the literature that were treated only numerically, and a family of non-Gaussian states.

Related papers

• Interior Point Methods for Structured Quantum Relative Entropy Optimization Problems [6.281229317487581]
  We show how structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy optimization problems. Our numerical results show that these techniques improve computation times by up to several orders of magnitude, and allow previously intractable problems to be solved.
  arXiv  Detail & Related papers  (2024-06-28T21:37:45Z)
• Quantum algorithms for matrix geometric means [9.711068952909118]
  We devise new quantum subroutines to prepare quantum unitary operators that embed the standard matrix geometric mean. We present a new class of quantum learning algorithms called quantum geometric mean metric learning. These quantum subroutines for matrix geometric means are also useful in other areas of quantum information.
  arXiv  Detail & Related papers  (2024-05-01T17:58:11Z)
• 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)
• Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization [39.58317527488534]
  We propose a novel method for solving linear systems. We transform the linear system into a binary optimization problem, drawing inspiration from the geometry of the original problem. We demonstrate that by leveraging partial knowledge of the problem's intrinsic geometry, we can decompose the original problem into smaller, independent sub-problems.
  arXiv  Detail & Related papers  (2023-09-18T16:51:03Z)
• Minimizing the negativity of quantum circuits in overcomplete quasiprobability representations [0.6428333375712125]
  We develop an approach for minimizing the total negativity of a given quantum circuit with respect to quasiprobability representations, that are overcomplete. Our approach includes both optimization over equivalent quasistochastic vectors and matrices, which appear due to the overcompleteness. We also study the negativity minimization of noisy brick-wall random circuits via a combination of increasing frame dimension and applying gate merging technique.
  arXiv  Detail & Related papers  (2023-06-19T08:02:00Z)
• Automatic and effective discovery of quantum kernels [43.702574335089736]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data. We present a different approach, which employs optimization techniques, similar to those used in neural architecture search and AutoML. The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Provably efficient variational generative modeling of quantum many-body systems via quantum-probabilistic information geometry [3.5097082077065003]
  We introduce a generalization of quantum natural gradient descent to parameterized mixed states. We also provide a robust first-order approximating algorithm, Quantum-Probabilistic Mirror Descent. Our approaches extend previously sample-efficient techniques to allow for flexibility in model choice.
  arXiv  Detail & Related papers  (2022-06-09T17:58:15Z)
• 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)
• Learning ground states of quantum Hamiltonians with graph networks [6.024776891570197]
  Solving for the lowest energy eigenstate of the many-body Schrodinger equation is a cornerstone problem. Variational methods approach this problem by searching for the best approximation within a lower-dimensional variational manifold. We use graph neural networks to define a structured variational manifold and optimize its parameters to find high quality approximations.
  arXiv  Detail & Related papers  (2021-10-12T22:56:16Z)
• Exact solutions of interacting dissipative systems via weak symmetries [77.34726150561087]
  We analytically diagonalize the Liouvillian of a class Markovian dissipative systems with arbitrary strong interactions or nonlinearity. This enables an exact description of the full dynamics and dissipative spectrum. Our method is applicable to a variety of other systems, and could provide a powerful new tool for the study of complex driven-dissipative quantum systems.
  arXiv  Detail & Related papers  (2021-09-27T17:45:42Z)
• Optimization on manifolds: A symplectic approach [127.54402681305629]
  We propose a dissipative extension of Dirac's theory of constrained Hamiltonian systems as a general framework for solving optimization problems. Our class of (accelerated) algorithms are not only simple and efficient but also applicable to a broad range of contexts.
  arXiv  Detail & Related papers  (2021-07-23T13:43:34Z)
• Jointly Modeling and Clustering Tensors in High Dimensions [6.072664839782975]
  We consider the problem of jointly benchmarking and clustering of tensors. We propose an efficient high-maximization algorithm that converges geometrically to a neighborhood that is within statistical precision.
  arXiv  Detail & Related papers  (2021-04-15T21:06:16Z)
• Certificates of quantum many-body properties assisted by machine learning [0.0]
  We propose a novel approach combining the power of relaxation techniques with deep reinforcement learning. We illustrate the viability of the method in the context of finding the ground state energy of many transfer systems. We provide tools to generalize the approach to other common applications in the field of quantum information processing.
  arXiv  Detail & Related papers  (2021-03-05T17:47:26Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• The Variational Method of Moments [65.91730154730905]
  conditional moment problem is a powerful formulation for describing structural causal parameters in terms of observables. Motivated by a variational minimax reformulation of OWGMM, we define a very general class of estimators for the conditional moment problem. We provide algorithms for valid statistical inference based on the same kind of variational reformulations.
  arXiv  Detail & Related papers  (2020-12-17T07:21:06Z)
• Riemannian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies [0.0]
  We show that a new approach to optimization with constraints can be applied to complex quantum systems. The developed approach together with the provided open source software can be applied to the optimal control of noisy quantum systems.
  arXiv  Detail & Related papers  (2020-07-02T17:53:01Z)
• A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm [59.99439951055238]
  We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based. The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM) We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
  arXiv  Detail & Related papers  (2020-06-23T01:34:18Z)
• On dissipative symplectic integration with applications to gradient-based optimization [77.34726150561087]
  We propose a geometric framework in which discretizations can be realized systematically. We show that a generalization of symplectic to nonconservative and in particular dissipative Hamiltonian systems is able to preserve rates of convergence up to a controlled error.
  arXiv  Detail & Related papers  (2020-04-15T00:36:49Z)

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.