{
  "abstract": "Information-based diffusion schedules organize the reverse problem by prescribing how much source information remains after each forward step. For mixed-state quantum diffusion, density-level targets need not correspond to trajectories reachable from the current realization. We introduce \\emph{channel-constrained information scheduling}: each step optimizes over source-blind pure-state refinements reachable from the current state-resolved record through the prescribed channel. This defines a channel-constrained information clock $V_ξ$, whose inverse selects the least-corrupting step that reaches a target information level. Recursive inversion constructs a realizable equal-information schedule minimizing the worst source-information burden in Bayes reverse prediction. We establish attainment, continuity, monotonicity, convexity, finite support, and exact primal/dual formulations for $V_ξ$. We further give a sharp structural characterization: binary-qubit depolarizing trajectories attain the density-level Belavkin--Staszewski envelope, whereas every $d\\ge3$ admits binary noncommuting families with a strict static--dynamic separation. Qutrit experiments show that the proposed scheduler nearly equalizes the realized multi-step burden, and learned reverse predictors recover the predicted allocation.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.26273",
  "author_total": 2,
  "authors": [
    {
      "name": "Qipeng Qian"
    },
    {
      "name": "Yuntao Qian"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/8ggnapsyctrwx.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.26273",
  "fulltext_url": null,
  "id": "8ggnapsyctrwx",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.26273",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Information and Cryptography"
    ]
  ],
  "openalex": "W7214066784",
  "pdf_url": "https://arxiv.org/pdf/2609.26273",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-01",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/8ggnapsyctrwx.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:23:39Z",
      "native_id": "2609.26273",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.26273"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Channel-Constrained Information Scheduling for Quantum Diffusion",
  "title_text": "Channel-Constrained Information Scheduling for Quantum Diffusion",
  "type": "preprint",
  "updated_at": "2026-10-30T12:23:39Z",
  "url": "https://research.draconitic.com/paper/8ggnapsyctrwx",
  "venue": "arXiv",
  "versions": []
}