67 citations · 99 across the 13 of their papers we have counts for
4 papers · 2 filters
Lowering the T-depth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic Networks
Thomas Häner, Mathias Soeken
The multiplicative depth of a logic network over the gate basis is the largest number of gates on any path from a primary input to a primary outpu…
Quantum Circuits for Functionally Controlled NOT Gates
Mathias Soeken, Martin Roetteler
We generalize quantum circuits for the Toffoli gate presented by Selinger and Jones for functionally controlled NOT gates, i.e., gates controlled by arbitrary -variable Bool…
Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation
Giulia Meuli, Mathias Soeken, Martin Roetteler +1
Approximation errors must be taken into account when compiling quantum programs into a low-level gate set. We present a methodology that tracks such errors automatically and then o…
Improved quantum circuits for elliptic curve discrete logarithms
Thomas Häner, Samuel Jaques, Michael Naehrig +2
We present improved quantum circuits for elliptic curve scalar multiplication, the most costly component in Shor's algorithm to compute discrete logarithms in elliptic curve groups…