The successful implementation of algorithms on quantum processors relies on the accurate
control of quantum bits (qubits) to perform logic gate operations. In this era of noisy …

Quantum computing is regarded as a promising paradigm that may overcome the current
computational power bottlenecks in the post-Moore era. The increasing maturity of quantum …

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 …

Simulating quantum systems is one of the most important potential applications of quantum
computers. The high-level circuit defining the simulation needs to be compiled into one that …

Near-term quantum computing (QC) systems have limited qubit counts, high gate
(instruction) error rates, and typically support a minimal instruction set having one type of two …

In this work, we report on a novel quantum gate approximation algorithm based on the
application of parametric two-qubit gates in the synthesis process. The utilization of these …

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

To implement quantum algorithms on quantum computers it is crucial to decompose their
operators into the limited gate set supported by those computers. Unfortunately, existing …

In the Noisy Intermediate Scale Quantum (NISQ) era, finding implementations of quantum
algorithms that mini-mize the number of expensive and error prone multi-qubit gates is vital …

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 …