The following pages link to Andris Ambainis (Q230552):
Displaying 50 items.
- (Q198416) (redirect page) (← links)
- How rich is the structure of the intrinsic complexity of learning (Q294809) (← links)
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- On symmetric nonlocal games (Q391085) (← links)
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- Random tensor theory: Extending random matrix theory to mixtures of random product states (Q664332) (← links)
- Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities (Q670063) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Probabilistic and team PFIN-type learning: General properties (Q927866) (← links)
- Improved constructions of quantum automata (Q1017403) (← links)
- Delayed binary search, or playing twenty questions with a procrastinator (Q1348914) (← links)
- Exact results for accepting probabilities of quantum automata. (Q1401229) (← links)
- Ordinal mind change complexity of language identification (Q1575840) (← links)
- A note on quantum black-box complexity of almost all Boolean functions (Q1606953) (← links)
- On learning formulas in the limit and with assurance. (Q1607074) (← links)
- Two-way finite automata with quantum and classical states. (Q1853472) (← links)
- A new protocol and lower bounds for quantum coin flipping (Q1887717) (← links)
- Communication complexity in a 3-computer model (Q1924405) (← links)
- Quantum search with variable times (Q1959400) (← links)
- On block sensitivity and fractional block sensitivity (Q1992105) (← links)
- Automata and quantum computing (Q2244834) (← links)
- Quantum security proofs using semi-classical oracles (Q2304985) (← links)
- Algebraic results on quantum automata (Q2432533) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- (Q2762497) (← links)
- Average-case quantum query complexity (Q2766189) (← links)
- Superlinear Advantage for Exact Quantum Algorithms (Q2805516) (← links)
- Dense quantum coding and a lower bound for 1-way quantum automata (Q2819570) (← links)
- 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)
- A quantum lovász local lemma (Q2875141) (← links)
- (Q2904800) (← links)
- (Q2921782) (← links)
- A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity (Q2922593) (← links)
- Worst Case Analysis of Non-local Games (Q2927639) (← links)
- A new quantum lower bound method, (Q2931423) (← links)
- Forrelation (Q2941519) (← links)
- Fast Matrix Multiplication (Q2941553) (← links)
- Size of Sets with Small Sensitivity: A Generalization of Simon’s Lemma (Q2948459) (← links)
- Optimal quantum query bounds for almost all Boolean functions. (Q2957905) (← links)
- Provable Advantage for Quantum Strategies in Random Symmetric XOR Games (Q2958417) (← links)
- Exact Quantum Query Complexity of EXACT and THRESHOLD (Q2958430) (← links)
- Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ (Q2971138) (← links)
- (Q3002756) (← links)
- (Q3002757) (← links)
- (Q3002814) (← links)
- Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer (Q3068642) (← links)
- Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
