Semidefinite programs for completely bounded norms

DOI10.4086/TOC.2009.V005A011MaRDI QIDQ3002811zbMATHOpenAlexFDO

Authors John Watrous

Publication date 24 May 2011

Published in Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0901.4709

zbMATH Keywords

semidefinite programmingquantum informationcompletely bounded normdiamond norm

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Recommendations

• Simpler semidefinite programs for completely bounded norms
• A family of norms with applications in quantum information theory. II
• Computing stabilized norms for quantum operations via the theory of completely bounded maps
• Semidefinite Programming
• On the complexity of semidefinite programs

Cited in

(27)

• A family of norms with applications in quantum information theory. II
• Quantifying channel coherence via the norm distance
• Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
• Simpler semidefinite programs for completely bounded norms
• Refined diamond norm bounds on the emergence of objectivity of observables
• Converting multilevel nonclassicality into genuine multipartite entanglement
• Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)
• Generalized smooth mutual max-information of quantum channel
• Thermodynamic implementations of quantum processes
• Real Schur norms and Hadamard matrices
• Rank-one quantum games
• On semidefinite programming characterizations of the numerical radius and its dual norm
• On the complexity of approximating the diamond norm
• Approximating projections by quantum operations
• Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks
• Universality and optimality in the information-disturbance tradeoff
• Dimensionality reduction of SDPs through sketching
• Computing stabilized norms for quantum operations via the theory of completely bounded maps
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• On a measure of distance for quantum strategies
• Mixing properties of stochastic quantum Hamiltonians
• Fidelity of quantum strategies with applications to cryptography
• Quantification of resource theory of imaginarity
• Semidefinite programming hierarchies for constrained bilinear optimization
• Asymptotic reversibility of thermal operations for interacting quantum spin systems via generalized quantum Stein's lemma
• Semi-definite programming and quantum information
• Exact performance of the five-qubit code with coherent errors

This page was built for publication: Semidefinite programs for completely bounded norms

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