Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
From MaRDI portal
(Redirected from Publication:1650765)
Abstract: In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free. For synchronous correlations, we show a correspondence between the minimal entanglement dimension and the completely positive semidefinite rank of an associated matrix. We then study optimization over the set of synchronous correlations by investigating quantum graph parameters. We unify existing bounds on the quantum chromatic number and the quantum stability number by placing them in the framework of tracial optimization. In particular, we show that the projective packing number, the projective rank, and the tracial rank arise naturally when considering tracial analogues of the Lasserre hierarchy for the stability and chromatic number of a graph. We also introduce semidefinite programming hierarchies converging to the commuting quantum chromatic number and commuting quantum stability number.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3196283 (Why is no real title available?)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A non-commutative spectral theorem
- About the Connes embedding conjecture
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Brownian local minima, random dense countable sets and random equivalence classes
- Completely positive semidefinite rank
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- Connes' embedding conjecture and sums of Hermitian squares
- Connes' embedding problem and Tsirelson's problem
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Estimating quantum chromatic numbers
- Global optimization with polynomials and the problem of moments
- Kneser's conjecture, chromatic number, and homotopy
- Linear conic formulations for two-party correlations and values of nonlocal games
- Matrices with high completely positive semidefinite rank
- New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring
- On the Shannon capacity of a graph
- On the quantum chromatic number of a graph
- Operator algebras. Theory of \(C^*\)-algebras and von Neumann algebras
- Optimization of polynomials in non-commuting variables
- Proposed experiment to test local hidden-variable theories
- Quantum graph homomorphisms via operator systems
- Quantum homomorphisms
- SDP relaxations for non-commutative polynomial optimization
- Simple unified form for the major no-hidden-variables theorems
- Solution of the truncated complex moment problem for flat data
- Survey on nonlocal games and operator space theory
- Symmetric tensor nuclear norms
- Synchronous correlation matrices and Connes' embedding conjecture
- Testing the dimension of Hilbert spaces
- The Operator $\Psi$ for the Chromatic Number of a Graph
- The tracial moment problem and trace-optimization of polynomials
- The truncated tracial moment problem
- Tsirelson's problem and Kirchberg's conjecture
Cited in
(11)- Lifting for simplicity: concise descriptions of convex sets
- Minimizer Extraction in Polynomial Optimization Is Robust
- Optimization over trace polynomials
- Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- \texttt{libCreme}: an optimization library for evaluating convex-roof entanglement measures
- Sparse noncommutative polynomial optimization
- Exploiting term sparsity in noncommutative polynomial optimization
- The constant trace property in noncommutative optimization
This page was built for publication: Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650765)
