Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone

DOI10.1137/14097865XzbMath1329.15066arXiv1312.6643MaRDI QIDQ3457190

Teresa Piovesan, Monique Laurent

Publication date: 11 December 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberquantum entanglementpositive semidefinite matricesquantum graph parameterscopositive conenonlocal gamesconic linear programtrace positive polynomials

Mathematics Subject Classification ID

Linear programming (90C05) Positive matrices and their generalizations; cones of matrices (15B48) Quantum coherence, entanglement, quantum correlations (81P40)

Related Items

Separability of Hermitian tensors and PSD decompositions, Conic formulations of graph homomorphisms, Global completability with applications to self-consistent quantum tomography, Quantum Bilinear Optimization, Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization, Matrices with high completely positive semidefinite rank, Minimizer Extraction in Polynomial Optimization Is Robust, Approximate completely positive semidefinite factorizations and their ranks, Performance enhancements for a generic conic interior point algorithm, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Self-Dual Polyhedral Cones and Their Slack Matrices, Graph isomorphism: physical resources, optimization models, and algebraic characterizations, Tensor decompositions on simplicial complexes with invariance, THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED, Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices, Correlation matrices, Clifford algebras, and completely positive semidefinite rank, Classical information storage in an \(n\)-level quantum system, Positively factorizable maps, Linear conic formulations for two-party correlations and values of nonlocal games, The singular bivariate quartic tracial moment problem, Spectral upper bound on the quantum k-independence number of a graph, Penalized semidefinite programming for quadratically-constrained quadratic optimization, Completely positive semidefinite rank, Noncommutative polynomials describing convex sets, Positive semidefinite rank, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On vector configurations that can be realized in the cone of positive matrices
• Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
• Linear conic formulations for two-party correlations and values of nonlocal games
• Characterization of completely positive graphs
• Positive semidefinite rank
• Kneser's conjecture, chromatic number, and homotopy
• Copositive programming motivated bounds on the stability and the chromatic numbers
• On the quantum chromatic number of a graph
• The \(K\)-moment problem for compact semi-algebraic sets
• Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
• Extreme vectors of doubly nonnegative matrices
• Convex sets associated with von Neumann algebras and Connes' approximate embedding problem
• Addendum to: ``Connes' embedding conjecture and sums of Hermitian squares
• Connes' embedding conjecture and sums of Hermitian squares
• Edmonds polytopes and a hierarchy of combinatorial problems
• Approximation of the Stability Number of a Graph via Copositive Programming
• Constrained Polynomial Optimization Problems with Noncommuting Variables
• Graph Homomorphisms for Quantum Players
• Entanglement-Assisted Zero-Error Source-Channel Coding
• Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants
• New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring
• Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
• Sums of Hermitian squares as an approach to the BMV conjecture
• The Operator $\Psi$ for the Chromatic Number of a Graph
• On the Matrix Equation X′X = A
• A comparison of the Delsarte and Lovász bounds
• On the Shannon capacity of a graph
• Completely positive matrices associated withM-matrices
• On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
• Zero-error information theory
• Lifts of Convex Sets and Cone Factorizations
• QUANTUM CHROMATIC NUMBERS VIA OPERATOR SYSTEMS
• Linear vs. semidefinite extended formulations
• Chains of dog-ears for completely positive matrices