Taehee Ko

Exact and Efficient Circuit Construction for Block Encoding Matrix Polynomials

The resulting algorithm achieves a computational cost of $\mathcal{O}(d\log d)$ for explicitly constructing block encodings of matrix polynomials, improving upon the best-known theoretical bounds of previous methods.