The following pages link to Andris Ambainis (Q230552):
Displaying 8 items.
- Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems (Q2828234) (← links)
- Quantum Strategies Are Better Than Classical in Almost Any XOR Game (Q2843231) (← links)
- Forrelation (Q2941519) (← links)
- Dense quantum coding and quantum finite automata (Q3455539) (← links)
- Quantum Query Complexity of Boolean Functions with Small On-Sets (Q3597889) (← links)
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games (Q4978040) (← links)
- Quadratic speedup for finding marked vertices by Quantum walks (Q5144929) (← links)
- Quantum Walk Algorithm for Element Distinctness (Q5454249) (← links)