Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters

Abstract

Many applications of practical interest rely on time evolution of Hamiltonians that are given by a sum of Pauli operators. Quantum circuits for exact time evolution of single Pauli operators are well known, and can be extended trivially to sums of commuting Paulis by concatenating the circuits of individual terms. In this paper we reduce the circuit complexity of Hamiltonian simulation by partitioning the Pauli operators into mutually commuting clusters and exponentiating the elements within each cluster after applying simultaneous diagonalization. We provide a practical algorithm for partitioning sets of Paulis into commuting subsets, and show that the proposed approach can help to significantly reduce both the number of CNOT operations and circuit depth for Hamiltonians arising in quantum chemistry. The algorithms for simultaneous diagonalization are also applicable in the context of stabilizer states; in particular we provide novel four- and five-stage representations, each containing only a single stage of conditional gates.

References in corpus (11)

• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Improved Simulation of Stabilizer Circuits
• Fermionic quantum computation
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Toward the first quantum simulation with quantum speedup
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Fermionic neural-network states for ab-initio electronic structure
• A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
• T-count optimization and Reed-Muller codes

Cited by in corpus (30)

• A Quantum Computing View on Unitary Coupled Cluster Theory
• Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches
• Clifford Circuit Optimization with Templates and Symbolic Pauli Gates
• How many quantum gates do gauge theories require?
• LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States
• Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions
• Synthesizing efficient circuits for Hamiltonian simulation
• Relating Measurement Patterns to Circuits via Pauli Flow
• Fuzzy gauge theory for quantum computers
• Architecture aware compilation of quantum circuits via lazy synthesis
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation
• SimuQ: A Framework for Programming Quantum Hamiltonian Simulation with Analog Compilation
• Hardware-Tailored Diagonalization Circuits
• Quantum Gate Sets for Lattice QCD in the strong coupling limit: $N_f=1$
• Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding
• Lower T-count with faster algorithms
• Learning from physics experiments, with quantum computers: Applications in muon spectroscopy
• Tridiagonal matrix decomposition for Hamiltonian simulation on a quantum computer
• Optimally generating $\mathfrak{su}(2^N)$ using Pauli strings
• Leveraging commuting groups for an efficient variational Hamiltonian ansatz
• Reducing circuit depth with qubitwise diagonalization
• Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers
• HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping
• Trotter error and gate complexity of the SYK and sparse SYK models
• Selective and efficient quantum state tomography for multi-qubit systems
• Efficient and simple Gibbs state preparation of the 2D toric code via duality to classical Ising chains
• Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors
• Quantum computational resources for lattice QCD in the strong-coupling limit
• Gate Efficient Composition of Hamiltonian Simulation and Block-Encoding with its Application on HUBO, Chemistry and Finite Difference Method
• Probabilistic Representation of Commutative Quantum Circuit Models