Pages that link to "Item:Q1880783"
From MaRDI portal
The following pages link to A lower bound on the quantum query complexity of read-once functions (Q1880783):
Displaying 7 items.
- On the power of Ambainis lower bounds (Q557899) (← links)
- Quantum search with variable times (Q1959400) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
- Quantum Algorithms for Evaluating Min-Max Trees (Q5503293) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
