20 results for βQuantum query complexityβ
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.β
Want pure semantic search? Try claim verification β
Determining the stability of a linear system using quantum query complexity.
This paper presents two quantum algorithms for solving linear systems with normalized solution $|x angle$ to accuracy $Ξ΅$, independent of the condition number $ΞΊ$.
This paper presents exact quantum algorithms for block compositions of total Boolean functions.
The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.
The paper defines and studies the complexity classes for quantum approximation algorithms and establishes a hierarchy of quantum approximation classes.
The paper studies the resources required to batch verify Boolean functions and provides lower bounds on the witness-query tradeoff based on approximate degree.
This paper shows that shallow circuits cannot prepare near-optimal states for random quantum $p$-spin glasses, and proves depth lower bounds for such preparations.
This paper studies the computational complexity of the width parameter in Montanaro's polynomial representation of quantum circuits.
This paper proves that certain optimization problems are NP-hard and provides a complexity-theoretic benchmark for quantum algorithms.
This paper develops and analyzes two differentially private methods for answering counting queries on quantum-encoded datasets, demonstrating improved privacy guarantees and a quantum-safe approach foβ¦