Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation
arXiv:2407.14163 · doi:10.1103/kb94-tf7t
Abstract
Simulation of quantum many-body systems is a promising application of quantum computers. However, implementing the time-evolution operator as a quantum circuit efficiently on near-term devices with limited resources is challenging. Standard approaches like Trotterization often require deep circuits, making them impractical. This paper proposes a hybrid quantum-classical algorithm called Local Subspace Variational Quantum Compilation (LSVQC) for compiling the time-evolution operator. The LSVQC uses variational optimization to reproduce the action of the target time-evolution operator within a physically reasonable subspace. Optimization is performed on small local subsystems based on the Lieb-Robinson bound, allowing for cost function evaluation using small-scale quantum devices or classical computers. Numerical simulations on a spin-lattice model and an effective model of strongly correlated material SrCuO demonstrate the algorithm's effectiveness. It is shown that the LSVQC achieves a 95% reduction in circuit depth compared to Trotterization while maintaining accuracy. The subspace restriction also reduces resource requirements and improves accuracy. Furthermore, we estimate the gate count needed to execute the quantum simulations using the LSVQC on near-term quantum computing architectures in the noisy intermediate-scale or early fault-tolerant quantum computing era. Our estimation suggests that the acceptable physical gate error rate for the LSVQC can be significantly larger than for Trotterization.
29 pages, 14 figures
References in corpus (23)
- Quantum ESPRESSO: a modular and open-source software project for quantum simulations of materials
- Advanced capabilities for materials modelling with Quantum ESPRESSO
- Quantum ESPRESSO toward the exascale
- Scanning tunneling spectroscopy of high-temperature superconductors
- Lieb-Robinson Bounds and the Exponential Clustering Theorem
- Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
- Propagation of Correlations in Quantum Lattice Systems
- Nearly-linear light cones in long-range interacting quantum systems
- Quantum circuits for strongly correlated quantum systems
- Electronic Structure Calculation by First Principles for Strongly Correlated Electron Systems
- Ab initio Derivation of Low-energy Model for Iron-Based Superconductors LaFeAsO and LaFePO
- Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
- Towards near-term quantum simulation of materials
- Classical simulation of short-time quantum dynamics
- Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
- ADAPT-QSCI: Adaptive Construction of an Input State for Quantum-Selected Configuration Interaction
- Local variational quantum compilation of a large-scale Hamiltonian dynamics
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- Trotter error with commutator scaling for the Fermi-Hubbard model
- Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms
- On proving the robustness of algorithms for early fault-tolerant quantum computers
- Computation of Green's function by local variational quantum compilation
- Simulator Demonstration of Large Scale Variational Quantum Algorithm on HPC Cluster