Metraipolis › archive › dc_85bc1d443aa1

Contour-integral and Fourier transform based multivariable quantum eigenvalue transformation for commuting matrices — arXiv:2609.32262

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.32262
License (as archived)
CC0-1.0
Archived
2026-10-07T23:25:22.055Z
SHA-256 of the archived text
a35e1de6041ba6197b51e1405d7b321e7112ea6faa56b4a2d739e24a49561961
Stable URL of this page
https://metraipolis.com/documento/dc_85bc1d443aa1

How to cite

Contour-integral and Fourier transform based multivariable quantum eigenvalue transformation for commuting matrices — arXiv:2609.32262 — arXiv (en), https://arxiv.org/abs/2609.32262 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_85bc1d443aa1 (Metraipolis archive dc_85bc1d443aa1, sha256 a35e1de6041ba6197b51e1405d7b321e7112ea6faa56b4a2d739e24a49561961)
BibTeX
@misc{dc85bc1d443aa1,
  title = {Contour-integral and Fourier transform based multivariable quantum eigenvalue transformation for commuting matrices — arXiv:2609.32262},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.32262},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_85bc1d443aa1; sha256 a35e1de6041ba6197b51e1405d7b321e7112ea6faa56b4a2d739e24a49561961},
  year = {2026}
}

Archived text

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

We study the problem of implementing multivariable matrix-valued functions on a quantum computer and propose two quantum algorithms for multivariable matrix eigenvalue transformations acting on tuples of pairwise commuting matrices. The first algorithm is based on multivariable contour integrals and applies to arbitrary holomorphic functions on $\mathbb{C}^n$. The second algorithm is based on high-dimensional Fourier transforms and designed for smooth functions of commuting Hermitian matrices. For both algorithms, we discuss and analyze the complexity of their quantum implementation leveraging quantum singular value transformation, compression gadgets, and linear combination of unitaries. We additionally study their hybrid quantum--classical variants that reduce the number of required ancilla qubits to logarithmic dependence on the number of variables, at the cost of increased query complexity. As an application, we show that multivariable matrix polynomials can be implemented with no additional explicit degree dependence, depending only on global properties of the polynomials.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.NA).
Categorie arXiv: Quantum Physics (quant-ph) ; Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.32262 — 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-07T23:04:09.528Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).