Research map / Bandits and online learning / Multi-armed bandits
Quantum Speedup of Multi-armed Bandits at Scale by Tackling Memory Decoherence
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Studies quantum multi-armed bandit best-arm identification at scale, addressing memory decoherence that limits existing quantum MAB implementations.
Problem
Quantum n-arm multi-armed bandit best-arm identification algorithms achieve O(n/Δ[2]) query complexity but remain small-scale in implementation due to various factors, including memory decoherence.
Approach
Targets memory decoherence to make quantum MAB speedups practical at larger scale; the abstract's specific mechanism is not stated in the provided text.
Key results
- Prior quantum n-arm MAB best-arm identification achieves O(n/Δ[2]) query complexity, a quadratic speedup over classical methods (as stated in the abstract).
Limitations
- Full text unavailable; method details not verified.
Experimental setup
Metrics: query complexity
Closest papers by meaning
- Quantum Best Arm Identification with Quantum Oracles (AAAI 2025 · similarity 0.88)
- QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design (NeurIPS 2025 · similarity 0.85)
- Purest Quantum State Identification (NeurIPS 2025 · similarity 0.85)
- Toward the Goldilocks Blind Compression of Quantum States (NeurIPS 2026 · similarity 0.85)
- Training-Free Quantum Architecture Search (AAAI 2024 · similarity 0.85)
- TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search (NeurIPS 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.