Unverified50% confidenceFactExact time
For a quantum system of dimension d, the regret lower bound for online learning of quantum states grows at a rate of at least Ω(√T), where T is the number of rounds.
1
Sources
50%
Confidence
Long-term
Relevance
10/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedIn mathematics, blowup refers to the L∞ norm of the velocity field tending to infinity at some finite time T*61% similarUnverifiedΘ(log T) means that as the total number of simulation rounds T increases, the number of replications per sampling point increases slowly at a logarithmic rate; for example, when T increases from one thousand to one million, log T only roughly doubles.60% similarUnverified理论分析表明，在时间步长为T的轨迹上，行为克隆的累积误差以O(T²)的速度增长60% similarUnverifiedGoogle 2023 年发布的实验结果表明，将逻辑量子比特规模从距离-3 扩展到距离-5 时逻辑错误率有所下降60% similarUnverifiedThe paper establishes for the first time a regret lower bound for online learning of quantum states under the logarithmic loss.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1046128API
curl https://kongchang.com/api/v1/knowledge/claims/1046128MCP
get_claim(id=1046128)