Synthesizing efficient circuits for Hamiltonian simulation

Abstract

We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to $4$. In fact, the total number of gates reduce in many cases. We show that it is possible to implement an exponentiated sum of commuting Paulis with at most $m$ (controlled)-rotation gates, where $m$ is the number of distinct non-zero eigenvalues (ignoring sign). Thus we can collect mutually commuting Hamiltonian terms into groups that satisfy one of several symmetries identified in this work which allow an inexpensive simulation of the entire group of terms. We further show that the cost can in some cases be reduced by partially allocating Hamiltonian terms to several groups and provide a polynomial time classical algorithm that can greedily allocate the terms to appropriate groupings. We further specifically discuss these optimizations for the case of fermionic dynamics and provide extensive numerical simulations for qDRIFT of our grouping strategy to 6 and 4-qubit Heisenberg models, $LiH$, $H_2$ and observe a factor of 1.8-3.2 reduction in the number of non-Clifford gates. This suggests Trotter-based simulation of chemistry in second quantization may be even more practical than previously believed.

Accepted in Nature Partner Journal Quantum Information. Compared to v2 : minor changes

References in corpus (9)

• Quantum algorithm for solving linear systems of equations
• Surface codes: Towards practical large-scale quantum computation
• Exponential algorithmic speedup by quantum walk
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Novel constructions for the fault-tolerant Toffoli gate
• Quantum circuits for strongly correlated quantum systems
• Linear-depth quantum circuits for multiqubit controlled gates
• Entanglement generation via power-of-SWAP operations between dynamic electron-spin qubits
• Fast Classical Simulation of Hamiltonian Dynamics by Simultaneous Diagonalization Using Clifford Transformation with Parallel Computation

Cited by in corpus (5)

• Variational Quantum Time Evolution without the Quantum Geometric Tensor
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation
• Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian
• Tridiagonal matrix decomposition for Hamiltonian simulation on a quantum computer
• Gate Efficient Composition of Hamiltonian Simulation and Block-Encoding with its Application on HUBO, Chemistry and Finite Difference Method