The following pages link to Andris Ambainis (Q230552):
Displaying 50 items.
- (Q3171618) (← links)
- (Q3172424) (← links)
- (Q3191607) (← links)
- Computing with highly mixed states (extended abstract) (Q3192044) (← links)
- All Classical Adversary Methods are Equivalent for Total Functions (Q3304102) (← links)
- (Q3437580) (← links)
- Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification (Q3455200) (← links)
- Dense quantum coding and quantum finite automata (Q3455539) (← links)
- (Q3522383) (← links)
- Computing with highly mixed states (Q3546320) (← links)
- The minimum distance problem for two-way entanglement purification (Q3546501) (← links)
- Transformations that preserve learnability (Q3556999) (← links)
- Nonlocal Quantum XOR Games for Large Number of Players (Q3569065) (← links)
- Quantum algorithms a decade after shor (Q3580950) (← links)
- New Developments in Quantum Algorithms (Q3586066) (← links)
- (Q3589465) (← links)
- Quantum Query Complexity of Boolean Functions with Small On-Sets (Q3597889) (← links)
- Nonmalleable encryption of quantum information (Q3650492) (← links)
- (Q4218115) (← links)
- (Q4240334) (← links)
- (Q4252369) (← links)
- (Q4370213) (← links)
- (Q4370228) (← links)
- (Q4415450) (← links)
- (Q4415451) (← links)
- The Quantum Communication Complexity of Sampling (Q4441894) (← links)
- (Q4459079) (← links)
- (Q4470530) (← links)
- (Q4496246) (← links)
- (Q4501528) (← links)
- (Q4504216) (← links)
- (Q4508377) (← links)
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing (Q4571925) (← links)
- Upper bound on the communication complexity of private information retrieval (Q4571971) (← links)
- Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing (Q4575644) (← links)
- General inductive inference types based on linearly-ordered sets (Q4593935) (← links)
- Upper bounds on multiparty communication complexity of shifts (Q4593966) (← links)
- Separations in Query Complexity Based on Pointer Functions (Q4640297) (← links)
- (Q4779141) (← links)
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS (Q4819288) (← links)
- (Q4910707) (← links)
- (Q4938621) (← links)
- (Q4938665) (← links)
- (Q4943318) (← links)
- (Q4967202) (← links)
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games (Q4978040) (← links)
- All Classical Adversary Methods Are Equivalent for Total Functions (Q5061885) (← links)
- Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language (Q5089167) (← links)
- UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY (Q5122156) (← links)
- Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test (Q5127179) (← links)
