A practical approach to SOS relaxations for detecting quantum entanglement

DOI10.1007/S10957-023-02258-5MaRDI QIDQ6050141zbMATH OpenOpenAlexFDO

Authors Abhishek Bhardwaj

Publication date 18 September 2023

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10957-023-02258-5

zbMATH Keywords

minimizationentanglementsums of squarescompletely positive mapspositive maps

Mathematics Subject Classification ID

Semidefinite programming (90C22) Operator spaces and completely bounded maps (46L07) Applications of functional analysis in quantum physics (46N50) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Real algebra (13J30) Applications of selfadjoint operator algebras to physics (46L60)

Recommendations

• Quantum entanglement and approximation by positive matrices
• Constructing positive maps from block matrices
• Positive maps, positive polynomials and entanglement witnesses
• Geometry of quantum states: new construction of positive maps
• Entanglement witnesses generated by positive maps

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• scientific article; zbMATH DE number 52497 (Why is no real title available?)
• scientific article; zbMATH DE number 1849957 (Why is no real title available?)
• A quantitative Pólya's Theorem with corner zeros
• An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
• An exact Jacobian SDP relaxation for polynomial optimization
• An exact duality theory for semidefinite programming based on sums of squares
• Computing sum of squares decompositions with rational coefficients
• Construction of noisy bound entangled states and the range criterion
• Entangled Systems
• Entanglement Breaking Channels
• Experimental quantum teleportation
• Facial reduction for exact polynomial sum of squares decomposition
• Fractal States for Quantum Information Processing
• Global optimization with polynomials and the problem of moments
• How often is a random quantum statek-entangled?
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Introduction to quantum information science.
• Mixed-State Entanglement and Distillation: Is there a “Bound” Entanglement in Nature?
• On the role of entanglement in quantum-computational speed-up
• Positive maps and separable matrices
• Positive maps of low dimensional matrix algebras
• Positive semidefinite biquadratic forms
• Pre- and Post-Processing Sum-of-Squares Programs in Practice
• Pólya's theorem with zeros
• Quantum cryptography based on Bell’s theorem
• Quantum information. An introduction to basic theoretical concepts and experiments
• Rational sums of hermitian squares of free noncommutative polynomials
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Semidefinite programming relaxations for semialgebraic problems
• Separability criterion and inseparable mixed states with positive partial transposition.
• Some NP-complete problems in quadratic and nonlinear programming
• Sums of squares and varieties of minimal degree
• There are many more positive maps than completely positive maps
• Uniform denominators in Hilbert's seventeenth problem

This page was built for publication: A practical approach to SOS relaxations for detecting quantum entanglement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6050141)