AutoQResearch: LLM-Guided Closed-Loop Policy Search for Adaptive Variational Quantum Optimization
Monit Sharma, Hoong Chuin Lau

TL;DR
AutoQResearch introduces an LLM-guided closed-loop framework for adaptive variational quantum optimization, enabling autonomous discovery of effective solver policies across combinatorial problems.
Contribution
The paper presents a novel LLM-guided policy search framework that adaptively configures variational quantum algorithms for combinatorial optimization tasks.
Findings
Discovered policies outperform static baselines on MIS instances.
CVaR objectives are effective at small scale, QRAO-based qubit compression scales well.
Framework discovers adaptations like sampling budget and hybrid repair protocols for CVRP.
Abstract
Configuring variational quantum algorithms for combinatorial optimization remains a difficult, expert-driven process requiring coordinated choices over solver family, ansatz, objective, and optimizer. We present AutoQResearch, an LLM-guided closed-loop experimentation framework that casts this task as sequential policy search over a curated design space. Instead of a single static configuration, the framework searches for adaptive solver-control policies that condition future decisions on diagnostics such as feasibility, optimality gap, and convergence stagnation. The system operates through a structured workflow: an LLM agent edits a small policy surface under a fixed evaluation harness, candidate policies are screened using cheap scout evaluations, and only the strongest candidates are promoted to full confirmation. This enables controlled autonomous exploration while guarding…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
