arXiv (All)
open access
Relative-Entropy Geometry and Convergence in Nonconvex Wiretap Optimization
We develop and analyze an entropic descent method for a nonconvex optimization problem on probability simplices arising in classical and quantum secure communication. The optimization variables describe a randomized encoder, allowing its input distribution and stochastic preprocessing to be optimize
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
- Adversarial Information Gain in Non-ideal Quantum Measurements#1014621
- A statistical evaluation of uncertainty disentanglement methods#464015
- Inequivalent Quantum Resources from Multipartite State Discrimination#1234510
- Bath dimension and initial entropy for closed repeated use of a quantum channel#1012463
- Experimental Side Channel Analysis of Protocol Stages in Quantum Identity Authentication#405583
Record · ID 1344280
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