Quantum Bilinear Optimization

DOI10.1137/15M1037731zbMath1345.81018arXiv1506.08810WikidataQ62556712 ScholiaQ62556712MaRDI QIDQ3187180

Omar Fawzi, Volkher B. Scholz, Mario Berta

Publication date: 16 August 2016

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

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

zbMATH Keywords

bilinear optimizationcompletely positive semidefinite conenoisy channel codingrandomness extractornoncommutative optimizationsemidefinite hierarchies

Mathematics Subject Classification ID

Semidefinite programming (90C22) 2-person games (91A05) Operator spaces and completely bounded maps (46L07) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Channel models (including quantum) in information and communication theory (94A40) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)

Related Items (4)

Semidefinite programming hierarchies for constrained bilinear optimization ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Linear conic formulations for two-party correlations and values of nonlocal games ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum homomorphisms
• About the Connes embedding conjecture
• On vector configurations that can be realized in the cone of positive matrices
• Linear conic formulations for two-party correlations and values of nonlocal games
• Non-deterministic exponential time has two-prover interactive protocols
• Large violation of Bell inequalities with low entanglement
• On the quantum chromatic number of a graph
• Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
• On non-semisplit extensions, tensor products and exactness of group \(C^*\)-algebras
• Semidefinite programming relaxations for semialgebraic problems
• The tracial moment problem and trace-optimization of polynomials
• On the purification of factor states
• On the purification map
• Global Optimization with Polynomials and the Problem of Moments
• The smooth entropy formalism for von Neumann algebras
• TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
• The truncated tracial moment problem
• Closed sets of correlations: answers from the zoo
• Can you compute the operator norm?
• Graph Implementations for Nonsmooth Convex Programs
• Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
• Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
• SECURITY OF QUANTUM KEY DISTRIBUTION
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Algorithmic Aspects of Optimal Channel Coding
• A positivstellensatz for non-commutative polynomials
• ABOUT THE QWEP CONJECTURE
• Connes' embedding problem and Tsirelson's problem
• Leftover Hashing Against Quantum Side Information
• Semidefinite Programs for Randomness Extractors
• Quantum-Proof Randomness Extractors via Operator Space Theory
• Proposed Experiment to Test Local Hidden-Variable Theories
• Unique Games with Entangled Provers Are Easy
• Theory of operator algebras I.
• Constrained trace-optimization of polynomials in freely noncommuting variables

This page was built for publication: Quantum Bilinear Optimization