An efficient algorithm for approximate shadow Hamiltonian simulation

• URL: http://arxiv.org/abs/2607.11882v1
• Date: Mon, 13 Jul 2026 17:58:38 GMT
• Title: An efficient algorithm for approximate shadow Hamiltonian simulation
• Abstract summary: Shadow Hamiltonian simulation works at the level of the operator algebra generated by the observables through commutators with the Hamiltonian.<n>Our algorithm overcomes this bottleneck by systematically identifying the elements of the algebra most relevant to the target observables.<n>This targeted approach is a controlled approximation that yields a highly efficient quantum state encoding.
• Score: 1.2508502162035755
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose an efficient algorithm based on shadow Hamiltonian simulation to approximately simulate the real-time dynamics of observables under time-independent Hamiltonians. Shadow Hamiltonian simulation works at the level of the operator algebra generated by the observables through commutators with the Hamiltonian. Exactly encoding the quantum state in this picture is generally inefficient for interacting systems due to the exponential growth of the operator algebra. Our algorithm overcomes this bottleneck by systematically identifying the elements of the algebra most relevant to the target observables. This targeted approach is a controlled approximation that yields a highly efficient quantum state encoding that substantially reduces the size of the qubit register required to perform the time evolution using the shadow Hamiltonian. We propose two main pruning schemes, one based on a predefined operator basis and another on a constructed Krylov basis. We also present a hybrid scheme that builds a Krylov basis within a pruned algebra in the predefined basis. We benchmark our algorithm using lattice spin systems in one and two dimensions, for both one- and higher-point correlators as observables.

Related papers

• Efficient Hamiltonian Truncation: Fast Matrix Construction and Quantum Krylov Diagonalization [36.99783938253534]
  Hamiltonian truncation offers a nonperturbative route to quantum field theory.<n>We develop an efficient basis-generation scheme built on integer partitions.<n>We speed up the construction of the sparse Hamiltonian matrix using symmetry-aware algorithms.
  arXiv  Detail & Related papers  (2026-08-13T18:37:19Z)
• Coordinate space representation for quantum simulation of scalar field theory [0.0]
  We investigate a formulation of the $4$ model based on the harmonic-oscillator basis in coordinate space.<n>We show that both exhibit an effective band-diagonal structure, allowing controlled truncations of the Hamiltonian.<n>We estimate the resources required to encode the Hamiltonian on a quantum computer using both binary and unary boson-to-qubit mappings.
  arXiv  Detail & Related papers  (2026-08-01T13:44:37Z)
• Quantum-Inspired Algorithm for Classical Spin Hamiltonians Based on Matrix Product Operators [0.18665975431697432]
  We propose a tensor-network (TN) approach for solving classical optimization problems inspired by spectral filtering and sampling on quantum states.<n>We represent the transformed Hamiltonian as a matrix product operator (MPO) and form an immense power of this object via truncated MPO-MPO contractions.<n>In contrast to the density-matrix renormalization group, our approach provides a straightforward route to systematic improvement by increasing the bond dimension and is better at avoiding local minima.
  arXiv  Detail & Related papers  (2026-02-05T02:29:37Z)
• Computation of operator exponentials using the Dunford-Cauchy integral [51.56484100374058]
  We consider an n-qubit quantum system with a Hamiltonian, defined by an expansion in the Pauli basis, and propose a new algorithm for classical computing the exponential of the Hamiltonian.<n>The algorithm is based on the representation of the exponential by the Dunford-Cauchy integral, followed by an efficient computation of the resolvent, and is suitable for Hamiltonians that are sparse in the Pauli basis.
  arXiv  Detail & Related papers  (2025-09-10T13:58:16Z)
• Zassenhaus Expansion in Solving the Schrödinger Equation [0.0]
  A fundamental challenge lies in approximating the unitary evolution operator ( e-imathcalHt ) where ( mathcalH ) is a large, typically non-commuting, Hermitian operator.<n>We present a refinement of the fixed-depth simulation framework introduced by E. K"okc"u et al, incorporating the second-order Zassenhaus expansion.<n>This yields a controlled, non-unitary approximation with error scaling as ( mathcalO(t
  arXiv  Detail & Related papers  (2025-05-14T14:48:47Z)
• Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation [3.5148549831413036]
  We provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points $N$.<n>We establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm.
  arXiv  Detail & Related papers  (2025-02-27T16:43:28Z)
• Quantum Simulation of Nonlinear Dynamical Systems Using Repeated Measurement [42.896772730859645]
  We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations. We apply this approach to the classic logistic and Lorenz systems in both integrable and chaotic regimes.
  arXiv  Detail & Related papers  (2024-10-04T18:06:12Z)
• Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering [0.13108652488669736]
  Hamiltonian simulation is a domain where quantum computers have the potential to outperform classical counterparts.<n>One of the main challenges of such quantum algorithms is increasing the system size.<n>We present an approach to improve the scalability of eigenspace filtering for the ground state preparation of a given Hamiltonian.
  arXiv  Detail & Related papers  (2024-01-17T09:52:24Z)
• Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective [37.57762772762448]
  This work presents a new approach for simulating the HHL linear systems of equations solver algorithm with tensor networks.<n>A novel HHL in the qudits formalism, the generalization of qubits, is developed, and then its operations are transformed into an equivalent classical HHL.
  arXiv  Detail & Related papers  (2023-09-11T08:18:41Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Time Dependent Hamiltonian Simulation Using Discrete Clock Constructions [42.3779227963298]
  We provide a framework for encoding time dependent dynamics as time independent systems. First, we create a time dependent simulation algorithm based on performing qubitization on the augmented clock system. Second, we define a natural generalization of multiproduct formulas for time-ordered exponentials.
  arXiv  Detail & Related papers  (2022-03-21T21:29:22Z)
• 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)
• Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion [6.338178373376447]
  We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. We demonstrate that the cost of the algorithm is independent of the Hamiltonian's frequencies.
  arXiv  Detail & Related papers  (2021-03-29T05:02:02Z)

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.