A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer

DOI10.1016/j.jco.2006.03.006zbMath1142.34392arXivquant-ph/0512109MaRDI QIDQ855896

Arvid J. Bessen

Publication date: 7 December 2006

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0512109

zbMATH Keywords

Sturm-Liouville problem; lower bounds; quantum algorithm; power queries

Mathematics Subject Classification ID

81P68: Quantum computation

65L15: Numerical solution of eigenvalue problems involving ordinary differential equations

34L15: Eigenvalues, estimation of eigenvalues, upper and lower bounds of ordinary differential operators

Related Items

Quantum Walks, Quantum lower bounds by entropy numbers, On the complexity of the multivariate Sturm-Liouville eigenvalue problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum summation with an application to integration.
• Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
• Quantum approximation. II: Sobolev embeddings
• The power of various real-valued quantum queries
• Classical and quantum complexity of the Sturm-Liouville eigenvalue problem
• The quantum query complexity of approximating the median and related statistics
• Lower bound for quantum phase estimation
• Quantum lower bounds by polynomials
• Quantum complexity of integration