Metraipolis › archive › dc_f4470079b667

Quantum oblique eigenprojection — arXiv:2609.40254

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40254
License (as archived)
CC0-1.0
Archived
2026-10-07T15:17:19.650Z
SHA-256 of the archived text
9b3a63acfb900f3f7a944d1e54626a472b7809c88392bb5ce7931f7bda6ecfaf
Stable URL of this page
https://metraipolis.com/documento/dc_f4470079b667

How to cite

Quantum oblique eigenprojection — arXiv:2609.40254 — arXiv (en), https://arxiv.org/abs/2609.40254 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f4470079b667 (Metraipolis archive dc_f4470079b667, sha256 9b3a63acfb900f3f7a944d1e54626a472b7809c88392bb5ce7931f7bda6ecfaf)
BibTeX
@misc{dcf4470079b667,
  title = {Quantum oblique eigenprojection — arXiv:2609.40254},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40254},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f4470079b667; sha256 9b3a63acfb900f3f7a944d1e54626a472b7809c88392bb5ce7931f7bda6ecfaf},
  year = {2026}
}

Archived text

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

Every square matrix decomposes its underlying Hilbert space into generalized, nonorthogonal eigensubspaces. We show that a quantum computer can perform such an oblique eigenprojection $\Pi$ given block encoding access to the input matrix. Our approach has a query complexity nearly linear in the inverse gap and a normalization factor close to $\lVert\Pi\rVert$ under a spectral-set condition on the input. This covers common assumptions on the numerical range or diagonalizability and matches known results for orthogonal eigenprojections. We achieve this with a two-sided block preconditioning that uses a discrete Fourier transform of the matrix resolvent. We describe applications to: (i) preparing eigenstates of matrices with complex eigenvalues, extending the quantum eigenvalue transformation algorithm of Low and Su beyond real spectra; (ii) solving continuous-time algebraic Riccati equations, cubically speeding up a prior solver of Rodenas-Ruiz, Zhao, and Lee; and (iii) solving ordinary Sylvester equations, quadratically improving a direct augmented method of Wang and Liu. Our result suggests a promising route to applying nonanalytic matrix functions on quantum computers.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in cs.DS).
Categorie arXiv: Quantum Physics (quant-ph) ; Data Structures and Algorithms (cs.DS); Chemical Physics (physics.chem-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.40254 — 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-07T14:50:37.680Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).