Variational Hamiltonian simulation for translational invariant systems via classical pre-processing

Abstract

The simulation of time evolution of large quantum systems is a classically challenging and in general intractable task, making it a promising application for quantum computation. A Trotter-Suzuki approximation yields an implementation thereof, where a higher approximation accuracy can be traded for an increased gate count. In this work, we introduce a variational algorithm which uses solutions of classical optimizations to predict efficient quantum circuits for time evolution of translationally invariant quantum systems. Our strategy can improve upon the Trotter-Suzuki accuracy by several orders of magnitude. It translates into a reduction in gate count and hence gain in overall fidelity at the same algorithmic accuracy. This is important in NISQ-applications where the fidelity of the output state decays exponentially with the number of gates. The performance advantage of our classical assisted strategy can be extended to open boundaries with translational symmetry in the bulk. We can extrapolate our method to beyond classically simulatable system sizes, maintaining its total fidelity advantage over a Trotter-Suzuki approximation making it an interesting candidate for beyond classical time evolution.

18 pages, 7 figures, v5: small changes in the text, version essentially identical to the one published in QST

References in corpus (9)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The Variational Quantum Eigensolver: a review of methods and best practices
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Digital quantum simulation of spin models with circuit quantum electrodynamics
• Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation
• Compilation by stochastic Hamiltonian sparsification
• A Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolver
• Long-time simulations with high fidelity on quantum hardware
• NISQ Algorithm for Hamiltonian Simulation via Truncated Taylor Series

Cited by in corpus (25)

• Classically optimized Hamiltonian simulation
• Barren plateaus in quantum tensor network optimization
• Towards adiabatic quantum computing using compressed quantum circuits
• Optimised Trotter Decompositions for Classical and Quantum Computing
• Realization of quantum signal processing on a noisy quantum computer
• Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer
• Variational Quantum Time Evolution without the Quantum Geometric Tensor
• Quantum Simulation of Z2 Lattice Gauge theory with minimal resources
• Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits
• Problem specific classical optimization of Hamiltonian simulation
• Pauli path simulations of noisy quantum circuits beyond average case
• Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws
• Trotter error with commutator scaling for the Fermi-Hubbard model
• Riemannian quantum circuit optimization for Hamiltonian simulation
• Large-scale simulations of Floquet physics on near-term quantum computers
• Scalable simulation of non-equilibrium quantum dynamics via classically optimised unitary circuits
• Quantum Tensor Product Decomposition from Choi State Tomography
• Riemannian quantum circuit optimization based on matrix product operators
• Compressed quantum error mitigation
• Deep Circuit Compression for Quantum Dynamics via Tensor Networks
• Efficient Quantum Cooling Algorithm for Fermionic Systems
• Optimal compression of constrained quantum time evolution
• A recipe for local simulation of strongly-correlated fermionic matter on quantum computers: the 2D Fermi-Hubbard model
• Preparation Circuits for Matrix Product States by Classical Variational Disentanglement
• Phase Estimation with Compressed Controlled Time Evolution