Pages that link to "Item:Q2490260"
From MaRDI portal
The following pages link to Polynomial degree vs. quantum query complexity (Q2490260):
Displaying 27 items.
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- Quantum counterfeit coin problems (Q714865) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- Nonadaptive quantum query complexity (Q1675876) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- Quantum algorithm for shortest path search in directed acyclic graph (Q2314214) (← links)
- Superlinear Advantage for Exact Quantum Algorithms (Q2805516) (← links)
- Ultrametric Algorithms and Automata (Q2945554) (← links)
- (Q3187177) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing (Q4571925) (← links)
- Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5089146) (← links)
- New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity (Q5090948) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5140844) (← links)
- BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
- (Q6176155) (← links)
