arXiv (All)
open access
How fast can a parent estimate the value of their children? A quantum algorithm for stochastic games
We give a quantum algorithm for stochastic $2$-player games. Their game trees are the expectiminimax trees of classical game search: $m$ adversarial layers alternate with $m$ chance layers, every node has $deg$ children, and the leaf values lie in an interval of length $N$. The algorithm estimates t
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
- Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms#458286
- King Chasing Problem in Chinese Chess is NP-hard#652256
- King Chasing Problem in Chinese Chess is NP-hard#650803
- Evolutionary path from a prisoner's dilemma to a harmony game via hawk-dove games.#263252
- A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code#183143
Record · ID 1130092
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