Pages that link to "Item:Q1871634"
From MaRDI portal
The following pages link to Sharp quantum versus classical query complexity separations (Q1871634):
Displaying 13 items.
- The quantum query complexity of learning multilinear polynomials (Q436558) (← links)
- Approximate range searching in external memory (Q627532) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Minimum-cost load-balancing partitions (Q834581) (← links)
- Improved bounds on the union complexity of fat objects (Q946687) (← links)
- Kinetic collision detection for convex fat objects (Q1016518) (← links)
- Approximate unions of lines and Minkowski sums (Q2369877) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Quantum algorithm for multivariate polynomial interpolation (Q4556869) (← links)
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing (Q4571925) (← links)
- Quantum vs Classical Proofs and Subset Verification (Q5005122) (← links)
- (Q5091154) (← links)
