67 citations · 203 across the 22 of their papers we have counts for
6 papers · 1 filter
Automatic oracle generation in Microsoft's Quantum Development Kit using QIR and LLVM passes
Mathias Soeken, Mariia Mykhailova
Automatic oracle generation techniques can find optimized quantum circuits for classical components in quantum algorithms. However, most implementations of oracle generation techni…
Assessing requirements to scale to practical quantum advantage
Michael E. Beverland, Prakash Murali, Matthias Troyer +7
While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require…
Space-time optimized table lookup
Thomas Häner, Vadym Kliuchnikov, Martin Roetteler +1
We describe a space-time optimized circuit for the table lookup subroutine from lattice-surgery surface code primitives respecting 2D grid connectivity. Table lookup circuits are u…
A Q# Implementation of a Quantum Lookup Table for Quantum Arithmetic Functions
Rajiv Krishnakumar, Mathias Soeken, Martin Roetteler +1
In this paper, we present Q# implementations for arbitrary single-variabled fixed-point arithmetic operations for a gate-based quantum computer based on lookup tables (LUTs). In ge…
QParallel: Explicit Parallelism for Programming Quantum Computers
Thomas Häner, Vadym Kliuchnikov, Martin Roetteler +2
We present a language extension for parallel quantum programming to (1) remove ambiguities concerning parallelism in current quantum programming languages and (2) facilitate space-…
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…