A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
arXiv:2409.06919 · doi:10.1109/TQE.2025.3558090
Abstract
Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a methodology and software framework to evaluate various facets of the performance of gate-based quantum computers on Trotterized quantum Hamiltonian evolution. We propose three distinct modes for benchmarking: (i) comparing simulation on a real device to that on a noiseless classical simulator, (ii) comparing simulation on a real device with exact diagonalization results, and (iii) using scalable mirror circuit techniques to assess hardware performance in scenarios beyond classical simulation methods. We demonstrate this framework on five Hamiltonian models from the HamLib library: the Fermi and Bose-Hubbard models, the transverse field Ising model, the Heisenberg model, and the Max3SAT problem. Experiments were conducted using Qiskit's Aer simulator, BlueQubit's CPU cluster and GPU simulators, and IBM's quantum hardware. Our framework, extendable to other Hamiltonians, provides comprehensive performance profiles that reveal hardware and algorithmic limitations and measure both fidelity and execution times, identifying crossover points where quantum hardware outperforms CPU/GPU simulators.
24 pages, 17 figures
References in corpus (66)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Quantum algorithm for solving linear systems of equations
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Ising formulations of many NP problems
- Quantum computational chemistry
- Quantum Chemistry in the Age of Quantum Computing
- Real time evolution using the density matrix renormalization group
- Characterizing Quantum Supremacy in Near-Term Devices
- Randomized Benchmarking of Quantum Gates
- Fermionic quantum computation
- Hamiltonian Simulation by Qubitization
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Robust randomized benchmarking of quantum processes
- Validating quantum computers using randomized model circuits
- Toward the first quantum simulation with quantum speedup
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- A Theory of Trotter Error
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
- A Race Track Trapped-Ion Quantum Processor
- Quantum Algorithms for Fermionic Simulations
- Gate count estimates for performing quantum chemistry on small quantum computers
- Quantum computing enhanced computational catalysis
- Efficient quantum algorithm for dissipative nonlinear differential equations
- An introduction to integrable techniques for one-dimensional quantum systems
- Simulating lattice gauge theories on a quantum computer
- The one-dimensional Hubbard model: A reminiscence
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Digitization of Scalar Fields for Quantum Computing
- Higher Order Decompositions of Ordered Operator Exponentials
- Reachability Deficits in Quantum Approximate Optimization
- Resource-efficient digital quantum simulation of -level systems for photonic, vibrational, and spin- Hamiltonians
- Measuring the Capabilities of Quantum Computers
- Application-Oriented Performance Benchmarks for Quantum Computing
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
- Electron-Phonon Systems on a Universal Quantum Computer
- Entanglement at a Two-Dimensional Quantum Critical Point: a Numerical Linked Cluster Expansion Study
- Time-dependent Hamiltonian simulation with -norm scaling
- Digital quantum computation of fermion-boson interacting systems
- A volumetric framework for quantum computer benchmarks
- Improving Hamiltonian encodings with the Gray code
- Mitigating algorithmic errors in Hamiltonian simulation
- Provably accurate simulation of gauge theories and bosonic systems
- Time-dependent unbounded Hamiltonian simulation with vector norm scaling
- Quantum Simulations of Physics Problems
- Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations
- Variational quantum eigensolvers for sparse Hamiltonians
- Realization of quantum signal processing on a noisy quantum computer
- Superfluid, Mott-Insulator, and Mass-Density-Wave Phases in the One-Dimensional Extended Bose-Hubbard Model
- Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
- On the complexity of implementing Trotter steps
- Quantum Computational Phase Transition in Combinatorial Problems
- Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
- Three-dimensional isometric tensor networks
- A quantum hamiltonian simulation benchmark
- Towards a variational Jordan-Lee-Preskill quantum algorithm
- HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
- Optimal Hamiltonian simulation for time-periodic systems
- Analytical results on the Heisenberg spin chain in a magnetic field
- A Hybrid Quantum-Classical Method for Electron-Phonon Systems
- Critical Behavior of the 3D anisotropic quantum Heisenberg model in a trimodal random field distribution
- On connectivity-dependent resource requirements for digital quantum simulation of -level particles
- Optimal-order Trotter-Suzuki decomposition for quantum simulation on noisy quantum computers