Skip to content
DraconiticResearch
Search Sources API
190,332 studies31 sourcesUpdated 44 min ago
PreprintarXiv licencearXiv

Quantum inflation and source-transfer hierarchies are complete for tree networks

Abstract

Understanding the capabilities and limits of quantum systems is central to quantum information processing. This includes determining which correlations can arise in networks of quantum systems distributed by independent sources. Yet for general quantum networks, no systematic, dimension-free method is known to bound these correlations arbitrarily well. We resolve this problem for all quantum tree networks through a new source-transfer model, which we prove equivalent to a mixed quantum model. The mixed model places no restriction on dimension and reduces to the standard tensor-product model in finite dimensions; the source-transfer model instead describes these correlations through states on C*-algebras and completely positive maps composed recursively along the tree. We prove the equivalence by reconstructing local measurements as Radon-Nikodym derivatives in the spatial tensor products prescribed by the network. Building on this characterization, we establish two convergent outer hierarchies of semidefinite programs (SDPs): a new source-transfer hierarchy and the inflation-NPA hierarchy. For the source-transfer hierarchy, we extend noncommutative real algebraic geometry to multi-state polynomials with completely positive maps, prove a reconstruction theorem establishing its convergence, and give a sufficient stopping criterion for extracting finite-dimensional realizations. For the inflation-NPA hierarchy, we reconstruct source-transfer realizations from weak-operator limits of averages over source copies produced by quantum inflation. Consequently, the game-value promise problem for quantum tree networks in the mixed model is coRE-complete.

Related

  1. Optimization hierarchies for extremal geometry through complete positivity
    Bram Bekker
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  2. Quantum hierarchies of the ILW and BO equations and the DR cycles on the moduli spaces of curves
    Alexandr Buryak, Abner Hernandez Rodriguez
    arXivPreprintarXiv licenceFull textAlgebra & number theoryMathematical physicsarXiv
  3. Perfect state transfer on mixed graphs: complete classes and transfer times
    Xingkun Song
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsQuantum physics & quantum informationarXiv
  4. Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization
    Shixin Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs
    Koushik Bhakta, Bikash Bhattacharjya
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsQuantum physics & quantum informationarXiv
BibTeX
@misc{xu2026quantum,
  title = {{Quantum inflation and source-transfer hierarchies are complete for tree networks}},
  author = {Xiangling Xu and Igor Klep and Marc-Olivier Renou},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.19310},
  eprint = {2609.19310},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.19310},
}
RIS
TY  - UNPB
TI  - Quantum inflation and source-transfer hierarchies are complete for tree networks
AU  - Xiangling Xu
AU  - Igor Klep
AU  - Marc-Olivier Renou
PY  - 2026
DA  - 2026/09/20
PB  - arXiv
DO  - 10.48550/arxiv.2609.19310
UR  - https://arxiv.org/abs/2609.19310
AB  - Understanding the capabilities and limits of quantum systems is central to quantum information processing. This includes determining which correlations can arise in networks of quantum systems distributed by independent sources. Yet for general quantum networks, no systematic, dimension-free method is known to bound these correlations arbitrarily well. We resolve this problem for all quantum tree networks through a new source-transfer model, which we prove equivalent to a mixed quantum model. The mixed model places no restriction on dimension and reduces to the standard tensor-product model in finite dimensions; the source-transfer model instead describes these correlations through states on C^*-algebras and completely positive maps composed recursively along the tree. We prove the equivalence by reconstructing local measurements as Radon-Nikodym derivatives in the spatial tensor products prescribed by the network. Building on this characterization, we establish two convergent outer hierarchies of semidefinite programs (SDPs): a new source-transfer hierarchy and the inflation-NPA hierarchy. For the source-transfer hierarchy, we extend noncommutative real algebraic geometry to multi-state polynomials with completely positive maps, prove a reconstruction theorem establishing its convergence, and give a sufficient stopping criterion for extracting finite-dimensional realizations. For the inflation-NPA hierarchy, we reconstruct source-transfer realizations from weak-operator limits of averages over source copies produced by quantum inflation. Consequently, the game-value promise problem for quantum tree networks in the mixed model is coRE-complete.
ER  -