On the complexity of approximating the diamond norm

MaRDI QIDQ3400474zbMATH OpenFDO

Authors Avraham Ben-Aroya, Amnon Ta-Shma

Publication date 5 February 2010

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

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Computing stabilized norms for quantum operations via the theory of completely bounded maps
• On a measure of distance for quantum strategies
• Semidefinite programs for completely bounded norms
• QIP = PSPACE
• A family of norms with applications in quantum information theory. II

Cited in

(6)

• On a measure of distance for quantum strategies
• Computing stabilized norms for quantum operations via the theory of completely bounded maps
• High-rate codes with sublinear-time decoding
• Exact performance of the five-qubit code with coherent errors
• The quantum complexity of computing Schatten \(p\)-norms
• On the complexity of submodular function minimisation on diamonds

This page was built for publication: On the complexity of approximating the diamond norm

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