Recipes for the Digital Quantum Simulation of Lattice Spin Systems

Abstract

We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. In addition to tools such as the Trotter-Suzuki expansion and graph coloring, we also discuss the efficiency gained by parallel execution of an extensive number of commuting terms. We provide resource estimates and quantum circuit elements for the most important cases and classes of spin systems. As resource estimates we indicate the total number of gates $N$ and simulation time $T$, expressed in terms of the number $n$ of spin 1/2 lattice sites (qubits), target accuracy $\epsilon$, and simulated time $t$. We provide circuit constructions that realize the simulation time $T^{(1)}\propto n{t}^2/\epsilon$ and $T^{(2q)}\propto t^{1+\eta }{n}^{\eta }/{\epsilon }^{\eta }$ for arbitrarily small $\eta =1/2q$ for the first-order and higher-order Trotter expansions. We also discuss the potential impact of scaled gates, which have not yet been fully explored.

5 pages, 4 figures, v2: typos corrected, minor changes

References in corpus (19)

• Quantum Computation with Quantum Dots
• Quantum Simulation
• Universal Quantum Computation with the Exchange Interaction
• Programmable Quantum Simulations of Spin Systems with Trapped Ions
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Toward the first quantum simulation with quantum speedup
• Computing with spin qubits at the surface code error threshold
• Quantum Algorithms for Quantum Field Theories
• A Theory of Trotter Error
• A geometric theory of non-local two-qubit operations
• Digital quantum simulation of fermionic models with a superconducting circuit
• Gate count estimates for performing quantum chemistry on small quantum computers
• Solving strongly correlated electron models on a quantum computer
• Higher Order Decompositions of Ordered Operator Exponentials
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Digital-Analog Quantum Simulations with Superconducting Circuits
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• Optimized Lie-Trotter-Suzuki decompositions for two and three non-commuting terms

Cited by in corpus (2)

• Fault-tolerant quantum simulation of generalized Hubbard models
• Efficient quantum simulation for translationally invariant systems