Exact and Efficient Circuit Construction for Block Encoding Matrix Polynomials

DOI10.48550/arXiv.2608.15161MaRDI QIDQ7284874arXivFDO

Authors Taehee Ko

Publication date 15 August 2026

Published in arXiv

Tldr We develop an efficient and exact algorithm that constructs block encodings for matrix polynomials, achieving near-optimal time complexity O(dlogd) for target polynomial degree d, and apply it to both standard input models: block encoding and Hamiltonian simulation.

Full work available at URL https://doi.org/10.48550/arXiv.2608.15161

arXiv classification

math.NAquant-ph

Cites work

• A Quantum Path to Partial Differential Equations
• Complementary polynomials in quantum signal processing
• Infinite quantum signal processing
• Infinite quantum signal processing for arbitrary Szegő functions
• On efficient quantum block encoding of pseudo-differential operators
• Optimal quantum algorithm for Gibbs state preparation
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Robust iterative method for symmetric quantum signal processing in all parameter regimes
• Stable factorization for phase factors of quantum signal processing
• Transformation of quantum states using uniformly controlled rotations

This page was built for publication: Exact and Efficient Circuit Construction for Block Encoding Matrix Polynomials

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