The capabilities of quantum computers, such as the number of supported qubits and
maximum circuit depth, have grown exponentially in recent years. Commercially relevant …

Fueled by recent accomplishments in quantum computing hardware and software, an
increasing number of problems from various application domains are being explored as …

Quantum computing has attracted considerable public attention due to its exponential
speedup over classical computing. Despite its advantages, today's quantum computers …

Any potential application of quantum computing, once encoded as a quantum circuit, needs
to be compiled in order to be executed on a quantum computer. Deciding which qubit …

The use of quantum processing units (QPUs) promises speed-ups for solving computational
problems. Yet, current devices are limited by the number of qubits and suffer from significant …

In this paper we study the Clifford+ Toffoli universal fault-tolerant gate set. We introduce a
generating set in order to represent any unitary implementable by this gate set and with this …

In this paper we study the universal V-basis gate sets, which have also been shown to be
fault tolerant. Our methods and results can be applied to arbitrary dimensional basis gates …

Compiling a quantum circuit for specific quantum hardware is a challenging task. Moreover,
current quantum computers have severe hardware limitations. To make the most use of the …

Quantum computers can solve certain problems faster than classical computers. The
number of quantum computers offered via the cloud increases such that a variety is …

As quantum computing devices increase in size with respect to the number of qubits, two-
qubit interactions become more challenging, necessitating innovative and scalable qubit …