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 …

Optimizing quantum circuits is challenging due to the very large search space of functionally
equivalent circuits and the necessity of applying transformations that temporarily decrease …

Quantum computers promise dramatic advantages in processing speed over currently
available computer systems. Quantum computing offers great promise in a wide variety of …

We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our
approach, the problem is given by a ‍triple {P} C {Q} and the question is whether, given a set …

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 …

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

In order to characterize and benchmark computational hardware, software, and algorithms, it
is essential to have many problem instances on-hand. This is no less true for quantum …

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 …

Quantum state preparation, a crucial subroutine in quantum computing, involves generating
a target quantum state from initialized qubits. Arbitrary state preparation algorithms can be …

Quantum programs are written in high-level languages, whereas quantum hardware can
only execute low-level native gates. To run programs on quantum systems, each high-level …