The following pages link to (Q3002757):
Displaying 37 items.
- Quantum walks can find a marked element on any graph (Q262276) (← links)
- Robust quantum spatial search (Q331506) (← links)
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- Improvements to quantum search techniques for block-ciphers, with applications to AES (Q832355) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Faster search by lackadaisical quantum walk (Q1746914) (← links)
- Quantum walks: a comprehensive review (Q1757875) (← links)
- Spatial search using the discrete time quantum walk (Q1761706) (← links)
- Quantum search with variable times (Q1959400) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- On the hitting times of quantum versus random walks (Q2429358) (← links)
- Quantum search in structured database using local adiabatic evolution and spectral methods (Q2436417) (← links)
- Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term (Q2684325) (← links)
- Quantum search of matching on signed graphs (Q2690254) (← links)
- Entanglement entropy distinguishes PT-symmetry and topological phases in a class of non-unitary quantum walks (Q2693863) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Approximate Locality for Quantum Systems on Graphs (Q3107627) (← links)
- Multi-query Quantum Sums (Q3453317) (← links)
- Quantum Walk Based Search Algorithms (Q3502631) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- (Q4612479) (← links)
- (Q4637980) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- (Q5090396) (← links)
- (Q5090500) (← links)
- (Q5092483) (← links)
- Lackadaisical quantum walk for spatial search (Q5110425) (← links)
- The complexity of quantum disjointness (Q5111229) (← links)
- Quantum search on Hanoi network (Q5219344) (← links)
- (Q5875509) (← links)
- Odd-periodic Grover walks (Q6073977) (← links)
- Quantum walk search on a two-dimensional grid with extra edges (Q6164199) (← links)
