Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation

Abstract

Solving the electronic structure problem via unitary evolution of the electronic Hamiltonian is one of the promising applications of digital quantum computers. One of the practical strategies to implement the unitary evolution is via Trotterization, where a sequence of short-time evolutions of fast-forwardable (i.e. efficiently diagonalizable) Hamiltonian fragments is used. Given multiple choices of possible Hamiltonian decompositions to fast-forwardable fragments, the accuracy of the Hamiltonian evolution depends on the choice of the fragments. We assess efficiency of multiple Hamiltonian partitioning techniques using fermionic and qubit algebras for the Trotterization. Use of symmetries of the electronic Hamiltonian and its fragments significantly reduces the Trotter error. This reduction makes fermionic-based partitioning Trotter errors lower compared to those in qubit-based techniques. However, from the simulation-cost standpoint, fermionic methods tend to introduce quantum circuits with a greater number of T-gates at each Trotter step and thus are more computationally expensive compared to their qubit counterparts.

13 pages, 4 figures

References in corpus (14)

• Exponential algorithmic speedup by quantum walk
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Classically optimized Hamiltonian simulation
• Tequila: A platform for rapid development of quantum algorithms
• Cartan sub-algebra approach to efficient measurements of quantum observables
• Nearly tight Trotterization of interacting electrons
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
• Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches
• First-Order Trotter Error from a Second-Order Perspective
• Fluid fermionic fragments for optimizing quantum measurements of electronic Hamiltonians in the variational quantum eigensolver
• Synthesizing efficient circuits for Hamiltonian simulation
• A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
• How to define quantum mean-field solvable Hamiltonians using Lie algebras

Cited by in corpus (7)

• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Quantum error mitigation for Fourier moment computation
• Simulating Vibrational Dynamics on Bosonic Quantum Devices
• A Hybrid Qubit Encoding: Splitting Fock Space into Fermionic and Bosonic Subspaces
• Trotter simulation of vibrational Hamiltonians on a quantum computer
• The Electronic Structure of the Hydrogen Molecule: A Tutorial Exercise in Classical and Quantum Computation
• Gate Efficient Composition of Hamiltonian Simulation and Block-Encoding with its Application on HUBO, Chemistry and Finite Difference Method