arXiv (All)
open access
Breaking $1/ε$ Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
Quantum zero-sum games are bilinear saddle-point problems over density matrices. We study how their semidefinite geometry governs last-iterate convergence beyond existing $O(1/\varepsilon)$ average-iterate guarantees [arXiv:2311.10859]. We establish a Holder error bound with a finite, game-dependent
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
- Hyperplane winning for bad in manifolds#1249462
- Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms#458286
- The multiple Markov theorem on Angelesco sets#984032
- The Eigenvalue Region of a Family of Markov Chains with Randomness Confined to Two States#1361496
- A Noise Operator Approach to Quantum Query Complexity and Time-Space Tradeoff Lower Bounds#1157308
Record · ID 1199699
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