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.

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

References in corpus (44)

• Fault-tolerant quantum computation by anyons
• A variational eigenvalue solver on a quantum processor
• Elementary gates for quantum computation
• Quantum algorithm for solving linear systems of equations
• Surface codes: Towards practical large-scale quantum computation
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Fermionic quantum computation
• Exponential algorithmic speedup by quantum walk
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Towards Quantum Chemistry on a Quantum Computer
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Toward the first quantum simulation with quantum speedup
• Quantum Algorithms for Quantum Field Theories
• High threshold universal quantum computation on the surface code
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• A random compiler for fast Hamiltonian simulation
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Gate count estimates for performing quantum chemistry on small quantum computers
• Halving the cost of quantum addition
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• High-order quantum algorithm for solving linear differential equations
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Novel constructions for the fault-tolerant Toffoli gate
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• Quantum circuits for strongly correlated quantum systems
• Gate-efficient simulation of molecular eigenstates on a quantum computer
• Efficient quantum circuits for quantum computational chemistry
• On the CNOT-complexity of CNOT-PHASE circuits
• Linear-depth quantum circuits for multiqubit controlled gates
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
• T-count and T-depth of any multi-qubit unitary
• A polynomial time and space heuristic algorithm for T-count
• Reducing the CNOT count for Clifford+T circuits on NISQ architectures
• A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
• 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