• Home
  • Search
  • Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
  • Cite Icon2
  • https://doi.org/10.1007/s11128-025-04697-7Copy DOI Icon

Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation

Show More
  • Abstract
  • Highlights & Summary
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In many quantum algorithms, including Hamiltonian simulation, efficient quantum circuit implementation of diagonal unitary matrices is an important issue. For small unitary diagonal matrices, a method based on Walsh operators is known and allows an exact implementation. Whereas, as the matrix size increases, the required resources increase linearly regarding the matrix size, so an efficient approximate implementation is indispensable. In this study, we specify the approximation using piecewise polynomials when the diagonal unitary matrix is generated by a known underlying function. It accelerates the implementation by an exponential factor compared to the exact one. In more detail, we modify a previous method, which we call PPP (phase gate for piecewise-defined polynomial), and propose a novel one called LIU (linearly interpolated unitary diagonal matrix). By introducing a coarse-graining parameter, calculated from the underlying function and the desired error bound, we evaluate the explicit gate counts for different methods as functions of some norms of the given function, the grid parameter, and the allowable error. It helps us to figure out the efficient quantum circuits in practical settings of different grid parameters and error bounds, in addition to an asymptotic speedup when the grid parameter goes to infinity. As an application, we apply our method to the first-quantized Hamiltonian simulation and estimate the quantum resources (gate count and ancillary qubits). It reveals that the error coming from the approximation of the potential function is not negligible compared to the error from the Trotter-Suzuki formula.

Similar Papers
  • Research Article
  • Citations6

Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations

  • Sep 12, 2024
  • Physical Review Research
  • Tatsuhiko N Ikeda +2
  • Supplementary Content

On Quantum Computing and Pseudorandomness

  • Jun 01, 2010
  • William Jason Fefferman
  • Research Article
  • Citations1

Quantum dynamics simulation of the advection-diffusion equation

  • Dec 19, 2025
  • Physical Review Research
  • Hirad Alipanah +8
  • Research Article
  • Citations1

Linear constraint problem of Hermitian unitary symplectic matrices

  • May 13, 2020
  • Linear and Multilinear Algebra
  • Lijun Zhao
  • PDF
  • Research Article
  • Citations1

Dictionary-based Block Encoding of Sparse Matrices with Low Subnormalization and Circuit Depth

  • Jul 22, 2025
  • Quantum
  • Chunlin Yang +5
  • Research Article
  • Citations8

New techniques for Daubechies wavelets and multiwavelets implementation using quantum computing

  • Jan 01, 2013
  • Facta universitatis - series: Electronics and Energetics
  • Saleem Taha +1
  • Research Article
  • Citations821

Optimal Hamiltonian Simulation by Quantum Signal Processing

  • Jan 05, 2017
  • Physical Review Letters
  • Guang Hao Low +1
  • Research Article
  • Citations10

Quantum algorithm for matrix functions by Cauchy's integral formula

  • Feb 01, 2020
  • Quantum Information and Computation
  • Souichi Takahira +3
  • PDF
  • Research Article
  • Citations41

Low-cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem

  • May 27, 2019
  • npj Quantum Information
  • Yunseong Nam +1
  • Research Article
  • Citations2

Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers

  • Aug 19, 2025
  • Physical Review A
  • Kushagra Garg +3
  • Research Article
  • Citations15

Robustness of quantum algorithms against coherent control errors

  • Jan 10, 2024
  • Physical Review A
  • Julian Berberich +2
  • PDF
  • Research Article
  • Citations9

Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications

  • Jan 01, 2021
  • EPJ Web of Conferences
  • Wonho Jang +9
  • Conference Article
  • Citations3

Design and Analysis of a Scalable and Efficient Quantum Circuit for LWE Matrix Arithmetic

  • Oct 01, 2022
  • Chao Lu +2
  • Research Article
  • Citations40

Realization of quantum signal processing on a noisy quantum computer

  • Sep 23, 2023
  • npj Quantum Information
  • Yuta Kikuchi +4
  • Research Article
  • Citations1

Lower bounds for quantum-inspired classical algorithms via communication complexity

  • Jan 14, 2025
  • Quantum
  • Nikhil S Mande +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.