24
talks
16
committee roles
3
leadership roles
2001–2026
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree | QIP 2024 | regular ▸ presenter | Aleksandrs Belovs |
| An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree | QIP 2024 | plenary_short ▸ presenter | Aleksandrs Belovs |
| A note about claw function with a small range | TQC 2021 | regular | Kaspars Balodis, Jānis Iraids |
| Quadratic speedup for finding marked vertices by quantum walks | QIP 2020 | regular | Andras Gilyen, Stacey Jeffery, Mārtiņš Kokainis |
| Quantum algorithms for computational geometry problems | TQC 2020 | regular | Nikita Larka |
| Quantum Speedups for Exponential-Time Dynamic Programming Algorithms | QIP 2019 | regular ▸ presenter | Kaspars Balodis, Jānis Iraids, Mārtiņš Kokainis, Krišjānis Prūsis, Jevgēnijs Vihrovs |
| Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games | QIP 2018 | regular ▸ presenter | Mārtiņš Kokainis |
| Separations in Query Complexity Based on Pointer Functions | QIP 2016 | plenary ▸ presenter | Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Juris Smotrovs, Miklos Santha |
| Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing | QIP 2016 | regular ▸ presenter | Aleksandrs Belovs, Oded Regev, Ronald de Wolf |
| Forrelation: A Problem that Optimally Separates Quantum from Classical Computing | QIP 2016 | regular | ▸Scott Aaronson |
| biggest possible advantage quantum algorithms | TQC 2016 | invited ▸ presenter | — |
| Quantum Attacks on Classical Proof Systems – The Hardness of Quantum Rewinding | QCRYPT 2014 | regular | Ansis Rosmanis, ▸Dominique Unruh |
| Provable Advantage for Quantum Strategies in Random Symmetric XOR Games | TQC 2013 | regular | Jānis Iraids |
| Exact Quantum Query Complexity of EXACT and THRESHOLD | TQC 2013 | regular | Jānis Iraids, Juris Smotrovs |
| Quantum algorithms are at most polynomially faster than classical for any symmetric function | QIP 2009 | regular ▸ presenter | — |
| An O(N^{1/2+o(1)}) time algorithm for evaluating Boolean formulas on a quantum computer | QIP 2008 | invited ▸ presenter | — |
| Quantum search with variable times | QIP 2007 | regular | — |
| Approximate quantum (t, t)-designs and derandomizing the measurement in a random basis | QIP 2007 | regular | — |
| A new quantum lower bound method, with applications to strong direct product theorems | QIP 2006 | invited | Robert Spalek, Ronald de Wolf |
| Quantum walk algorithms: element distinctness and spatial search | QIP 2004 | invited | — |
| Quantum Random Walks | QIP 2002 | invited | — |
| Private Quantum Channels and Quantum Authentication | QIP 2001 | invited | Alain Tapp, Claude Crepeau, Daniel Gottesman, Michele Mosca, Ronald de Wolf |
| A New Protocol and Lower Bounds for Quantum Coin Flipping | QIP 2001 | invited | — |
| Do Quantum Drunks Walk Faster? | QIP 2001 | invited | Dorit Aharonov, Julia Kempe, Umesh Vazirani |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QIP 2026 | SC | member | — |
| QIP 2026 | Local | member | — |
| TQC 2024 | SC | member | — |
| TQC 2023 | SC | member | — |
| TQC 2022 | SC | member | — |
| TQC 2021 | SC | member | — |
| TQC 2021 | Local | chair | Chair |
| QIP 2020 | SC | member | — |
| TQC 2020 | SC | member | — |
| TQC 2020 | Local | chair | Chair |
| QIP 2019 | SC | member | — |
| QIP 2018 | SC | member | — |
| QIP 2017 | PC | chair | — |
| QIP 2014 | PC | member | — |
| QIP 2011 | PC | member | — |
| QIP 2008 | PC | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Aleksandrs Belovs | 4 |
| Jānis Iraids | 4 |
| Kaspars Balodis | 3 |
| Mārtiņš Kokainis | 3 |
| Ronald de Wolf | 3 |
| Juris Smotrovs | 2 |
| Alain Tapp | 1 |
| Andras Gilyen | 1 |
| Ansis Rosmanis | 1 |
| Claude Crepeau | 1 |
| Daniel Gottesman | 1 |
| Dominique Unruh | 1 |
| Dorit Aharonov | 1 |
| Jevgēnijs Vihrovs | 1 |
| Julia Kempe | 1 |
| Krišjānis Prūsis | 1 |
| Michele Mosca | 1 |
| Miklos Santha | 1 |
| Nikita Larka | 1 |
| Oded Regev | 1 |