Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers

Abstract

Dynamic simulation of materials is a promising application for near-term quantum computers. Current algorithms for Hamiltonian simulation, however, produce circuits that grow in depth with increasing simulation time, limiting feasible simulations to short-time dynamics. Here, we present a method for generating circuits that are constant in depth with increasing simulation time for a subset of one-dimensional materials Hamiltonians, thereby enabling simulations out to arbitrarily long times. Furthermore, by removing the effective limit on the number of feasibly simulatable time-steps, the constant-depth circuits enable Trotter error to be made negligibly small by allowing simulations to be broken into arbitrarily many time-steps. Composed of two-qubit matchgates on nearest-neighbor qubits, these constant-depth circuits are constructed based on a set of multi-matchgate identity relationships. For an $N$-spin system, the constant-depth circuit contains only $\mathcal{O}(N^2)$ CNOT gates. When compared to standard Hamiltonian simulation algorithms, our method generates circuits with order-of-magnitude fewer gates, which allows us to successfully simulate the long-time dynamics of systems with up to 5 spins on available quantum hardware. This paves the way for simulations of long-time dynamics for scientifically and technologically relevant quantum materials, enabling the observation of interesting and important atomic-level physics.

11 pages, 3 figures, 1 table

References in corpus (9)

• Simulated Quantum Computation of Molecular Energies
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Simulating Quantum Materials with Digital Quantum Computers
• Accurately computing electronic properties of a quantum ring
• Quantum simulation of scattering in the quantum Ising model
• Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
• Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion
• Geometries for universal quantum computation with matchgates
• Probing the Possibilities of Ergodicity in the 1D Spin-1/2 XY Chain with Quench Dynamics

Cited by in corpus (17)

• Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition
• LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
• Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
• Quantum dynamics simulations beyond the coherence time on NISQ hardware by variational Trotter compression
• Quantum time dynamics of 1D-Heisenberg models employing the Yang-Baxter equation for circuit compression
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
• Quantum criticality using a superconducting quantum processor
• The Basics of Quantum Computing for Chemists
• Quantum Ising Heat Engines: A mean field study
• Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation
• Real-time simulation of light-driven spin chains on quantum computers
• Two-dimensional coherent spectrum of high-spin models via a quantum computing approach
• A derivation of the conditions under which bosonic operators exactly capture fermionic structure and dynamics
• Comparison of encoding schemes for quantum computing of $S>1/2$ spin chains
• A Computational Framework for Simulations of Dissipative Non-Adiabatic Dynamics on Hybrid Oscillator-Qubit Quantum Devices
• Fault-tolerant quantum simulation of generalized Hubbard models