most citedLowering the T-depth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic Networks

3 citations · 3 across the 1 of their papers we have counts for

collaborators

2 papers

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

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…