Metraipolis › archive › dc_dc6457e55cec

A Sum-of-Squares Hierarchy with Quadratic Convergence for Quantum Channel Coding — arXiv:2609.09629

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.09629
License (as archived)
CC0-1.0
Archived
2026-10-16T10:53:30.443Z
SHA-256 of the archived text
99f95abaece96088b14ab9f1878b39fcfb2a828f50f4547b16951cc2995cb2da
Stable URL of this page
https://metraipolis.com/documento/dc_dc6457e55cec

How to cite

A Sum-of-Squares Hierarchy with Quadratic Convergence for Quantum Channel Coding — arXiv:2609.09629 — arXiv (en), https://arxiv.org/abs/2609.09629 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dc6457e55cec (Metraipolis archive dc_dc6457e55cec, sha256 99f95abaece96088b14ab9f1878b39fcfb2a828f50f4547b16951cc2995cb2da)
BibTeX
@misc{dcdc6457e55cec,
  title = {A Sum-of-Squares Hierarchy with Quadratic Convergence for Quantum Channel Coding — arXiv:2609.09629},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09629},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dc6457e55cec; sha256 99f95abaece96088b14ab9f1878b39fcfb2a828f50f4547b16951cc2995cb2da},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09629. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Computing the optimal success probability for transmitting classical messages through a single use of a quantum channel is NP-hard, even for two messages. An existing semidefinite programming hierarchy based on symmetric extensions provides convergent upper bounds with an a priori error estimate that decays as the inverse square root of the extension level. In this work, we construct a Hermitian sum-of-squares hierarchy for an arbitrary number of messages and prove quadratic convergence in its level. The error bound is proportional to the advantage over random guessing. Our approach combines state-discrimination duality with positive polynomial kernels on products of spheres to construct feasible polynomial dual certificates. For binary messages, the resulting bounds give a multiplicative approximation from above of the trace-norm contraction coefficient.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.09629 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T09:00:25.857Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).