Bruno Schmitt Antunes

This person is no longer with EPFL

About
Privacy
Disclaimer

Graph Chatbot

Related publications (12)

Practical Compilation of Quantum Programs

Bruno Schmitt Antunes

It's been a little more than 40 years since researchers first suggested exploiting quantum physics to build more powerful computers. During this time, we have seen the development of many quantum algorithms and significant technological advances to make th ...

EPFL2022

tweedledum: A Compiler Companion for Quantum Computing

Giovanni De Micheli, Bruno Schmitt Antunes

This work presents tweedledum-an extensible open-source library aiming at narrowing the gap between high-level algorithms and physical devices by enhancing the expressive power of existing frameworks. For example, it allows designers to insert classical lo ...

IEEE2022

Optimizing Quantum Circuit Synthesis for Permutations Using Recursion

Bruno Schmitt Antunes

We describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic with a nonscalabl ...

ASSOC COMPUTING MACHINERY2022

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

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

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

Compilation flow for classically defined quantum operations

Giovanni De Micheli, Bruno Schmitt Antunes

We present a flow for synthesizing quantum operations that are defined by classical combinational functions. The discussion will focus on out-of-place computation, i.e., U-f : vertical bar x >vertical bar y >vertical bar 0 >(k) -> vertical bar x >vertical ...

IEEE2021

Boolean satisfiability in quantum compilation

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

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

Symbolic Algorithms for Token Swapping

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

We study different symbolic algorithms to solve two related reconfiguration problems on graphs: the token swapping problem and the permutation routing via matchings problem. Input to both problems is a connected graph with labeled vertices and a token in e ...

2020

Using ZDDs in the mapping of quantum circuits

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes, Kaitlin Nicole Smith

2019

Compiling Permutations for Superconducting QPUs

Giovanni De Micheli, Mathias Soeken, Fereshte Mozafari Ghoraba, Bruno Schmitt Antunes

In this paper we consider the compilation of quantum state permutations into quantum gates for physical quantum computers. A sequence of generic single-target gates, which realize the input permutation, are extracted using a decomposition based reversible ...

IEEE2019

Scaling-up ESOP Synthesis for Quantum Compilation

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

Today's rapid advances in quantum computing hardware call for scalable synthesis methods to map combinational logic represented as multi-level Boolean networks (e.g., an and inverter graph, AIG) to quantum circuits. Such synthesis process must yield revers ...

IEEE2019

Page 1 of 2