Krylov polynomials and quantum query complexity

DOI10.1016/J.PHYSLETA.2026.131601MaRDI QIDQ7291118zbMATH OpenFDO

Authors

Publication date 7 July 2026

Published in Physics Letters. A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PHYSLETA.2026.131601

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites work

• C${\cal C}$osmological K${\cal K}$rylov C${\cal C}$omplexity
• Exponential algorithmic speedup by a quantum walk
• scientific article; zbMATH DE number 635686 (Why is no real title available?)
• Krylov complexity and orthogonal polynomials
• Krylov complexity in quantum field theory
• Krylov complexity of fermionic and bosonic Gaussian states
• Orthogonal polynomials
• Quantum computation as geometry
• Quantum dynamics in Krylov space: methods and applications
• Quantum lower bounds by polynomials
• Quantum lower bounds by sample-to-query lifting
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Quantum walks: a comprehensive review

This page was built for publication: Krylov polynomials and quantum query complexity

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