Pages that link to "Item:Q2957905"
From MaRDI portal
The following pages link to Optimal quantum query bounds for almost all Boolean functions. (Q2957905):
Displaying 10 items.
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- Optimality proofs of quantum weight decision algorithms (Q430107) (← links)
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- A lower bound on the quantum query complexity of read-once functions (Q1880783) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- Superlinear advantage for exact quantum algorithms (Q2805516) (← links)
- Quantum Query Complexity of Boolean Functions with Small On-Sets (Q3597889) (← links)
- (Q4453511) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711559) (← links)