Pages that link to "Item:Q5894821"
From MaRDI portal
The following pages link to Quantum lower bounds by quantum arguments (Q5894821):
Displayed 15 items.
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Optimality proofs of quantum weight decision algorithms (Q430107) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- Quantum counterfeit coin problems (Q714865) (← 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 algorithms for matching problems (Q839634) (← links)
- The quantum query complexity of the determinant (Q976107) (← links)
- Quantum certificate complexity (Q2475404) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT (Q2909539) (← links)
- Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
- Entanglement flow in multipartite systems (Q3102386) (← links)
- Quantum Queries on Permutations with a Promise (Q3637358) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)