The following pages link to (Q4449183):
Displaying 18 items.
- Quantum walks can find a marked element on any graph (Q262276) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Claw finding algorithms using quantum walk (Q1034536) (← links)
- Quantum search with variable times (Q1959400) (← links)
- Quantum algorithms for string processing (Q2091414) (← links)
- Quantum algorithm for Dyck language with multiple types of brackets (Q2152087) (← links)
- Extended learning graphs for triangle finding (Q2300731) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Quantum Walk Based Search Algorithms (Q3502631) (← links)
- Quantum bounds for 2D-grid and Dyck language (Q6101583) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
