Andris Ambainis (U of Latvia)
Identifiers
- name variant Andris Ambainis (U of Latvia) 0.60 · backfill
Papers (2)
- Optimal quantum query bounds for almost all Boolean functions quant-ph · 2012 · author #1
- How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? quant-ph · 2012 · author #1
Mentions
Frequent Coauthors
- Ronald de Wolf (CWI 2 shared papers
- U of Amsterdam) 2 shared papers
- Arturs Backurs (U of Latvia) 1 shared papers
- Juris Smotrovs (U of Latvia) 1 shared papers