On the complexity of the multivariate Sturm-Liouville eigenvalue problem

DOI10.1016/j.jco.2007.03.002zbMath1129.65079OpenAlexW2032237260MaRDI QIDQ2465305

Anargyros Papageorgiou

Publication date: 9 January 2008

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

Full work available at URL: https://doi.org/10.1016/j.jco.2007.03.002

zbMATH Keywords

complexityeigenvalue problemquantum algorithmsrandomized algorithmsmallest eigenvalueeigenvalue approximation

Mathematics Subject Classification ID

Estimates of eigenvalues in context of PDEs (35P15) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

A fast algorithm for approximating the ground state energy on a quantum computer ⋮ Estimating the ground state energy of the Schrödinger equation for convex potentials ⋮ Approximating ground and excited state energies on a quantum computer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for higher eigenvalues by finite difference methods
• The quantum setting with randomized queries for continuous problems
• A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer
• Quantum integration in Sobolev classes
• Error bounds for exponential operator splittings
• Quantum summation with an application to integration.
• 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
• Upper and lower bounds for eigenvalues by finite difference methods
• Quantum algorithms revisited
• Quantum Complexity Theory
• Quantum lower bounds by polynomials
• Quantum complexity of integration

This page was built for publication: On the complexity of the multivariate Sturm-Liouville eigenvalue problem