Pages that link to "Item:Q3580990"
From MaRDI portal
The following pages link to Lower bounds for local search by quantum arguments (Q3580990):
Displaying 15 items.
- Ranking-based black-box complexity (Q528852) (← links)
- On the power of Ambainis lower bounds (Q557899) (← 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)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- Enhanced algorithms for local search (Q1045925) (← links)
- Dividing and conquering the square (Q1801677) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- New upper and lower bounds for randomized and quantum local search (Q2931424) (← links)
- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs (Q3541808) (← links)
- Lower bounds of a quantum search for an extreme point (Q4262186) (← links)
- Quantum computing, postselection, and probabilistic polynomial-time (Q5428317) (← links)
- Lower Bounds for Local Search by Quantum Arguments (Q5470715) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5901075) (← links)