Simpler semidefinite programs for completely bounded norms
From MaRDI portal
Publication:5414627
DOI10.4086/cjtcs.2013.008zbMath1286.81036arXiv1207.5726OpenAlexW4248555592MaRDI QIDQ5414627
Publication date: 7 May 2014
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.5726
Semidefinite programming (90C22) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (9)
Fidelity between one bipartite quantum state and another undergoing local unitary dynamics ⋮ Almost all quantum channels are equidistant ⋮ Conditions for optimal input states for discrimination of quantum channels ⋮ Exact performance of the five-qubit code with coherent errors ⋮ Geometric distinguishability measures limit quantum channel estimation and discrimination ⋮ Universality and optimality in the information-disturbance tradeoff ⋮ Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity ⋮ Randomized benchmarking with confidence ⋮ Unnamed Item
This page was built for publication: Simpler semidefinite programs for completely bounded norms