QSim-Arena: an evolving developer for quantum simulation advantage
Organizations: QICI Quantum Information and Computation Initiative, Department of Computer Science, School of Computing and Data Science, The University of Hong Kong, Pokfulam Road, Hong Kong SAR, China · Foresight Quantum, Shanghai, China
Abstract
Where practical advantage emerges in quantum dynamics simulation remains a central debate in quantum computing. Claimed advantages can be rapidly narrowed or overturned by stronger classical methods, while progress on both sides can outpace the journal publication cycle. We present QSim-Arena, a research framework in which AI agents combine a closed loop of verification and benchmarking with open exploration. Hamiltonians, initial states and accuracy targets for evolved states or observable expectation values provide explicit specifications for evaluating simulation methods. Agents translate published techniques into executable components, reproduce reported results and benchmark their performance across diverse Hamiltonian families. Competing classical methods are implemented and independently crosschecked, providing credible baselines for end-to-end quantum resource estimates based on rigorous error bounds and empirical calibration. Alongside this closed loop, agents recombine classical simulation techniques and co-design fault-tolerant quantum circuits using knowledge extracted from the literature. Initial applications improve baseline resource estimates through the integration of established techniques. QSim-Arena thus treats quantum advantage assessment as an evolving, reproducible research process that can respond to advances in algorithms, error analysis and hardware.
Figures & tables
| What was wrong | Caught by, and how | What changed |
|---|---|---|
| The reason given for not running real-time quantum Monte Carlo said its sign problem holds “in any basis” | A, from the Schwinger model’s own tractability report | Narrowed to the bases actually examined, with the problem called generic rather than unconditional; inputs rebuilt |
| Certified shot counts were not computed by a rigorous concentration bound | A (finding P2), relayed by C; Q rebuilt the table | Hoeffding counting; every certified cost rose |
| The reported range of the Hamming-weight-phasing gain quoted its end points, not its peak | R, recounting from the published theorem without the stage code | Range corrected in the frontiers ledger (A) |
| A route to a new rigorous Trotter bound for the hydrogen chain was registered as possibly new | R’s registered search for prior art, sealed by A before it ran | Its pieces were published; relabelled catch-up and the bet closed |
Quantum Circuit Simulation
Quantum circuit simulation develops classical methods and tools to predict quantum-circuit behavior, performance, and resource costs.
See all 16 papers