The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries

DOI10.1007/s11128-006-0043-0zbMath1119.68224arXivquant-ph/0504194OpenAlexW1989941859WikidataQ57636019 ScholiaQ57636019MaRDI QIDQ2384174

Anargyros Papageorgiou, Henryk Woźniakowski

Publication date: 20 September 2007

Published in: Quantum Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

approximationquantum algorithmsComplexityNP complete problems

Mathematics Subject Classification ID

Related Items (1)

On the complexity of searching for a maximum of a function on a quantum computer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum integration in Sobolev classes
• The quantum query complexity of approximating the median and related statistics
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Complexity Theory
• Strengths and Weaknesses of Quantum Computing
• Quantum complexity of integration

This page was built for publication: The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries