Metraipolis › archive › dc_0d1fff7bbd76

Exact and Efficient Circuit Construction for Block Encoding Matrix Polynomials — arXiv:2608.15161

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15161
License (as archived)
CC0-1.0
Archived
2026-10-18T21:41:44.929Z
SHA-256 of the archived text
43012f0633f195d087093a549019d74a6695cdbfeac5336679df395dea81eb84
Stable URL of this page
https://metraipolis.com/documento/dc_0d1fff7bbd76

How to cite

Exact and Efficient Circuit Construction for Block Encoding Matrix Polynomials — arXiv:2608.15161 — arXiv (en), https://arxiv.org/abs/2608.15161 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0d1fff7bbd76 (Metraipolis archive dc_0d1fff7bbd76, sha256 43012f0633f195d087093a549019d74a6695cdbfeac5336679df395dea81eb84)
BibTeX
@misc{dc0d1fff7bbd76,
  title = {Exact and Efficient Circuit Construction for Block Encoding Matrix Polynomials — arXiv:2608.15161},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15161},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0d1fff7bbd76; sha256 43012f0633f195d087093a549019d74a6695cdbfeac5336679df395dea81eb84},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15161. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A recent interpolation-based Quantum Signal Processing (QSP) framework by Alase bypasses the phase-finding procedures required in conventional QSP, allowing for a direct encoding of the target polynomial into a quantum circuit. However, this approach assumes access to a diagonal block encoding of function values without providing an explicit circuit construction. In this work, we address this gap by developing an explicit circuit construction method for diagonal block encodings. 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. Numerical results confirm this scaling, demonstrating that circuit parameters for polynomial degrees up to $10^7$ can be computed in about a minute on a standard CPU.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in math.NA).
Categorie arXiv: Quantum Physics (quant-ph) ; Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2608.15161 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T19:55:33.149Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).