Semidefinite programs for completely bounded norms

2009/01/29 by John Watrous, Watrous, John · 17 citations
Computer Science · Mathematics · Physics and Astronomy · #Advanced Optimization Algorithms Research #Machine Learning and Algorithms #Numerical Methods and Algorithms #quant-ph

paper · pdf · doi:10.48550/arxiv.0901.4709

17 pages, references added in version 2

arxiv created 2009/04/15 · arxiv updated 2009/12/01

Abstract

The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate proofs of some known facts about them.

Citations

• Semidefinite Programming

Cited by

• Metrics on completely positive maps via noncommutative geometry
• Fault-tolerant quantum computation with constant overhead for general noise
• Covariant Measures of Non-Markovianity in Curved Spacetime
• Weight-based measure of quantum memory as a universal and operational benchmark
• The quantum communication power of indefinite causal order
• Erasing, Converting, and Communicating: The Power of Resource-Nongenerating Operations
• Computation of the Smooth Max-Mutual Information via Semidefinite Programming
• Relations between different quantum Rényi divergences
• Quantification of Quantum Dynamical Properties with Two Experimental Settings
• Computational Distinguishability of Quantum Channels
• Instrument-based quantum resources: quantification, hierarchies and towards constructing resource theories
• Tighter Error Bounds for the qDRIFT Algorithm
• Benchmarking gate-based quantum devices via certification of qubit von Neumann measurements
• Efficient Quantum Gibbs Sampling with Local Circuits
• Performance of rotation-symmetric bosonic codes in the presence of random telegraph noise
• A family of norms with applications in quantum information theory
• Robustness Verification of Quantum Classifiers

Related

• Simpler semidefinite programs for completely bounded norms
• A Family of Norms With Applications In Quantum Information Theory II
• Semidefinite programming formulations for the completely bounded norm of a tensor
• Remarks on the Grothendieck norm
• A Semidefinite Representation for some Minimum Cardinality Problems