Contour-integral based quantum eigenvalue transformation: analysis and applications

• URL: http://arxiv.org/abs/2601.11959v2
• Date: Sun, 25 Jan 2026 13:16:42 GMT
• Title: Contour-integral based quantum eigenvalue transformation: analysis and applications
• Authors: Shan Jiang, Dong An,
• Abstract summary: Eigenvalue transformations are beyond the reach of the quantum singular value transformation framework.<n>We propose a quantum algorithm for estimating observables of eigenvalue transformations using only $3$ qubits.<n>We show that the contour integral algorithm can outperform all the existing quantum algorithms in the case of solving ordinary differential equations.
• Score: 5.838361906016925
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Eigenvalue transformations appear ubiquitously in scientific computation, ranging from matrix polynomials to differential equations, and are beyond the reach of the quantum singular value transformation framework. In this work, we study the efficiency of quantum algorithms based on contour integral representation for eigenvalue transformations from both theoretical and practical aspects. Theoretically, we establish a complete complexity analysis of the contour integral approach proposed in [Takahira, Ohashi, Sogabe, and Usuda. Quant. Inf. Comput., 22, 11\&12, 965--979 (2021)]. Moreover, we combine the contour integral approach and the sampling-based linear combination of unitaries to propose a quantum algorithm for estimating observables of eigenvalue transformations using only $3$ additional qubits. Practically, we design contour integral based quantum algorithms for Hamiltonian simulation, matrix polynomials, and solving linear ordinary differential equations, and show that the contour integral algorithm can outperform all the existing quantum algorithms in the case of solving asymptotically stable differential equations.

Related papers

• The Integral Decimation Method for Quantum Dynamics and Statistical Mechanics [44.99833362998488]
  A direct numerical evaluation of an multidimensional integral incurs a computational cost that is exponential in the number of dimensions.<n>Here, we derive and implement a quantum algorithm to compress multidimensional integrand into a product of matrix-valued functions.
  arXiv  Detail & Related papers  (2025-06-12T22:26:12Z)
• Quantum Rational Transformation Using Linear Combinations of Hamiltonian Simulations [0.0]
  We introduce effective implementations of rational transformations of a target operator on quantum hardware. We show that rational transformations can be performed efficiently with Hamiltonian simulations using a linear-combination-of-unitaries (LCU)
  arXiv  Detail & Related papers  (2024-08-14T18:00:01Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Quantum eigenvalue processing [0.0]
  Problems in linear algebra can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. We present a Quantum EigenValue Transformation (QEVT) framework for applying arbitrary transformations on eigenvalues of block-encoded non-normal operators. We also present a Quantum EigenValue Estimation (QEVE) algorithm for operators with real spectra.
  arXiv  Detail & Related papers  (2024-01-11T19:49:31Z)
• Variational quantum algorithms for scanning the complex spectrum of non-Hermitian systems [0.0]
  We propose a variational method for solving the non-Hermitian Hamiltonian on a quantum computer. The energy is set as a parameter in the cost function and can be tuned to obtain the whole spectrum. Our work suggests an avenue for solving non-Hermitian quantum many-body systems with variational quantum algorithms on near-term noisy quantum computers.
  arXiv  Detail & Related papers  (2023-05-31T12:50:22Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Implicit differentiation of variational quantum algorithms [0.8594140167290096]
  We show how to leverage implicit differentiation for computation through variational quantum algorithms. We explore applications in condensed matter physics, quantum machine learning, and quantum information.
  arXiv  Detail & Related papers  (2022-11-24T19:00:19Z)
• Real quantum operations and state transformations [44.99833362998488]
  Resource theory of imaginarity provides a useful framework to understand the role of complex numbers. In the first part of this article, we study the properties of real'' (quantum) operations in single-party and bipartite settings. In the second part of this article, we focus on the problem of single copy state transformation via real quantum operations.
  arXiv  Detail & Related papers  (2022-10-28T01:08:16Z)
• Quantum gradient descent algorithms for nonequilibrium steady states and linear algebraic systems [0.17188280334580192]
  gradient descent is a key ingredient in variational quantum algorithms and machine learning tasks. We present approaches to simulate the nonequilibrium steady states of Markovian open quantum many-body systems. We adapt the quantum gradient descent algorithm to solve linear algebra problems including linear systems of equations and matrix-vector multiplications.
  arXiv  Detail & Related papers  (2022-04-15T01:20:33Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)

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.