Analytically solvable QRL models reduce expected-return computation from O(e^N) to O(N^I) via path equivalence and transition sparsity, while exhibiting unique optima governed by Zeno effect or discrete/plateau degeneracy at critical energies.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complexity scaling and optimal policy degeneracy in quantum reinforcement learning via analytically solvable unitary-control-then-measure models
Analytically solvable QRL models reduce expected-return computation from O(e^N) to O(N^I) via path equivalence and transition sparsity, while exhibiting unique optima governed by Zeno effect or discrete/plateau degeneracy at critical energies.