Quantum algorithms for grid-based variational time evolution

Abstract

The simulation of quantum dynamics calls for quantum algorithms working in first quantized grid encodings. Here, we propose a variational quantum algorithm for performing quantum dynamics in first quantization. In addition to the usual reduction in circuit depth conferred by variational approaches, this algorithm also enjoys several advantages compared to previously proposed ones. For instance, variational approaches suffer from the need for a large number of measurements. However, the grid encoding of first quantized Hamiltonians only requires measuring in position and momentum bases, irrespective of the system size. Their combination with variational approaches is therefore particularly attractive. Moreover, heuristic variational forms can be employed to overcome the limitation of the hard decomposition of Trotterized first quantized Hamiltonians into quantum gates. We apply this quantum algorithm to the dynamics of several systems in one and two dimensions. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches. We show how they can be significantly attenuated through subspace diagonalization at a cost of an additional $\mathcal{O}(M{N}^2)$ 2-qubit gates where $M$ is the number of dimensions and $N^M$ is the total number of grid points.

References in corpus (31)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Array Programming with NumPy
• Variational Quantum Algorithms
• Quantum computational chemistry
• Evaluating analytic gradients on quantum hardware
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Efficient variational quantum simulator incorporating active error minimisation
• Variational ansatz-based quantum simulation of imaginary time evolution
• Theory of variational quantum simulation
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Efficient Simulation of Quantum Systems by Quantum Computers
• Simulating Physical Phenomena by Quantum Networks
• Variational quantum algorithms for nonlinear problems
• Quantum Risk Analysis
• Quantum Circuits for Isometries
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Quantum computers as universal quantum simulators: state-of-art and perspectives
• Electron-Phonon Systems on a Universal Quantum Computer
• Adaptive Variational Quantum Dynamics Simulations
• An efficient quantum algorithm for the time evolution of parameterized circuits
• Simultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information
• Quantum simulation of the single-particle Schrodinger equation
• Geometry of variational methods: dynamics of closed quantum systems
• Adaptive Variational Quantum Imaginary Time Evolution Approach for Ground State Preparation
• Non-adiabatic molecular quantum dynamics with quantum computers
• Quantum Analog-Digital Conversion
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model
• Grid-based methods for chemistry simulations on a quantum computer
• Local-in-time error in variational quantum dynamics
• Bosonic field digitization for quantum computers
• Quantum Simulation of Simple Many-Body Dynamics

Cited by in corpus (7)

• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Grid-based methods for chemistry simulations on a quantum computer
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Maximising Quantum-Computing Expressive Power through Randomised Circuits
• Parallel-in-time quantum simulation via Page and Wootters quantum time
• Quantum Simulation of Molecular Dynamics Processes -- A Benchmark Study Using Classical Simulator and Present-Day Quantum Hardware
• Multi-set variational quantum dynamics algorithm for simulating nonadiabatic dynamics on quantum computers