Monogamy of highly symmetric states
- URL: http://arxiv.org/abs/2309.16655v1
- Date: Thu, 28 Sep 2023 17:55:21 GMT
- Title: Monogamy of highly symmetric states
- Authors: Rene Allerstorfer and Matthias Christandl and Dmitry Grinko and Ion
Nechita and Maris Ozols and Denis Rochette and Philip Verduyn Lunel
- Abstract summary: We study the question of how highly entangled two particles can be when also entangled in a similar way with other particles.
In particular, we determine the exact maximum values of the projection to the maximally entangled state and antisymmetric Werner state possible.
- Score: 1.8323001213919563
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study the question of how highly entangled two particles can be when also
entangled in a similar way with other particles on the complete graph for the
case of Werner, isotropic and Brauer states. In order to do so we solve
optimization problems motivated by many-body physics, computational complexity
and quantum cryptography. We formalize our question as a semi-definite program
and then solve this optimization problem analytically, using tools from
representation theory. In particular, we determine the exact maximum values of
the projection to the maximally entangled state and antisymmetric Werner state
possible, solving long-standing open problems. We find these optimal values by
use of SDP duality and representation theory of the symmetric and orthogonal
groups, and the Brauer algebra.
Related papers
- Solving the homogeneous Bethe-Salpeter equation with a quantum annealer [35.310629519009204]
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) - An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem [49.1574468325115]
We analyse the ability of quantum D-Wave annealers to find the maximum clique on a graph, expressed as a QUBO problem.
We propose a decomposition algorithm for the complementary maximum independent set problem, and a graph generation algorithm to control the number of nodes, the number of cliques, the density, the connectivity indices and the ratio of the solution size to the number of other nodes.
arXiv Detail & Related papers (2024-06-11T04:40:05Z) - 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) - $O(N^2)$ Universal Antisymmetry in Fermionic Neural Networks [107.86545461433616]
We propose permutation-equivariant architectures, on which a determinant Slater is applied to induce antisymmetry.
FermiNet is proved to have universal approximation capability with a single determinant, namely, it suffices to represent any antisymmetric function.
We substitute the Slater with a pairwise antisymmetry construction, which is easy to implement and can reduce the computational cost to $O(N2)$.
arXiv Detail & Related papers (2022-05-26T07:44:54Z) - The complexity of quantum support vector machines [1.7887848708497243]
Quantum support vector machines employ quantum circuits to define the kernel function.
We show that the dual problem can be solved in $O(M4.67/varepsilon2)$ quantum circuit evaluations.
arXiv Detail & Related papers (2022-02-28T19:01:17Z) - Noncommutative polynomial optimization under symmetry [0.0]
We present a general framework to exploit the symmetries present in the Navascu'es-Pironio-Ac'in semidefinite relaxations.
We put equal emphasis on the moment and sum-of-squares dual approaches.
arXiv Detail & Related papers (2021-12-20T19:02:16Z) - Mean-Square Analysis with An Application to Optimal Dimension Dependence
of Langevin Monte Carlo [60.785586069299356]
This work provides a general framework for the non-asymotic analysis of sampling error in 2-Wasserstein distance.
Our theoretical analysis is further validated by numerical experiments.
arXiv Detail & Related papers (2021-09-08T18:00:05Z) - On Multimarginal Partial Optimal Transport: Equivalent Forms and
Computational Complexity [11.280177531118206]
We study the multi-marginal partial optimal transport (POT) problem between $m$ discrete (unbalanced) measures with at most $n$ supports.
We first prove that we can obtain two equivalence forms of the multimarginal POT problem in terms of the multimarginal optimal transport problem via novel extensions of cost tensor.
We demonstrate that the ApproxMPOT algorithm can approximate the optimal value of multimarginal POT problem with a computational complexity upper bound of the order $tildemathcalO(m3(n+1)m/ var
arXiv Detail & Related papers (2021-08-18T06:46:59Z) - Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable
Approach for Continuous Markov Random Fields [53.31927549039624]
We show that a piecewise discretization preserves better contrast from existing discretization problems.
We apply this theory to the problem of matching two images.
arXiv Detail & Related papers (2021-07-13T12:31:06Z) - Convex Geometry and Duality of Over-parameterized Neural Networks [70.15611146583068]
We develop a convex analytic approach to analyze finite width two-layer ReLU networks.
We show that an optimal solution to the regularized training problem can be characterized as extreme points of a convex set.
In higher dimensions, we show that the training problem can be cast as a finite dimensional convex problem with infinitely many constraints.
arXiv Detail & Related papers (2020-02-25T23:05:33Z) - The quantum marginal problem for symmetric states: applications to
variational optimization, nonlocality and self-testing [0.0]
We present a method to solve the quantum marginal problem for symmetric $d$-level systems.
We illustrate the applicability of the method in central quantum information problems with several exemplary case studies.
arXiv Detail & Related papers (2020-01-13T18:20:53Z)
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.