Pages that link to "Item:Q557899"
From MaRDI portal
The following pages link to On the power of Ambainis lower bounds (Q557899):
Displaying 19 items.
- On the power of non-adaptive learning graphs (Q488054) (← links)
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952) (← links)
- Quantum counterfeit coin problems (Q714865) (← links)
- A query-efficient quantum algorithm for maximum matching on general graphs (Q832903) (← 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)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
- Quantum query complexity of constant-sized subgraph containment (Q2909539) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- (Q5089146) (← links)
- (Q5089153) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)
- Automata, Languages and Programming (Q5466452) (← links)
- RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC (Q5495415) (← links)
- Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems (Q5889069) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
- On query complexity measures and their relations for symmetric functions (Q6547823) (← links)
- Symmetries, graph properties, and quantum speedups (Q6654557) (← links)
