A practical approach to SOS relaxations for detecting quantum entanglement

DOI10.1007/S10957-023-02258-5OpenAlexW4382600718MaRDI QIDQ6050141FDOQ6050141

Authors: Abhishek Bhardwaj 

Publication date: 18 September 2023

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

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

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

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)

Cites Work

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

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)