Efficient Quantum Circuit Construction of Controlled Time-Evolution for Arbitrary Pauli-Sum Hamiltonians

• URL: http://arxiv.org/abs/2606.06070v1
• Date: Thu, 04 Jun 2026 12:10:56 GMT
• Title: Efficient Quantum Circuit Construction of Controlled Time-Evolution for Arbitrary Pauli-Sum Hamiltonians
• Abstract summary: Controlled time-evolution circuits select forward or backward Hamiltonian time evolution according to the state of ancilla qubit.<n>A direct realization adds ancilla control to the elementary gates of the time-evolution circuit.
• Score: 2.2412154463267284
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Controlled time-evolution circuits select forward or backward Hamiltonian time evolution according to the state of an ancilla qubit. They are fundamental building blocks in quantum eigenvalue transformation of unitaries, Hamiltonian filtering, and related quantum algorithms. A direct realization adds ancilla control to the elementary gates of the time-evolution circuit and therefore increases the two-qubit gate count, compiled T depth and CX depth. We develop an efficient recursive algorithm that, for an arbitrary Pauli-sum Hamiltonian, partitions the input Pauli terms into groups and assigns to each group a sign-flip Pauli string that anti-commutes with the in-group terms, thereby removing ancilla control from the grouped time-evolution blocks. Numerical benchmarks on random Hamiltonians and structured spin Hamiltonians show reductions in compiled T depth and compiled CX depth. For a Kagome Hamiltonian with 24 spins under full connectivity, the proposed construction reduces the compiled T depth by 85.2% and the compiled CX depth by 68.9%, compared with a conventional implementation that decomposes the Hamiltonian into individual Pauli terms and implements the controlled time evolution of each term by directly adding the ancilla qubit to the corresponding Pauli-rotation circuit.

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)
• Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification [24.878868093642307]
  Hamiltonian simulation is a core quantum workload, underpinning variational quantum algorithms and Trotterized time evolution.<n>We present Symphony, a holistic compilation approach built on the binary symplectic form (BSF) representation of Pauli strings.
  arXiv  Detail & Related papers  (2026-08-12T02:38:42Z)
• Inverse Design of Quantum Control Sequences with Fourier Neural Operators [57.63590760083204]
  We introduce a Fourier Neural Operator (FNO)-based framework for learning high dimensional molecular quantum dynamics.<n>We develop the FNO pulse-measurement planner (FNO-SPMP), which constructs pulse sequences to purify an initially mixed Boltzmann distribution.<n>In a shared discrete control space, FNO-SPMP achieves nearly twice the success rate of a reinforcement-learning baseline.
  arXiv  Detail & Related papers  (2026-08-04T14:06:59Z)
• Non-Clifford Fusion: T-Gate Optimization for Quantum Simulation [8.852772632327335]
  Hamiltonian simulation is a key quantum algorithm for modeling complex systems.<n>NCF is a compilation framework that reduces both the T-gate count and T-gate depth for Hamiltonian simulation.<n>NCF achieves an average reduction of 57.4%, 49.1%, and 49.0% in T-gate count, T-gate depth, and Clifford count, respectively.
  arXiv  Detail & Related papers  (2025-10-15T14:12:22Z)
• Constructive interference at the edge of quantum ergodic dynamics [116.94795372054381]
  We characterize ergodic dynamics using the second-order out-of-time-order correlators, OTOC$(2)$.<n>In contrast to dynamics without time reversal, OTOC$(2)$ are observed to remain sensitive to the underlying dynamics at long time scales.
  arXiv  Detail & Related papers  (2025-06-11T21:29:23Z)
• Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time [34.99747682571461]
  Continuous gate sets are a key ingredient for near-term quantum algorithms.<n>We demonstrate a hardware-efficient, continuous set of controlled arbitrary-phase gates acting on transmon qubits.<n>This native gate set has the potential to reduce the depth and improve the performance of near-term quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-14T08:49:47Z)
• Classically estimating observables of noiseless quantum circuits [36.688706661620905]
  We present a classical algorithm for estimating expectation values of arbitrary observables on random unstructured quantum circuits.<n>Our results show that estimating observables of quantum circuits exhibiting chaotic and locally scrambling behavior is classically tractable across all geometries.
  arXiv  Detail & Related papers  (2024-09-03T08:44:33Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Leveraging commuting groups for an efficient variational Hamiltonian ansatz [2.1438108757511958]
  We introduce a new circuit design using commuting groups within the Hamiltonian.<n>We demonstrate the effectiveness of our method in accurately determining the ground state energy of different quantum chemistry Hamiltonians.
  arXiv  Detail & Related papers  (2023-12-13T20:28:31Z)
• Efficient quantum imaginary time evolution by drifting real time evolution: an approach with low gate and measurement complexity [7.1064035036390925]
  Quantum imaginary time evolution (QITE) is one of the promising candidates for finding eigenvalues and eigenstates of a Hamiltonian. The original QITE proposal [Nat. Phys. 16, 205-210 ( 2020)], which approximates the imaginary time evolution by real time evolution, suffers from large circuit depth and measurements due to the size of the Pauli operator pool and Trotterization. We propose a time-dependent drifting scheme inspired by thePhys. Rev. Lett 123, 070503 LiH], which randomly draws a Pauli term out of the approximated unitary operation generators of
  arXiv  Detail & Related papers  (2022-03-21T16:41:27Z)
• 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)
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
  arXiv  Detail & Related papers  (2020-07-20T22:26:16Z)
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters [1.0587959762260986]
  Quantum circuits for exact time evolution of single Pauli operators are well known, and can be extended trivially to sums of commuting Paulis. In this paper we reduce the circuit complexity of Hamiltonian simulation by partitioning the Pauli operators into mutually commuting clusters. We show that the proposed approach can help to significantly reduce both the number of CNOT operations and circuit depth for Hamiltonians arising in quantum chemistry.
  arXiv  Detail & Related papers  (2020-03-30T16:29:40Z)

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.