arXiv (All)
open access
Conditions for Global Optimality in Quantum Arimoto-Blahut Algorithms
Generalized Arimoto--Blahut (AB) algorithms are widely used in information theory and quantum optimization, but monotonic objective decrease and numerical stabilization do not guarantee global optimality. We establish necessary and sufficient conditions for the global optimality of full-rank AB fixe
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Approximate Quantum State Preparation Through Proximal Policy Optimization#394428
- A note on the quantum Wielandt inequality#139157
- Solving Graph Coloring Problems Using Feedback-Based Algorithm for Quantum Optimization#1105550
- 量子竞争策略:经典完全竞争与垄断竞争理论的量子重构与一般化拓展(Quantum Competition Strategy: Quantum Reconstruction and Generalized Expansion of Classical Perfect Competition and Monopolistic Competition Theory)#212714
- Nonlinear Optimization#67412
Record · ID 996557
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive