Metraipolis › archive › dc_6e3db63aaa9c

Submodularity of entropy under quantum convolution — arXiv:2609.40211

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40211
License (as archived)
CC0-1.0
Archived
2026-10-07T14:19:26.283Z
SHA-256 of the archived text
135695c0d2b73f6bc84d9ef9b7944cd75eafa83ae258b2eb6df85399c3b8d519
Stable URL of this page
https://metraipolis.com/documento/dc_6e3db63aaa9c

How to cite

Submodularity of entropy under quantum convolution — arXiv:2609.40211 — arXiv (en), https://arxiv.org/abs/2609.40211 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6e3db63aaa9c (Metraipolis archive dc_6e3db63aaa9c, sha256 135695c0d2b73f6bc84d9ef9b7944cd75eafa83ae258b2eb6df85399c3b8d519)
BibTeX
@misc{dc6e3db63aaa9c,
  title = {Submodularity of entropy under quantum convolution — arXiv:2609.40211},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40211},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6e3db63aaa9c; sha256 135695c0d2b73f6bc84d9ef9b7944cd75eafa83ae258b2eb6df85399c3b8d519},
  year = {2026}
}

Archived text

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

We develop a submodular framework for the von Neumann entropy of discrete quantum convolutions, providing a noncommutative counterpart to the direct side of entropic additive combinatorics. We first introduce globally weighted quantum convolutions, which form compatible families indexed by admissible subsets of a fixed collection of inputs. Our main theorem reveals a polymatroidal geometry underlying their entropy growth: relative to any fixed admissible input block, the entropy gains admit a normalized, monotone, submodular extension to all subsets of the remaining inputs. The theorem yields convolutional strong subadditivity, quantum Ruzsa triangle inequality, and quantum entropic Plünnecke--Ruzsa inequalities for arbitrary input states. For repeated inputs, it gives sharp comparisons of entropy growth across admissible scales; in particular, the quantum doubling constant controls all higher admissible convolution entropies with optimal exponents. Together, these results bring submodular methods from additive combinatorics into the quantum setting and provide a systematic route to broad families of convolutional entropy inequalities.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.CO).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.40211 — 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-07T14:05:16.463Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).