6 citations · 6 across the 4 of their papers we have counts for
8 papers
Irredundant Buffer and Splitter Insertion and Scheduling-Based Optimization for AQFP Circuits
Siang-Yun Lee, Heinz Riener, Giovanni De Micheli
The adiabatic quantum-flux parametron (AQFP) is a promising energy-efficient superconducting technology. Before technology mapping, additional buffer and splitter cells need to be…
Simulation-Guided Boolean Resubstitution
Siang-Yun Lee, Heinz Riener, Alan Mishchenko +2
This paper proposes a new logic optimization paradigm based on circuit simulation, which reduces the need for Boolean computations such as SAT-solving or constructing BDDs. The pap…
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…
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…
Exact Synthesis of ESOP Forms
Heinz Riener, Rüdiger Ehlers, Bruno Schmitt +1
We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach fin…