Semi-definite programming and quantum information
From MaRDI portal
Recommendations
- Designing optimal quantum detectors via semidefinite programming
- Limitations of semidefinite programs for separable states and entangled games
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Optimal superdense coding capacity in the non-Markovian regime
Cites work
- ``Positive noncommutative polynomials are sums of squares.
- A channel-based framework for steering, non-locality and beyond
- A combinatorial approach to nonlocality and contextuality
- A conversion of an SDP having free variables into the standard form SDP
- A derivation of quantum theory from physical requirements
- A Framework for Quantum-Secure Device-Independent Randomness Expansion
- A glance beyond the quantum model
- A matrix convexity approach to some celebrated quantum inequalities
- A new decision method for elementary algebra
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A note on the calculation of step-lengths in interior-point methods for semidefinite programming
- A positivstellensatz for non-commutative polynomials
- A primal-dual infeasible-interior-point algorithm for linear programming
- A primal-dual potential reduction method for problems involving matrix inequalities
- A semidefinite program for distillable entanglement
- A semidefinite programming approach to optimal unambiguous discrimination of quantum states
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- A Sum of Squares Approximation of Nonnegative Polynomials
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Advances in convex optimization: conic programming
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
- An Interior-Point Method for Semidefinite Programming
- Approximate Degradable Quantum Channels
- Approximate graph coloring by semidefinite programming
- Approximation algorithms and semidefinite programming.
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Approximation of the joint spectral radius using sum of squares
- Bell inequalities and entanglement
- Bell Inequalities: Many Questions, a Few Answers
- Characterizing quantum theory in terms of information-theoretic constraints
- Completely positive linear maps on complex matrices
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Control Applications of Sum of Squares Programming
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Convex analysis and nonlinear optimization. Theory and examples.
- Convexity and well-posed problems
- CSDP, A C library for semidefinite programming
- CVXPY: a Python-embedded modeling language for convex optimization
- Dense quantum coding and a lower bound for 1-way quantum automata
- Duality in Vector Optimization
- Dualize it: software for automatic primal and dual conversions of conic programs
- Efficient optimization of the quantum relative entropy
- Entangled games are hard to approximate
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Exploiting term sparsity in noncommutative polynomial optimization
- Extended non-local games and monogamy-of-entanglement games
- Functional calculus for sesquilinear forms and the purification map
- Functions of positive and negative type, and their connection with the theory of integral equations.
- Generalized probability theories: what determines the structure of quantum theory?
- Geometric Rényi divergence and its applications in quantum channel capacities
- Geometry of quantum states. An introduction to quantum entanglement
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3860890 (Why is no real title available?)
- scientific article; zbMATH DE number 4146872 (Why is no real title available?)
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 46305 (Why is no real title available?)
- scientific article; zbMATH DE number 48327 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3603880 (Why is no real title available?)
- scientific article; zbMATH DE number 549889 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1489809 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 1456191 (Why is no real title available?)
- scientific article; zbMATH DE number 3372773 (Why is no real title available?)
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Interior point methods 25 years later
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior Point Trajectories in Semidefinite Programming
- Interior-point methods
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
- JENSEN'S OPERATOR INEQUALITY
- Julia: a fresh approach to numerical computing
- JuMP: a modeling language for mathematical optimization
- Large-Scale Optimization of Eigenvalues
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Lectures on convex optimization
- Lieb's concavity theorem, matrix geometric means, and semidefinite optimization
- Limit on nonlocality in any world in which communication complexity is not trivial
- Linear Matrix Inequalities in System and Control Theory
- Linear matrix inequality representation of sets
- Linear transformations which preserve trace and positive semidefiniteness of operators
- LMI representations of convex semialgebraic sets and determinantal representations of algebraic hypersurfaces: past, present, and future
- LMI Techniques for Optimization Over Polynomials in Control: A Survey
- Matrix differential calculus with applications in statistics and econometrics
- Means of positive linear operators
- More randomness from the same data
- Multidimensional quantum entanglement with large-scale integrated optics
- Non-commutative perspectives
- Noncommutative sums of squares
- Numerical mathematics.
- Numerical methods of Lyapunov function construction and their application to the absolute stability problem
- On Conjugate Convex Functions
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On free variables in interior point methods
- On implementation of a self-dual embedding method for convex programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- On semidefinite representations of non-closed sets
- On the descriptive content of quantum-theoretical kinematics and mechanics.
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- On the Implementation of a Primal-Dual Interior Point Method
- On the Nesterov--Todd Direction in Semidefinite Programming
- On the Power of PPT-Preserving and Non-Signalling Codes
- On the quantum chromatic number of a graph
- On the semidefinite representation of real functions applied to symmetric matrices
- On the Shannon capacity of a graph
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- Perspectives of matrix convex functions
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Polynomial sum of squares in fluid dynamics: a review with a look ahead
- Positive Definite Matrices and Sylvester's Criterion
- Positive Functions on C ∗ -Algebras
- Positivity and sums of squares: a guide to recent results
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Proposed experiment to test local hidden-variable theories
- Quantum information theory
- Quantum nonlocality and beyond: limits from nonlocal computation
- Quantum reaxiomatisations and information-theoretic interpretations of quantum theory
- Quantum state discrimination and its applications
- Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
- Relative Operator Entropy
- Relaxations of vertex packing
- Sampling method for semidefinite programmes with non-negative Popov function constraints
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Semidefinite approximations of the matrix logarithm
- Semidefinite optimization
- Semidefinite Programming
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
- Semidefinite programming in combinatorial optimization
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite programs for completely bounded norms
- Semidefinite Representation for Convex Hulls of Real Algebraic Curves
- Semidefinite representation of convex sets
- Separability Criterion for Density Matrices
- Separability of mixed states: necessary and sufficient conditions.
- Simpler semidefinite programs for completely bounded norms
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving semidefinite-quadratic-linear programs using SDPT3
- Some geometric results in semidefinite programming
- Some Schur complement identities and applications to matrix extrapolation methods
- Sparse noncommutative polynomial optimization
- Speakable and unspeakable in quantum mechanics. With an introduction by Alain Aspect
- Spectrahedral shadows
- Steering, entanglement, nonlocality, and the Einstein-Podolsky-Rosen paradox
- Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Symmetric primal-dual path-following algorithms for semidefinite programming
- Symmetric states of composite systems
- Techniques of variational analysis
- Testing the dimension of Hilbert spaces
- The ellipsoid method and its consequences in combinatorial optimization
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
- The relative operator entropy and the Karcher mean
- The state-of-the-art in conic optimization software
- The theory of quantum information
- The tracial moment problem and trace-optimization of polynomials
- The variational quantum eigensolver: a review of methods and best practices
- Trace inequalities and quantum entropy: an introductory course
- Über konvexe Matrixfunktionen.
- Über monotone Matrixfunktionen
- Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind. I, II.
- Using complete measurement statistics for optimal device-independent randomness evaluation
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Variational methods in convex analysis
- Zero-Error Channel Capacity and Simulation Assisted by Non-Local Correlations
- Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
- Zur Quantenmechanik einfacher Bewegungstypen.
- Zur Theorie der Gesellschaftsspiele.
Cited in
(2)
This page was built for publication: Semi-definite programming and quantum information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561827)
