Long-time simulations with high fidelity on quantum hardware

Abstract

Moderate-size quantum computers are now publicly accessible over the cloud, opening the exciting possibility of performing dynamical simulations of quantum systems. However, while rapidly improving, these devices have short coherence times, limiting the depth of algorithms that may be successfully implemented. Here we demonstrate that, despite these limitations, it is possible to implement long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on the Rigetti and IBM quantum computers, maintaining a fidelity of at least 0.9 for over 600 time steps. This is a factor of 150 longer than is possible using the iterated Trotter method. Our simulations are performed using a new algorithm that we call the fixed state Variational Fast Forwarding (fsVFF) algorithm. This algorithm decreases the circuit depth and width required for a quantum simulation by finding an approximate diagonalization of a short time evolution unitary. Crucially, fsVFF only requires finding a diagonalization on the subspace spanned by the initial state, rather than on the total Hilbert space as with previous methods, substantially reducing the required resources. We further demonstrate the viability of fsVFF through large numerical implementations of the algorithm, as well as an analysis of its noise resilience and the scaling of simulation errors.

arXiv commentMain text: 14 pages, 11 Figures. Appendices: 10 pages, 1 Figure

References in corpus (28)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Quantum-assisted quantum compiling
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Layerwise learning for quantum neural networks
• Variational quantum simulation of general processes
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Variational Quantum State Diagonalization
• Large gradients via correlation in random parameterized quantum circuits
• Barren plateaus preclude learning scramblers
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
• Higher Order Methods for Simulations on Quantum Computers
• Hamiltonian simulation in the low-energy subspace
• Quantum Assisted Simulator
• Reformulation of the No-Free-Lunch Theorem for Entangled Data Sets
• Variational Consistent Histories as a Hybrid Algorithm for Quantum Foundations
• Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation
• Generalized Quantum Assisted Simulator
• Operator Sampling for Shot-frugal Optimization in Variational Algorithms
• No Free Lunch for Quantum Machine Learning

Cited by in corpus (14)

• Variational Quantum Algorithms
• Generalization in quantum machine learning from few training data
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Theory of overparametrization in quantum neural networks
• Digital quantum simulation of open quantum systems using quantum imaginary time evolution
• Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
• Variational Hamiltonian simulation for translational invariant systems via classical pre-processing
• Noisy intermediate-scale quantum algorithm for semidefinite programming
• Quantum Mixed State Compiling
• Gauge Theory Couplings on Anisotropic Lattices
• Quantum simulation of operator spreading in the chaotic Ising model
• Two-dimensional coherent spectrum of high-spin models via a quantum computing approach
• Exploiting subspace constraints and ab initio variational methods for quantum chemistry
• Universal compiling and (No-)Free-Lunch theorems for continuous variable quantum learning