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 14 items.
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- Quantum search with variable times (Q1959400) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- The quantum query complexity of \(\mathrm{AC}^0\) (Q2906797) (← links)
- The influence lower bound via query elimination (Q2913796) (← links)
- Optimal quantum query bounds for almost all Boolean functions. (Q2957905) (← links)
- Dequantizing read-once quantum formulas (Q2958412) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Quantum Query Complexity of Boolean Functions with Small On-Sets (Q3597889) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311154) (← 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)