Pages that link to "Item:Q3580990"
From MaRDI portal
The following pages link to Lower bounds for local search by quantum arguments (Q3580990):
Displaying 8 items.
- Ranking-based black-box complexity (Q528852) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- Enhanced algorithms for local search (Q1045925) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs (Q3541808) (← links)
- Quantum computing, postselection, and probabilistic polynomial-time (Q5428317) (← links)
