Pages that link to "Item:Q3541808"
From MaRDI portal
The following pages link to Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs (Q3541808):
Displaying 5 items.
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- Vertices cannot be hidden from quantum spatial search for almost all random graphs (Q1654045) (← links)
- Impact of global and local interaction on quantum spatial search on chimera graph (Q5207187) (← links)
- Lower Bounds for Local Search by Quantum Arguments (Q5470715) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)