49 citations · 73 across the 8 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
quant-ph2020★ 3 cited
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…
quant-ph2020★ 10 cited
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…
quant-ph2020
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…