Publication

Enumerating Optimal Quantum Circuits using Spectral Classification

Publications associées (31)

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

Three-Input Gates for Logic Synthesis

Giovanni De Micheli, Eleonora Testa, Mathias Soeken, Dewmini Sudara Marakkalage, Heinz Riener

Most logic synthesis algorithms work on graph representations of logic functions with nodes associated with arbitrary logic expressions or simple logic functions and iteratively optimize such graphs. While recent multilevel logic synthesis efforts focused ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

A Majority Lemma for Randomised Query Complexity

Gilbert Théodore Maystre, Mika Tapani Göös

We show that computing the majority of n copies of a boolean function g has randomised query complexity R(Maj∘gⁿ) = Θ(n⋅R ̅_{1/n}(g)). In fact, we show that to obtain a similar result for any composed function f∘gⁿ, it suffices to prove a sufficiently stro ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

Logic Resynthesis of Majority-Based Circuits by Top-Down Decomposition

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

Logic resynthesis is the problem of finding a dependency function to re-express a given Boolean function in terms of a given set of divisor functions. In this paper, we study logic resynthesis of majority-based circuits, which is motivated by the increasin ...

IEEE2021

Universal Quantum Computing Using Electronuclear Wavefunctions of Rare-Earth Ions

Gabriel Aeppli

We propose a scheme for universal quantum computing based on Kramers rare-earth ions. Their nuclear spins in the presence of a Zeeman-split electronic crystal field ground state act as "passive" qubits that store quantum information. The "active" qubits ar ...

AMER PHYSICAL SOC2021

Scaling silicon-based quantum computing using CMOS technology

Edoardo Charbon

As quantum processors grow in complexity, attention is moving to the scaling prospects of the entire quantum computing system, including the classical support hardware. Recent results in high-fidelity control of individual spins in silicon, combined with d ...

NATURE PORTFOLIO2021

Learning from survey propagation: a neural network for MAX-E-3-SAT

Raffaele Marino

Many natural optimization problems are NP-hard, which implies that they are probably hard to solve exactly in the worst-case. However, it suffices to get reasonably good solutions for all (or even most) instances in practice. This paper presents a new algo ...

IOP PUBLISHING LTD2021

Cryogenic CMOS Integrated Circuits for Scalable Readout of Silicon Quantum Computers

Andrea Ruffino

Quantum computing promises to revolutionize our lives, achieving unprecedented computational powers and unlocking new possibilities in drug discovery, chemical simulations and cryptography. The fundamental unit of computation of a quantum computer is the q ...

EPFL2021

Microwave-to-Optical Transduction with Gallium Phosphide Electro-Optomechanical Devices

Simon Benjamin Klaus Hönl

Quantum computing is one of the great scientific challenges of the 21st century. Small-scale systems today promise to surpass classical computers in the coming years and to enable the solution of classically intractable computational tasks in the fields of ...

EPFL2021

Classical variational simulation of the Quantum Approximate Optimization Algorithm

Giuseppe Carleo

A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating quantum systems is ...

2021

Advanced Functional Decomposition Using Majority and Its Applications

Giovanni De Micheli, Mathias Soeken, Zhufei Chu

Typical operators for the decomposition of Boolean functions in state-of-the-art algorithms are AND, exclusive-OR (XOR), and the 2-to-1 multiplexer (MUX). We propose a logic decomposition algorithm that uses the majority-of-three (MAJ) operation. Such a de ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020