3
program roles
8
steering roles
2
organizing roles
1
leadership role
39
collaborators
2004–2023
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
11 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Quantum computing enhanced computational catalysis | QIP 2021 | regular | Guang Hao Low, Vera von Burg, Thomas Haner, Damian Steiger, Markus Reiher, Matthias Troyer |
Abstract The quantum computation of electronic energies can break the curse of dimensionality that plagues many-particle quantum mechanics. It is for this reason that a universal quantum computer has the potential to fundamentally change computational chemistry and materials science, areas in which strong electron correlations present severe hurdles for traditional electronic structure methods. Here, we present a state-of-the-art analysis of accurate energy measurements on a quantum computer for computational catalysis, using improved quantum algorithms with more than an order of magnitude improvement over the best previous algorithms. As a prototypical example of local catalytic chemical reactivity we consider the case of a ruthenium catalyst that can bind, activate, and transform carbon dioxide to the high-value chemical methanol. We aim at accurate resource estimates for the quantum computing steps required for assessing the electronic energy of key intermediates and transition states of its catalytic cycle. In particular, we present new quantum algorithms for double-factorized representations of the four-index integrals that can significantly reduce the computational cost over previous algorithms, and we discuss the challenges of increasing active space sizes to accurately deal with dynamical correlations. We address the requirements for future quantum hardware in order to make a universal quantum computer a successful and reliable tool for quantum computing enhanced computational materials science and chemistry, and identify open questions for further research. |
|||
| Improved reversible and quantum circuits for Karatsuba-based integer multiplication | TQC 2017 | regular | Alex Parent, Michele Mosca |
| A framework for qubit unitary synthesis | QIP 2016 | regular | ▸Vadym Kliuchnikov, Alex Bocharov, Jon Yard |
| Quantum Linear Network Coding as One-way Quantum Computation | TQC 2014 | regular | Niel de Beaudrap |
| On the Query Complexity of Perfect Gate Discrimination | TQC 2013 | regular | Giulio Chiribella, Giacomo Mauro D'Ariano |
| Easy and Hard Functions for the Boolean Hidden Shift Problem | TQC 2013 | regular | Andrew Childs, Robin Kothari, Maris Ozols |
|
Quantum rejection sampling ↗
|
QIP 2012 | regular | Jeremie Roland, Maris Ozols |
|
On the additive and multiplicative adversary methods ↗
|
QIP 2011 | regular | Loïck Magnin, Jeremie Roland |
|
Constructing quantum network coding schemes from classical nonlinear protocols ↗
|
QIP 2011 | regular | Hirotada Kobayashi, François Le Gall, Harumichi Nishimura |
| Quadratic Form Expansions for Unitaries | TQC 2008 | regular | Niel de Beaudrap, Vincent Danos, Elham Kashefi |
| Graph Isomorphism, the hidden subgroup problem and distinguishing quantum states | QIP 2006 | invited | Pranab Sen, Sean Hallgren |
11 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Fast-forwarding quantum walk-based Monte Carlo simulations | QIP 2023 | Mathys Rennela, Vivien Londe, Alain Sarlette, Matthias Troyer |
| Quantum resource estimates for computing elliptic curve discrete logarithms | QIP 2018 | Michael Naehrig, Krysta Marie Svore, Kristin Lauter |
| Reversible circuit compilation with space constraints | QIP 2016 | Alex Parent, Krysta Marie Svore |
| Improved bounded-strength decoupling schemes for local Hamiltonians | QIP 2016 | Adam Bookatz, Pawel Wocjan |
| Efficient synthesis of universal probabilistic quantum circuits | QIP 2015 | Alex Bocharov, Krysta Marie Svore |
| Multiregister quantum algorithms to compute convolutions and hidden shifts | QIP 2014 | Andrew Childs, Robin Kothari, Maris Ozols |
| Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity | QIP 2013 | Brittanney Amento, Rainer Steinwandt |
| A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits | QIP 2013 | Matthew Amy, Dmitri Maslov, Michele Mosca |
| Quantum algorithms for the hidden shift problem of Boolean functions | QIP 2011 | Maris Ozols, Jeremie Roland |
| Perfect Quantum Network Coding with Free Classical Communication | QIP 2010 | Hirotada Kobayashi, François Le Gall, Harumichi Nishimura |
| An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups | QIP 2009 | Hari Krovi |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| TQC 2019 | steering | member | — |
| TQC 2018 | steering | member | — |
| QIP 2017 | organizing | member | — |
| TQC 2017 | steering | member | — |
| TQC 2016 | steering | member | — |
| QIP 2015 | program | member | — |
| TQC 2015 | steering | member | — |
| TQC 2014 | steering | member | — |
| TQC 2013 | steering | member | — |
| TQC 2012 | steering | member | — |
| TQC 2011 | program | chair | — |
| TQC 2010 | program | member | — |
| QIP 2004 | organizing | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Maris Ozols | 4 |
| Jeremie Roland | 3 |
| Krysta Marie Svore | 3 |
| Alex Bocharov | 2 |
| Alex Parent | 2 |
| Andrew Childs | 2 |
| François Le Gall | 2 |
| Harumichi Nishimura | 2 |
| Hirotada Kobayashi | 2 |
| Matthias Troyer | 2 |
| Michele Mosca | 2 |
| Niel de Beaudrap | 2 |
| Robin Kothari | 2 |
| Adam Bookatz | 1 |
| Alain Sarlette | 1 |
| Brittanney Amento | 1 |
| Damian Steiger | 1 |
| Dmitri Maslov | 1 |
| Elham Kashefi | 1 |
| Giacomo Mauro D'Ariano | 1 |