Quantum query complexity with matrix-vector products

DOI10.4230/LIPICS.ICALP.2021.55MaRDI QIDQ7241153zbMATH OpenFDO

Authors Andrew M. Childs, Shih-Han Hung, Tongyang Li

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2021.55

zbMATH Keywords

matrix-vector productsquantum algorithmsquantum query complexity

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3552764 (Why is no real title available?)
• scientific article; zbMATH DE number 7788397 (Why is no real title available?)
• No quantum speedup over gradient descent for non-smooth convex optimization
• Quantum Complexity Theory
• Quantum lower bound for the collision problem
• Quantum lower bounds by polynomials
• Quantum speedup for graph sparsification, cut approximation and Laplacian solving
• The quantum query complexity of the abelian hidden subgroup problem

This page was built for publication: Quantum query complexity with matrix-vector products

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