Linear conic formulations for two-party correlations and values of nonlocal games

DOI10.1007/s10107-016-1049-8zbMath1358.90091arXiv1506.07297OpenAlexW3100770743MaRDI QIDQ517312

Jamie Sikora, Antonios Varvitsiotis

Publication date: 23 March 2017

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

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

zbMATH Keywords

quantum correlationsquantum graph parameterssemidefinite programming relaxationscompletely positive semidefinite conecompletely positive conelinear conic programmingnonlocal games

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Applications of mathematical programming (90C90) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (10)

Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone ⋮ Quantum Bilinear Optimization ⋮ Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization ⋮ Approximate completely positive semidefinite factorizations and their ranks ⋮ A synchronous NPA hierarchy with applications ⋮ Graph isomorphism: physical resources, optimization models, and algebraic characterizations ⋮ THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED ⋮ Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices ⋮ Completely positive semidefinite rank ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum homomorphisms
• Conic formulations of graph homomorphisms
• Perfect parallel repetition theorem for quantum XOR proof systems
• On the quantum chromatic number of a graph
• Quantum analogues of the Bell inequalities. The case of two spatially separated domains
• A parallel repetition theorem for entangled projection games
• New approximations for the cone of copositive matrices and its dual
• Lectures on Modern Convex Optimization
• Approximation of the Stability Number of a Graph via Copositive Programming
• Synchronous correlation matrices and Connes’ embedding conjecture
• Deciding the existence of perfect entangled strategies for nonlocal games
• Polyhedral duality in Bell scenarios with two binary observables
• TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
• Quantum Bilinear Optimization
• Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
• On the Matrix Equation X′X = A
• Quantum cryptography based on Bell’s theorem
• The Theory of Quantum Information
• Analytical approach to parallel repetition
• Proposed Experiment to Test Local Hidden-Variable Theories
• Unique Games with Entangled Provers Are Easy
• Estimating quantum chromatic numbers

This page was built for publication: Linear conic formulations for two-party correlations and values of nonlocal games