The general problem of quantum compiling is to approximate any unitary transformation that
describes the quantum computation as a sequence of elements selected from a finite base …

Noise mitigation and reduction will be crucial for obtaining useful answers from near-term
quantum computers. In this work, we present a general framework based on machine …

We present QUEST, a procedure to systematically generate approximations for quantum
circuits to reduce their CNOT gate count. Our approach employs circuit partitioning for …

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 …

Quantum computing is an emerging technology that has the potential to revolutionize fields
such as cryptography, machine learning, optimization, and quantum simulation. However, a …

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 …

Parameterized circuit instantiation is a common technique encountered in the generation of
circuits for a large class of hybrid quantum-classical algorithms. Despite being supported by …

Quantum compiling fills the gap between the computing layer of high-level quantum
algorithms and the layer of physical qubits with their specific properties and constraints …

We describe Superstaq, a quantum software platform that optimizes the execution of
quantum programs by tailoring to underlying hardware primitives. For benchmarks such as …

Near-term quantum computers are expected to work in an environment where each
operation is noisy, with no error correction. Therefore, quantum-circuit optimizers are applied …