hardware algorithms simulation

HamQASBench: A Hamiltonian-Informed Diagnostic Benchmark for Evaluating Quantum Architecture Search

Curator's Take

This article matters because it introduces HamQASBench, the first benchmark that groups quantum‑chemistry problems by Hamiltonian structure rather than just size and evaluates architecture search methods with diagnostics such as entanglement distribution and pairwise fidelity. By exposing failure modes—over‑parameterization on near‑product states, degeneracy‑driven eigenstate locking, representation bottlenecks in strongly correlated systems, routing limits from hardware topology, and exploding search spaces—it gives both algorithm designers and hardware engineers a clearer picture of where current QAS pipelines break down. The work builds on the recent surge of variational quantum algorithms and provides a practical tool for steering future QAS research toward more scalable, hardware‑aware circuit designs.

— Mark Eatherly

Summary

Quantum Architecture Search (QAS) automates the design of parameterized quantum circuits for variational quantum algorithms, yet existing benchmarks organize instances by molecular identity or qubit count -- criteria agnostic to Hamiltonian structure -- and rely solely on energy accuracy, which cannot detect structural failures such as over-parameterization on near-product ground states. We introduce HamQASBench, a Hamiltonian-informed diagnostic benchmark organizing 11 molecules into five structural tiers via fingerprints derived from the Pauli operator basis, computational basis representation, and ground-state entanglement. A post-hoc critical-structure extraction procedure identifies minimal circuits consistent with each tier's requirements, complementing energy-based evaluation with per-qubit entanglement analysis and pairwise state fidelity. Benchmarking five QAS methods across four paradigms reveals failure modes invisible to conventional metrics: over-parameterization in the minimalism regime, eigenstate commitment under degeneracy, a representation bottleneck in strongly correlated systems, topology-induced routing failure, and circuit search space growth as a scalability bottleneck.