The following pages link to Andris Ambainis (Q230552):
Displaying 38 items.
- Quadratic speedup for finding marked vertices by Quantum walks (Q5144929) (← links)
- Weak Parity (Q5167728) (← links)
- Tighter Relations between Sensitivity and Other Complexity Measures (Q5167734) (← links)
- One-dimensional quantum walks (Q5175951) (← links)
- Quantum walks on graphs (Q5175952) (← links)
- A new protocol and lower bounds for quantum coin flipping (Q5175961) (← links)
- Quantum Speedups for Exponential-Time Dynamic Programming Algorithms (Q5236291) (← links)
- STACS 2004 (Q5309690) (← links)
- STACS 2004 (Q5309692) (← links)
- Parsimony hierarchies for inductive inference (Q5311725) (← links)
- (Q5368738) (← links)
- Polynomials, quantum query complexity, and Grothendieck's inequality (Q5368759) (← links)
- A quantum Lovász local lemma (Q5395693) (← links)
- Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
- Quantum Walks with Multiple or Moving Marked Locations (Q5448675) (← links)
- Quantum Algorithms for Matching and Network Flows (Q5449796) (← links)
- Quantum Walk Algorithm for Element Distinctness (Q5454249) (← links)
- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems (Q5459157) (← links)
- Superlinear advantage for exact quantum algorithms (Q5495861) (← links)
- Recent Developments in Quantum Algorithms and Complexity (Q5496172) (← links)
- Grover’s Algorithm with Errors (Q5499981) (← links)
- Improved Constructions of Quantum Automata (Q5503296) (← links)
- Sensitivity Versus Certificate Complexity of Boolean Functions (Q5740174) (← links)
- Improved Algorithms for Quantum Identification of Boolean Oracles (Q5757907) (← links)
- Quantum algorithms for computational geometry problems (Q5874394) (← links)
- Strong dispersion property for the quantum walk on the hypercube (Q5878957) (← links)
- Quantum lower bounds by quantum arguments (Q5894821) (← links)
- Quantum lower bounds by quantum arguments (Q5895206) (← links)
- Public Key Cryptography – PKC 2004 (Q5901819) (← links)
- Hierarchies of probabilistic and team FIN-learning (Q5941370) (← links)
- Probabilistic inductive inference: A survey (Q5941566) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
- Quantum bounds for 2D-grid and Dyck language (Q6101583) (← links)
- (Q6161147) (← links)
- The complexity of probabilistic versus deterministic finite automata (Q6487443) (← links)
- An exponential separation between quantum query complexity and the polynomial degree (Q6640361) (← links)
- Improved algorithm and lower bound for variable time quantum search (Q6640416) (← links)
- Dataset for "Strong dispersion property for the quantum walk on the hypercube" (Q6710866) (← links)
