Simpler semidefinite programs for completely bounded norms

Abstract

The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J. Watrous, Theory of Computing 5: 11, 2009). This paper presents two new, and arguably much simpler, semidefinite programming formulations of these norms.

15 pages, reference added in version 2

Cited by in corpus (11)

• Randomized Benchmarking with Confidence
• Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity
• Guaranteed recovery of quantum processes from few measurements
• Quantitative Robustness Analysis of Quantum Programs (Extended Version)
• Shallow unitary decompositions of quantum Fredkin and Toffoli gates for connectivity-aware equivalent circuit averaging
• Improving compressed sensing with the diamond norm
• Numerical and analytical results for geometric measure of coherence and geometric measure of entanglement
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation
• Is absolute separability determined by the partial transpose?
• Real Schur norms and Hadamard matrices
• Quantum simulation of Pauli channels and dynamical maps: algorithm and implementation