Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization

DOI10.1007/S10107-018-1287-ZzbMath1456.90122arXiv1708.09696OpenAlexW2752158681WikidataQ93164458 ScholiaQ93164458MaRDI QIDQ1650765

David de Laat, Monique Laurent, Sander Gribling

Publication date: 13 July 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.09696

zbMATH Keywords

polynomial optimizationquantum graph parametersquantum correlationentanglement dimension

Mathematics Subject Classification ID

Semidefinite programming (90C22) Coloring of graphs and hypergraphs (05C15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Polynomial optimization (90C23)

Related Items (7)

Lifting for Simplicity: Concise Descriptions of Convex Sets ⋮ Sparse noncommutative polynomial optimization ⋮ Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization ⋮ Minimizer Extraction in Polynomial Optimization Is Robust ⋮ Exploiting term sparsity in noncommutative polynomial optimization ⋮ Optimization over trace polynomials ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum graph homomorphisms via operator systems
• Quantum homomorphisms
• Matrices with high completely positive semidefinite rank
• About the Connes embedding conjecture
• Linear conic formulations for two-party correlations and values of nonlocal games
• Kneser's conjecture, chromatic number, and homotopy
• Brownian local minima, random dense countable sets and random equivalence classes
• On the quantum chromatic number of a graph
• A non-commutative spectral theorem
• Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
• Completely positive semidefinite rank
• The tracial moment problem and trace-optimization of polynomials
• Connes' embedding conjecture and sums of Hermitian squares
• Operator algebras. Theory of \(C^*\)-algebras and von Neumann algebras
• Global Optimization with Polynomials and the Problem of Moments
• Synchronous correlation matrices and Connes’ embedding conjecture
• Survey on nonlocal games and operator space theory
• SDP Relaxations for Non-Commutative Polynomial Optimization
• Optimization of Polynomials in Non-Commuting Variables
• TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
• The truncated tracial moment problem
• New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring
• Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
• Testing the Dimension of Hilbert Spaces
• Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
• The Operator $\Psi$ for the Chromatic Number of a Graph
• Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
• On the Shannon capacity of a graph
• Simple unified form for the major no-hidden-variables theorems
• Solution of the truncated complex moment problem for flat data
• Connes' embedding problem and Tsirelson's problem
• Proposed Experiment to Test Local Hidden-Variable Theories
• Symmetric Tensor Nuclear Norms
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• Estimating quantum chromatic numbers
• Constrained trace-optimization of polynomials in freely noncommuting variables

This page was built for publication: Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization