We present an algorithm for compiling arbitrary unitaries into a sequence of gates native to a
quantum processor. As CNOT gates are error-prone for the foreseeable Noisy-Intermediate …

We present a topology aware quantum synthesis algorithm designed to produce short
circuits and to scale well in practice. The main contribution is a novel representation of …

While showing great promise, circuit synthesis techniques that combine numerical
optimization with search over circuit structures face scalability challenges due to a large …

We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale
well in practice. Our contributions are: 1) a novel representation of circuits able to encode …

We present an algorithm for compiling arbitrary unitaries into a sequence of gates native to a
quantum processor. As accurate CNOT gates are hard for the foreseeable Noisy …

Given an arbitrary 2 w× 2 w unitary matrix U, a powerful matrix decomposition can be
applied, leading to four different syntheses of aw-qubit quantum circuit performing the …

In this work, we propose Sum-Product-Transform Networks (SPTN), an extension of sum-
product networks that uses invertible transformations as additional internal nodes. The type …

A class of anyonic models for universal quantum computation based on weakly-integral
anyons has been recently proposed. While universal set of gates cannot be obtained in this …

Quantum information and quantum computation are emerging research areas based on the
properties of quantum resources, such as superposition and entanglement. In the quantum …

Algorithms to resolve multiple-qubit unitary transformations into a sequence of simple
operations on one-qubit subsystems are central to the methods of quantum-circuit …