67 citations · 203 across the 22 of their papers we have counts for
27 papers
Utilizing Resource Estimation for the Development of Quantum Computing Applications
Nils Quetschlich, Mathias Soeken, Prakash Murali +1
Quantum computing has made considerable progress in recent years in both software and hardware. But to unlock the power of quantum computers in solving problems that cannot be effi…
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…
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…
Determining the Multiplicative Complexity of Boolean Functions using SAT
Mathias Soeken
We present a constructive SAT-based algorithm to determine the multiplicative complexity of a Boolean function, i.e., the smallest number of AND gates in any logic network that con…
ROS: Resource-constrained Oracle Synthesis for Quantum Computers
Giulia Meuli, Mathias Soeken, Martin Roetteler +1
We present a completely automatic synthesis framework for oracle functions, a central part in many quantum algorithms. The proposed framework for resource-constrained oracle synthe…
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…
The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits
Giulia Meuli, Mathias Soeken, Earl Campbell +2
We present a constructive method to create quantum circuits that implement oracles for -variabl…
Reversible Pebbling Game for Quantum Memory Management
Giulia Meuli, Mathias Soeken, Martin Roetteler +2
Quantum memory management is becoming a pressing problem, especially given the recent research effort to develop new and more complex quantum algorithms. The only existing automati…
Using ZDDs in the Mapping of Quantum Circuits
Kaitlin Smith, Mathias Soeken, Bruno Schmitt +2
A critical step in quantum compilation is the transformation of a technology-independent quantum circuit into a technology-dependent form for a targeted device. In addition to mapp…
Quantum circuits for floating-point arithmetic
Thomas Häner, Mathias Soeken, Martin Roetteler +1
Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act o…
The EPFL Logic Synthesis Libraries
Mathias Soeken, Heinz Riener, Winston Haaswijk +8
We present a collection of modular open source C++ libraries for the development of logic synthesis applications. These libraries can be used to develop applications for the design…
Programming Quantum Computers Using Design Automation
Mathias Soeken, Thomas Häner, Martin Roetteler
Recent developments in quantum hardware indicate that systems featuring more than 50 physical qubits are within reach. At this scale, classical simulation will no longer be feasibl…
Logic Synthesis for Quantum Computing
Mathias Soeken, Martin Roetteler, Nathan Wiebe +1
We present a synthesis framework to map logic networks into quantum circuits for quantum computing. The synthesis framework is based on LUT networks (lookup-table networks), which…
Design Automation and Design Space Exploration for Quantum Computers
Mathias Soeken, Martin Roetteler, Nathan Wiebe +1
A major hurdle to the deployment of quantum linear systems algorithms and recent quantum simulation algorithms lies in the difficulty to find inexpensive reversible circuits for ar…
Translating between the roots of the identity in quantum computers
Wouter Castryck, Jeroen Demeyer, Alexis De Vos +2
The Clifford+ quantum computing gate library for single qubit gates can create all unitary matrices that are generated by the group . The matrix can be…
Self-Inverse Functions and Palindromic Circuits
Mathias Soeken, Michael Kirkedal Thomsen, Gerhard W. Dueck +1
We investigate the subclass of reversible functions that are self-inverse and relate them to reversible circuits that are equal to their reverse circuit, which are called palindrom…
Ancilla-free synthesis of large reversible functions using binary decision diagrams
Mathias Soeken, Laura Tague, Gerhard W. Dueck +1
The synthesis of reversible functions has been an intensively studied research area in the last decade. Since almost all proposed approaches rely on representations of exponential…