research
∙
11/14/2022
Assessing requirements to scale to practical quantum advantage
While quantum computers promise to solve some scientifically and commerc...
share
research
∙
10/21/2022
A Q# Implementation of a Quantum Lookup Table for Quantum Arithmetic Functions
In this paper, we present Q# implementations for arbitrary single-variab...
research
∙
01/25/2022
The multiplicative complexity of interval checking
We determine the exact AND-gate cost of checking if a≤ x < b, where a an...
research
∙
06/06/2020
Lowering the T-depth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic Networks
The multiplicative depth of a logic network over the gate basis {, ⊕, } ...
research
∙
05/04/2020
Determining the Multiplicative Complexity of Boolean Functions using SAT
We present a constructive SAT-based algorithm to determine the multiplic...
research
∙
05/01/2020
ROS: Resource-constrained Oracle Synthesis for Quantum Computers
We present a completely automatic synthesis framework for oracle functio...
research
∙
03/18/2020
Automatic accuracy management of quantum programs via (near-)symbolic resource estimation
When compiling programs for fault-tolerant quantum computers, approximat...
research
∙
05/14/2018
