Variational quantum computing for quantum simulation: principles, implementations, and challenges
Lucas Q. Galvão, Anna Beatriz M. de Souza, Marcelo A. Moret, Clebson Cruz
TL;DR
This paper surveys variational quantum computing as a practical framework for quantum simulation on noisy intermediate-scale devices, arguing that quantum data and hybrid quantum–classical workflows can tackle problems beyond classical capabilities under appropriate trainability and noise conditions. It unifies VQAs and QML into a common toolkit, detailing ansatz design (PMA vs. HHA), cost-function crafting, and gradient estimation via the parameter-shift rule, while candidly addressing barren plateaus and measurement-noise limitations. The implementations section inventories ground- and excited-state methods (VQE, VQD, qUCC), dynamical simulations (closed and open systems with McLachlan’s principle and Lindblad dynamics), thermal-state preparation (VQT, QITE), and quantum-learning approaches, illustrating how these techniques enable practical quantum-simulation tasks such as molecular energies, time evolution, and Gibbs-state preparation. Collectively, the work highlights opportunities for hardware-aware algorithm design, co-design of hardware and software, and targeted application domains where variational methods may yield meaningful quantum advantage in the near term, while outlining persistent challenges that guide future research.
Abstract
This work presents a comprehensive overview of variational quantum computing and their key role in advancing quantum simulation. This work explores the simulation of quantum systems and sets itself apart from approaches centered on classical data processing, by focusing on the critical role of quantum data in Variational Quantum Algorithms (VQA) and Quantum Machine Learning (QML). We systematically delineate the foundational principles of variational quantum computing, establish their motivational and challenges context within the noisy intermediate-scale quantum (NISQ) era, and critically examine their application across a range of prototypical quantum simulation problems. Operating within a hybrid quantum-classical framework, these algorithms represent a promising yet problem-dependent pathway whose practicality remains contingent on trainability and scalability under noise and barren-plateau constraints.This review serves to complement and extend existing literature by synthesizing the most recent advancements in the field and providing a focused perspective on the persistent challenges and emerging opportunities that define the current landscape of variational quantum computing for quantum simulation.
