Quantum bilinear optimization
From MaRDI portal
bilinear optimizationcompletely positive semidefinite conenoisy channel codingnoncommutative optimizationrandomness extractorsemidefinite hierarchies
Operator spaces and completely bounded maps (46L07) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Semidefinite programming (90C22) 2-person games (91A05) Channel models (including quantum) in information and communication theory (94A40)
Abstract: We study optimization programs given by a bilinear form over non-commutative variables subject to linear inequalities. Problems of this form include the entangled value of two-prover games, entanglement-assisted coding for classical channels and quantum-proof randomness extractors. We introduce an asymptotically converging hierarchy of efficiently computable semidefinite programming (SDP) relaxations for this quantum optimization. This allows us to give upper bounds on the quantum advantage for all of these problems. Compared to previous work of Pironio, Navascues and Acin, our hierarchy has additional constraints. By means of examples, we illustrate the importance of these new constraints both in practice and for analytical properties. Moreover, this allows us to give a hierarchy of SDP outer approximations for the completely positive semidefinite cone introduced by Laurent and Piovesan.
Recommendations
- Semidefinite programming hierarchies for constrained bilinear optimization
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Limitations of semidefinite programs for separable states and entangled games
- Product Rules in Semidefinite Programming
- Linear conic formulations for two-party correlations and values of nonlocal games
Cites work
- A positivstellensatz for non-commutative polynomials
- About the Connes embedding conjecture
- ABOUT THE QWEP CONJECTURE
- Algorithmic Aspects of Optimal Channel Coding
- Can you compute the operator norm?
- Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
- Closed sets of correlations: answers from the zoo
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- 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
- Global optimization with polynomials and the problem of moments
- Graph implementations for nonsmooth convex programs
- scientific article; zbMATH DE number 108045 (Why is no real title available?)
- scientific article; zbMATH DE number 1074568 (Why is no real title available?)
- scientific article; zbMATH DE number 1993745 (Why is no real title available?)
- scientific article; zbMATH DE number 6744339 (Why is no real title available?)
- Large violation of Bell inequalities with low entanglement
- Leftover Hashing Against Quantum Side Information
- Linear conic formulations for two-party correlations and values of nonlocal games
- Non-deterministic exponential time has two-prover interactive protocols
- On non-semisplit extensions, tensor products and exactness of group C^*-algebras
- On the purification map
- On the purification of factor states
- On the quantum chromatic number of a graph
- On vector configurations that can be realized in the cone of positive matrices
- Proposed experiment to test local hidden-variable theories
- Quantum homomorphisms
- Quantum-Proof Randomness Extractors via Operator Space Theory
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite programs for randomness extractors
- The smooth entropy formalism for von Neumann algebras
- The tracial moment problem and trace-optimization of polynomials
- The truncated tracial moment problem
- Theory of operator algebras I.
- Tsirelson's problem and Kirchberg's conjecture
- Unique games with entangled provers are easy
Cited in
(10)- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective
- Limitations of semidefinite programs for separable states and entangled games
- Semidefinite programming hierarchies for constrained bilinear optimization
- Solving large-scale optimization problems related to Bell's theorem
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Combinatorial optimization through variational quantum power method
- Linear conic formulations for two-party correlations and values of nonlocal games
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- Semidefinite games
This page was built for publication: Quantum bilinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187180)
