Shorter width truncated Taylor series for Hamiltonian dynamics simulations

• URL: http://arxiv.org/abs/2511.09461v1
• Date: Thu, 13 Nov 2025 01:56:02 GMT
• Title: Shorter width truncated Taylor series for Hamiltonian dynamics simulations
• Abstract summary: We present an alternative quantum circuit that maintains an equivalent elementary gate cost but has an exponentially reduced number of ancilla qubits.<n>The proposed circuit utilizes a total of $lceil log(K) rceil + lceil log(L) rceil +n$ qubits, where $L$ is the number of terms in the Hamiltonian and $n$ is the system qubit size.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As established in the seminal work by Berry et al.[1], expanding the time evolution operator using truncated Taylor series (up to some order $K$) makes a good candidate for simulating Hamiltonian dynamics. Here, we adapt the method but present an alternative quantum circuit that maintains an equivalent asymptotic elementary gate cost but has an exponentially reduced number of ancilla qubits. This is realized by utilizing mid-circuit measurements (with early abort-and-restart of circuit execution), and transforming a series of multi-controlled$(H^k)$ to a series of singly-controlled$(H^{k'})$, where $H$ is a linear combination of unitaries and $k, k'$ are integers. The proposed circuit utilizes a total of $\lceil \log(K) \rceil + \lceil \log(L) \rceil +n$ qubits, where $L$ is the number of terms in the Hamiltonian and $n$ is the system qubit size. Our shorter width circuit with mid-measurements protocol is implemented and evaluated using the programming language Guppy[2,3].

Related papers

• Optimal T-Count for Block Encodings of Fermionic and Spin Hamiltonians [4.914113120082008]
  We study the cost of constructing block encodings of structured fermionic and spin Hamiltonians in a unitary Clifford$+T$ model.<n>Our main technical tool is an ancilla-compression theorem: any block encoding of an $n$-qubit operator with $a$ clean ancillas and at most $s$ $T$ gates can be compressed to use at most $mina,n+2s$ ancillas.
  arXiv  Detail & Related papers  (2026-09-10T07:01:08Z)
• Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth [73.08853228981701]
  Matrix chain multiplication is a problem in scientific computing, machine learning, and graph analysis.<n>We present emphTwo-Tower Matrix, a quantum subroutine that encodes the product $mathcalW$ of the $K$ matrices into a quantum state in circuit depth.
  arXiv  Detail & Related papers  (2026-07-14T18:42:40Z)
• Trotter error compensation with polylogarithmic precision and nested-commutator scaling without ancillas [23.101202672272027]
  We develop a high-order nested-commutator algorithm that preserves the main advantages of product formulas.<n>The resulting time dependence matches that of a product formula of order $2K+1$.
  arXiv  Detail & Related papers  (2026-07-13T17:42:25Z)
• Low-ancilla block encodings via Hamiltonian simulation [10.872863127462717]
  Block encodings are a central primitive in quantum algorithms.<n>We present a simple single-ancilla construction that converts Hamiltonian evolution into a block encoding of the underlying Hamiltonian.
  arXiv  Detail & Related papers  (2026-07-02T08:06:14Z)
• Adiabatic Quantum Phase Estimation [47.3103723337301]
  Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $$ in Heisenberg-limited time $T= (1/)$.<n>Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware.<n>We present a simple adiabatic protocol for QPE that achieves the optimal Heisenberg-limited scaling $T = Oleft( frac1 logleft(-1right)right)$ in both the precision $$
  arXiv  Detail & Related papers  (2026-05-21T17:31:36Z)
• Hamiltonian dynamics simulation using linear combination of unitaries on an ion trap quantum computer [2.164508552729841]
  The linear combination of unitaries (LCU) method has proven to scale better than existing product formulas in simulating long time Hamiltonian dynamics.<n>Given the number of multi-control gate operations in the standard prepare-select-unprepare architecture of LCU, it is still resource-intensive to implement on the current quantum computers.
  arXiv  Detail & Related papers  (2025-01-30T17:26:41Z)
• Control of the von Neumann Entropy for an Open Two-Qubit System Using Coherent and Incoherent Drives [50.24983453990065]
  This article is devoted to developing an approach for manipulating the von Neumann entropy $S(rho(t))$ of an open two-qubit system with coherent control and incoherent control inducing time-dependent decoherence rates. The following goals are considered: (a) minimizing or maximizing the final entropy $S(rho(T))$; (b) steering $S(rho(T))$ to a given target value; (c) steering $S(rho(T))$ to a target value and satisfying the pointwise state constraint $S(
  arXiv  Detail & Related papers  (2024-05-10T10:01:10Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Detection-Recovery Gap for Planted Dense Cycles [72.4451045270967]
  We consider a model where a dense cycle with expected bandwidth $n tau$ and edge density $p$ is planted in an ErdHos-R'enyi graph $G(n,q)$. We characterize the computational thresholds for the associated detection and recovery problems for the class of low-degree algorithms.
  arXiv  Detail & Related papers  (2023-02-13T22:51:07Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Computationally Efficient Quantum Expectation with Extended Bell Measurements [7.620967781722716]
  We propose a method for evaluating an expectation value of an arbitrary observable $Ainmathbb C2ntimes 2n$ through na"ive Pauli measurements. This analytical method quickly assembles the $4n$ matrix elements into at most $2n+1$ groups for simultaneous measurements.
  arXiv  Detail & Related papers  (2021-10-19T05:06:56Z)
• Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and Energy [0.0]
  We prove that any threshold circuit $C$ of size $s$, depth $d$, energy $e$ and weight $w$ satisfies $log (rk(M_C)) le ed. For other models of neural networks such as a discretized ReLE circuits and decretized sigmoid circuits, we prove that a similar inequality also holds for a discretized circuit $C$.
  arXiv  Detail & Related papers  (2021-07-01T05:37:53Z)
• Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits [8.401078947103475]
  Google's noisy quantum simulation of a 53 qubit circuit $C$ achieved a fidelity value of $(2.24pm0.21)times10-3$. Our results can be considered as an evidence that fooling the linear XEB test might be easier than achieving a full simulation of quantum circuit.
  arXiv  Detail & Related papers  (2020-05-05T18:01:48Z)
• Exponentially faster implementations of Select(H) for fermionic Hamiltonians [0.0]
  We present a framework for constructing quantum circuits that implement the multiply-controlled unitary $textSelect(H) equiv sum_ell. $textSelect(H)$ is one of the main subroutines of several quantum algorithms.
  arXiv  Detail & Related papers  (2020-04-08T18:00:04Z)

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.