49 citations · 73 across the 8 of their papers we have counts for
10 papers
Parallel Tempering for Logic Synthesis
Thomas Häner, Damian S. Steiger, Helmut G. Katzgraber
The task of logic synthesis is to map a technology-independent representation of an application to hardware-specific operations, taking into account various constraints and trading…
The multiplicative complexity of interval checking
Thomas Häner, Mathias Soeken
We determine the exact AND-gate cost of checking if , where and are constant integers. Perhaps surprisingly, we find that the cost of interval checking never e…
Leveraging state sparsity for more efficient quantum simulations
Samuel Jaques, Thomas Häner
High-performance techniques to simulate quantum programs on classical hardware rely on exponentially large vectors to represent quantum states. When simulating quantum algorithms,…
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…
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…