Curator's Take
AI Commentary
This article shows that a pool‑free, residual‑triggered growth strategy for variational imaginary‑time evolution can outperform the popular ADAPT‑VQE and AVQITE approaches on non‑integrable spin chains and stretched H₄ by cutting required circuit depth by up to a factor of five. By fixing the operator order through nested Hamiltonian commutators and only adding layers when the McLachlan residual exceeds a threshold, the method sidesteps the expensive screening and full re‑optimization steps that dominate adaptive algorithms. The result suggests a practical route to more resource‑efficient near‑term simulations of strongly correlated systems, though the advantage fades for integrable models or ultra‑high‑precision targets.
— Mark Eatherly
Summary
Adaptive variational algorithms such as ADAPT-VQE and AVQITE screen an operator pool at every growth step, and ADAPT-VQE also re-optimizes all parameters. We study a pool-free alternative for variational imaginary-time evolution (VITE). The layers are fixed in advance by nested commutators of the Hamiltonian, grouped by symmetry and particle number, and the next layer is appended when the relative McLachlan residual exceeds a threshold. On five non-integrable systems (the mixed-field Ising chain and tori, and stretched H$_4$), this dynamic VITE reaches a relative error of $10^{-4}$ with 1.6-5.4 times fewer circuits than the cheapest of six to eight adaptive variants, including single-Pauli-string and qubit-excitation pools and batched ADAPT-VQE. On the chain the advantage persists from 8 to 16 sites. Screening and re-optimization account for most of the adaptive methods' cost. On the spin models, a longitudinal-field scan shows that the advantage requires broken integrability, which makes adaptive screening expensive. The advantage is lost on transverse-field Ising models, at tight targets (relative error $10^{-6}$) and where the schedule front-loads weak layers.