Correcting and extending Trotterized quantum many-body dynamics
arXiv:2502.13784 · doi:10.1103/1nqt-x5xh
Abstract
A complex but important challenge in understanding quantum mechanical phenomena is the simulation of quantum many-body dynamics. Although quantum computers offer significant potential to accelerate these simulations, their practical application is currently limited by noise and restricted scalability. In this work, we address these problems by proposing a hybrid ansatz combining the strengths of quantum and classical computational methods. Using Trotterization, we evolve an initial state on the quantum computer according to a simplified Hamiltonian, focusing on terms that are difficult to simulate classically. A classical model then corrects the simulation by including the terms omitted in the quantum circuit. While the classical ansatz is optimized during the time evolution, the quantum circuit has no variational parameters. Derivatives can thus be calculated purely classically, avoiding challenges arising in the optimization of parameterized quantum circuits. We demonstrate three applications of this hybrid method. First, our approach allows us to avoid SWAP gates in the quantum circuit by restricting the quantum part of the ansatz to hardware-efficient terms of the Hamiltonian. Second, we can mitigate errors arising from the Trotterization of the time evolution unitary. Finally, we can extend the system size while keeping the number of qubits on the quantum device constant by including additional degrees of freedom in the classical ansatz.
16 pages, 7 figures
References in corpus (59)
- Quantum Computing in the NISQ era and beyond
- The density-matrix renormalization group in the age of matrix product states
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Electronic Structure Calculations with Dynamical Mean-Field Theory: A Spectral Density Functional Approach
- Efficient classical simulation of slightly entangled quantum computations
- Solving the Quantum Many-Body Problem with Artificial Neural Networks
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum computational chemistry
- Quantum Circuit Learning
- Quantum many-body systems out of equilibrium
- Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
- Evaluating analytic gradients on quantum hardware
- Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
- Hamiltonian Simulation by Qubitization
- Hartree-Fock on a superconducting qubit quantum computer
- Quantum error correction below the surface code threshold
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Efficient variational quantum simulator incorporating active error minimisation
- Toward the first quantum simulation with quantum speedup
- Theory of variational quantum simulation
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Trading classical and quantum computational resources
- Quantum embedding theories
- Simulating Large Quantum Circuits on a Small Quantum Computer
- Finding Exponential Product Formulas of Higher Orders
- Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
- Doubling the size of quantum simulators by entanglement forging
- Hardware-efficient variational quantum algorithms for time evolution
- Variational Quantum Eigensolver with Fewer Qubits
- NetKet 3: Machine Learning Toolbox for Many-Body Quantum Systems
- Quantum hardware simulating four-dimensional inelastic neutron scattering
- An efficient quantum algorithm for the time evolution of parameterized circuits
- Circuit knitting with classical communication
- Quantum simulation of non-equilibrium dynamics and thermalization in the Schwinger model
- Constructing a virtual two-qubit gate by sampling single-qubit operations
- Classically optimized Hamiltonian simulation
- Quantum simulation with hybrid tensor networks
- Accurately computing electronic properties of a quantum ring
- Quantum HF/DFT-Embedding Algorithms for Electronic Structure Calculations: Scaling up to Complex Molecular Systems
- Time Dependent Variational Principle for Tree Tensor Networks
- Variational Quantum-Neural Hybrid Eigensolver
- Subspace Variational Quantum Simulator
- Unbiasing time-dependent Variational Monte Carlo by projected quantum evolution
- Overhead for simulating a non-local channel with local channels by quasiprobability sampling
- Low cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem
- Cluster Density Matrix Embedding Theory for Quantum Spin Systems
- Role of stochastic noise and generalization error in the time propagation of neural-network quantum states
- Perturbative quantum simulation
- Variational Quantum Time Evolution without the Quantum Geometric Tensor
- Block product density matrix embedding theory for strongly correlated spin systems
- Problem specific classical optimization of Hamiltonian simulation
- Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws
- Overhead-constrained circuit knitting for variational quantum dynamics
- Adaptive projected variational quantum dynamics
- Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms
- Hybrid Tree Tensor Networks for quantum simulation
- Hybrid Ground-State Quantum Algorithms based on Neural Schrödinger Forging
- Riemannian quantum circuit optimization based on matrix product operators
- Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements