Publications de Giulia Meuli | EPFL Graph Search

Xor-And-Inverter Graphs for Quantum Compilation

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

Quantum compilation is the task of translating a high-level description of a quantum algorithm into a sequence of low-level quantum operations. We propose and motivate the use of Xor-And-Inverter Graphs (XAG) to specify Boolean functions for quantum compil ...

2022

From Boolean functions to quantum circuits: A scalable quantum compilation flow in C++

Giovanni De Micheli, Giulia Meuli, Bruno Schmitt Antunes, Heinz Riener, Fereshte Mozafari Ghoraba

We propose a flow for automated quantum compila- tion. Our flow takes a Boolean function implemented in Python as input and translates it into a format appropriate for reversible logic synthesis. We focus on two quantum compilation tasks: uniform state pre ...

2021

Boolean satisfiability in quantum compilation

Giovanni De Micheli, Giulia Meuli, Mathias Soeken, Bruno Schmitt Antunes, Heinz Riener, Fereshte Mozafari Ghoraba

Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program a ...

ROYAL SOC2020

Program compilation for large-scale quantum computers

Giulia Meuli

Practical realizations of quantum computers are poised to deliver outstanding computational capabilities far beyond the reach of any classical supercomputer. While classical systems are reliably implemented using CMOS technology, the fabrication of quantu ...

EPFL2020

Enumerating Optimal Quantum Circuits using Spectral Classification

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

This work targets fault-tolerant quantum computing and focuses on the problem of mapping reversible circuits into the Clifford+T quantum gate library. We present an automatically-generated database containing minimal-cost quantum circuits for Boolean funct ...

IEEE2020

Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation

Giulia Meuli, Mathias Soeken

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 optimizes accuracy parameters to guarantee a specified overall accuracy while ...

ASSOC COMPUTING MACHINERY2020

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

We present a constructive method to create quantum circuits that implement oracles vertical bar x vertical bar y |0 (k) -> vertical bar x vertical bar y circle plus f(x)vertical bar 0 (k) for n-variable Boolean functions f with low T-count. In our method f ...

IEEE2019

Reversible Pebbling Game for Quantum Memory Management

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

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 automatic method for quantum states clean-up relies on the availability of many extr ...

IEEE2019

Resource constrained oracle synthesis for quantum circuits

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

2019

ROS : Resource Constrained Oracle Synthesis for Quantum Computers

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

We present a complete automatic synthesis framework for oracle functions—a central part in many quantum algorithms. The proposed framework for resource-constrained oracle synthesis (ROS) is an LUT-based hierarchical method where every step is specifically ...

2019

Evaluating ESOP Optimization Methods in Quantum Compilation Flows

Giovanni De Micheli, Giulia Meuli, Bruno Schmitt Antunes, Heinz Riener

Springer2019

SAT-based {CNOT, T} Quantum Circuit Synthesis

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

The prospective of practical quantum computers has lead researchers to investigate automatic tools to program them. A quantum program is modeled as a Clifford+T quantum circuit that needs to be optimized in order to comply with quantum technology constrain ...

2018

A Best-Fit Mapping Algorithm to Facilitate ESOP-Decomposition in Clifford+T Quantum Network Synthesis

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

Currently, there is a large research interest and a significant economical effort to build the first practical quantum computer. Such quantum computers promise to exceed the capabilities of conventional computers in fields such as computational chemistry, ...

IEEE2018

A Compiler for Parallel and Resource-Constrained Programmable in-Memory Computing

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Giulia Meuli, Mathias Soeken

Solid-state resistive switches have recently enabled low-power, scalable, non-volatile memories. Their proven intrinsic logic operation, allowing design of in-memory computing systems, attracted the attention of the research community. A Programmable Logic ...

2017