Symmetry-Aware Trotterization for Simulating the Heisenberg Model on IBM Quantum Devices

• URL: http://arxiv.org/abs/2505.04552v1
• Date: Wed, 07 May 2025 16:31:39 GMT
• Title: Symmetry-Aware Trotterization for Simulating the Heisenberg Model on IBM Quantum Devices
• Authors: Bo Yang, Naoki Negishi,
• Abstract summary: We propose a hardware-efficient Trotterization scheme for the time evolution of a 3-site, $J=1$ XXX Heisenberg model.<n>By exploiting the symmetry of the Hamiltonian, we derive an effective Hamiltonian that acts on a reduced subspace.<n>We also test our method on the IBM Quantum device ibmq_jakarta.
• Score: 3.495405394644691
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simulating the time-dependent Schr\"odinger equation requires finding the unitary operator that efficiently describes the time evolution. One of the fundamental tools to efficiently simulate quantum dynamics is the Trotter decomposition of the time-evolution operator, and various quantum-classical hybrid algorithms have been proposed to implement Trotterization. Given that some quantum hardware is publicly accessible, it is important to assess the practical performance of Trotterization on them. However, a straightforward Trotter decomposition of the Hamiltonian often leads to quantum circuits with large depth, which hinders accurate simulation on devices with limited coherence time. In this work, we propose a hardware-efficient Trotterization scheme for the time evolution of a 3-site, $J=1$ XXX Heisenberg model. By exploiting the symmetry of the Hamiltonian, we derive an effective Hamiltonian that acts on a reduced subspace, significantly lowering the circuit depth after optimization for specific evolution times. This approach can be interpreted as a change of basis in the standard Trotterization scheme. We also test our method on the IBM Quantum device ibmq_jakarta. Combining with the readout error mitigation and the zero-noise extrapolation, we obtain the fidelity $0.9928 \pm 0.0013$ for the simulation of the time evolution of the Heisenberg model from the time $t=0$ to $t=\pi$.

Related papers

• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Sachdev-Ye-Kitaev model on a noisy quantum computer [1.0377683220196874]
  We study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. We compute return probability after time $t$ and out-of-time order correlators (OTOC) which is a standard observable of quantifying the chaotic nature of quantum systems.
  arXiv  Detail & Related papers  (2023-11-29T19:00:00Z)
• Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws [0.0]
  Digital quantum simulation relies on Trotterization to discretize time evolution into elementary quantum gates. We present an adaptive Trotterization algorithm to cope with time-dependent Hamiltonians. We validate the algorithm for a time-dependent quantum spin chain, demonstrating that it can outperform the conventional Trotter algorithm with a fixed step size at a controlled error.
  arXiv  Detail & Related papers  (2023-07-19T09:20:02Z)
• Quantum dynamics simulations beyond the coherence time on NISQ hardware by variational Trotter compression [0.0]
  We demonstrate a post-quench dynamics simulation of a Heisenberg model on present-day IBM quantum hardware. We show how to measure the required cost function, the overlap between the time-evolved and variational states, on present-day hardware. In addition to carrying out simulations on real hardware, we investigate the performance and scaling behavior of the algorithm with noiseless and noisy classical simulations.
  arXiv  Detail & Related papers  (2021-12-23T15:44:47Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• 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)
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware [6.445605125467574]
  We develop quantum algorithms for Hamiltonian simulation "one level below" the circuit model. We analyse the impact of these techniques under the standard error model. We derive analytic circuit identities for efficiently synthesising multi-qubit evolutions from two-qubit interactions.
  arXiv  Detail & Related papers  (2020-03-15T18:22:02Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• 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.