Semidefinite programming hierarchies for constrained bilinear optimization
From MaRDI portal
Publication:2149569
DOI10.1007/s10107-021-01650-1zbMath1494.90066arXiv1810.12197OpenAlexW3177893171MaRDI QIDQ2149569
Volkher B. Scholz, Francesco Borderi, Mario Berta, Omar Fawzi
Publication date: 29 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.12197
semidefinite programmingquantum error correctionbilinear optimizationde Finetti theoremsseparability problemsum-of-squares hierarchies
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distinguishing multi-partite states by local measurements
- Quantum conditional mutual information and approximate Markov chains
- Faithful squashed entanglement
- The quantum reverse Shannon theorem based on one-shot information theory
- Quantum error correction via convex optimization
- Symmetric states of composite systems
- A de Finetti-type theorem with m-dependent states
- Finite exchangeable sequences
- Hypercontractivity in noncommutative \(L_1\) spaces
- Semidefinite programming relaxations for semialgebraic problems
- Limitations of semidefinite programs for separable states and entangled games
- Quantum de Finetti theorems under local measurements with applications
- One-and-a-half quantum de Finetti theorems
- Everything you always wanted to know about LOCC (but were afraid to ask)
- Symmetric states of infinite tensor products of \(C^ *\)-algebras
- Global Optimization with Polynomials and the Problem of Moments
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Correlation detection and an operational interpretation of the Rényi mutual information
- No-Signalling-Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovász Number
- On the Power of PPT-Preserving and Non-Signalling Codes
- A Linear Program for the Finite Block Length Converse of Polyanskiy–Poor–Verdú Via Nonsignaling Codes
- Quantum entanglement
- Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
- Quantum Bilinear Optimization
- Randomized benchmarking with confidence
- A de Finetti representation for finite symmetric quantum states
- A most compendious and facile quantum de Finetti theorem
- Finite de Finetti theorem for conditional probability distributions describing physical theories
- Jointly Constrained Biconvex Programming
- Locally normal symmetric states and an analogue of de Finetti's theorem
- A cutting plane algorithm for solving bilinear programs
- Semidefinite Programming Strong Converse Bounds for Classical Capacity
- Algorithmic Aspects of Optimal Channel Coding
- The Theory of Quantum Information
- Unknown quantum states: The quantum de Finetti representation
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Channel-Optimized Quantum Error Correction
- On the Power of the PPT Constraint in the Symmetric Extensions Test for Separability
- Semidefinite Programming Converse Bounds for Quantum Communication
- de Finetti reductions for correlations
- Channel Coding Rate in the Finite Blocklength Regime
- Mixed-state entanglement and quantum error correction
- Sandwiched Rényi divergence satisfies data processing inequality
- Hypercontractivity, sum-of-squares proofs, and their applications
- Optimizing quantum process tomography with unitary2-designs
- Quantum State Estimation
- Quantum Information Theory
- Product-state approximations to quantum states
