Quantum eigenvalue processing

DOI10.1137/24M1689363MaRDI QIDQ6846216zbMATH OpenFDO

Authors Guang Hao Low, Yuan Su

Publication date 11 March 2026

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1689363

zbMATH Keywords

Faber polynomialsnon-normal matricesquantum eigenvalue estimationquantum eigenvalue transformation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites work

• A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
• Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane
• Error Estimates and Evaluation of Matrix Functions via the Faber Transform
• Exponential improvement in precision for simulating sparse Hamiltonians
• Faber Polynomials and the Faber Series
• Faber polynomials in the theory of univalent functions
• Faster ground state preparation and high-precision ground energy estimation with fewer qubits
• Faster than Hermitian quantum mechanics
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 1241475 (Why is no real title available?)
• scientific article; zbMATH DE number 635657 (Why is no real title available?)
• scientific article; zbMATH DE number 2212009 (Why is no real title available?)
• Normal matrices: an update
• On computing condition numbers for the nonsymmetric eigenproblem
• On the numerical range of some weighted shift matrices and operators
• On the relationship between continuous- and discrete-time quantum walk
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum algorithm for linear differential equations with exponentially improved dependence on precision
• Quantum recommendation systems
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
• The Faber polynomials for circular sectors
• The functions erf and erfc computed with arbitrary precision and explicit error bounds
• The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
• Toward the first quantum simulation with quantum speedup
• Universal Quantum Simulators

This page was built for publication: Quantum eigenvalue processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846216)