Kernpiler: Compiler Optimization for Quantum Hamiltonian Simulation with Partial Trotterization

• URL: http://arxiv.org/abs/2504.07214v1
• Date: Wed, 09 Apr 2025 18:41:31 GMT
• Title: Kernpiler: Compiler Optimization for Quantum Hamiltonian Simulation with Partial Trotterization
• Authors: Ethan Decker, Lucas Goetz, Evan McKinney, Erik Gustafson, Junyu Zhou, Yuhao Liu, Alex K. Jones, Ang Li, Alexander Schuckert, Samuel Stein, Eleanor Crane, Gushu Li,
• Abstract summary: Existing compilation techniques for Hamiltonian simulation struggle to provide gate counts feasible on current quantum computers.<n>We propose partial Trotterization, where sets of non-commuting Hamiltonian terms are directly compiled allowing for less error per Trotter step.<n>We demonstrate with numerical simulations across spin and fermionic Hamiltonians that compared to state of the art methods such as Qiskit's Rustiq and Qiskit's Paulievolutiongate, our novel compiler presents up to 10x gate and depth count reductions.
• Score: 38.59115551211364
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Quantum computing promises transformative impacts in simulating Hamiltonian dynamics, essential for studying physical systems inaccessible by classical computing. However, existing compilation techniques for Hamiltonian simulation, in particular the commonly used Trotter formulas struggle to provide gate counts feasible on current quantum computers for beyond-classical simulations. We propose partial Trotterization, where sets of non-commuting Hamiltonian terms are directly compiled allowing for less error per Trotter step and therefore a reduction of Trotter steps overall. Furthermore, a suite of novel optimizations are introduced which complement the new partial Trotterization technique, including reinforcement learning for complex unitary decompositions and high level Hamiltonian analysis for unitary reduction. We demonstrate with numerical simulations across spin and fermionic Hamiltonians that compared to state of the art methods such as Qiskit's Rustiq and Qiskit's Paulievolutiongate, our novel compiler presents up to 10x gate and depth count reductions.

Related papers

• Gate Efficient Composition of Hamiltonian Simulation and Block-Encoding with its Application on HUBO, Chemistry and Finite Difference Method [0.0]
  This article proposes a formalism which unifies Hamiltonian simulation techniques from different fields.<n>It leads to a gate decomposition and a scaling different from the usual strategy.<n>It can significantly reduce the quantum circuit number of rotational gates, multi-qubit gates, and the circuit depth.
  arXiv  Detail & Related papers  (2024-10-24T12:26:50Z)
• Improved Digital Quantum Simulation by Non-Unitary Channels [0.5999777817331317]
  We study the performance of non-unitary simulation channels and consider the error structure of channels constructed from a weighted average of unitary circuits. We show that averaging over just a few simulation circuits can significantly reduce the Trotterization error for both single-step short-time and multi-step long-time simulations.
  arXiv  Detail & Related papers  (2023-07-24T18:00:02Z)
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation [0.0]
  We use fermionic and qubit algebras for the Trotterization of the electronic Hamiltonian. Use of symmetries of the electronic Hamiltonian and its fragments significantly reduces the Trotter error. Fermionic methods tend to introduce quantum circuits with a greater number of T-gates at each Trotter step.
  arXiv  Detail & Related papers  (2022-10-18T22:22:54Z)
• Fermionic approach to variational quantum simulation of Kitaev spin models [50.92854230325576]
  Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions. We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation. We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
  arXiv  Detail & Related papers  (2022-04-11T18:00:01Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Simulated Quantum Annealing is Efficient on the Spike Hamiltonian [0.15229257192293202]
  We study the convergence of a classical algorithm called Simulated Quantum Annealing (SQA) on the Spike Hamiltonian. This toy model Hamiltonian encodes a simple bit-symmetric cost function f in the computational basis.
  arXiv  Detail & Related papers  (2020-11-30T18:30:15Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Term Grouping and Travelling Salesperson for Digital Quantum Simulation [6.945601123742983]
  Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian makes such an approach unsuitable for near-term devices. We propose a new term ordering strategy, max-commute-tsp, that simultaneously mitigates both algorithmic and physical errors.
  arXiv  Detail & Related papers  (2020-01-16T18:33:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.