In quantum computing the decoherence time of the qubits determines the computation time
available, and this time is very limited when using current hardware. In this article, we …

The synthesis of Boolean functions, as they are found in many quantum algorithms, is
usually conducted in two steps. First, the function is realized in terms of a reversible circuit …

Linear reversible circuits represent a subclass of reversible circuits with many applications in
quantum computing. These circuits can be efficiently simulated by classical computers and …

gates. We give an algorithm that is optimal up to a multiplicative constant, and Θ (log n)
times faster than previous methods. While our results are primarily asymptotic, simulation …

Quantum computing offers a promising alternative to conventional computation due to the
theoretical capacity to solve many important problems with exponentially less complexity …

While several physical realization schemes have been proposed for future quantum
information processing, most known facts suggest that quantum information processing …

Quantum computing has been attracting increasing attention in recent years because of the
rapid advancements that have been made in quantum algorithms and quantum system …

Before executing a quantum algorithm, one must first decompose the algorithm into machine-
level instructions compatible with the architecture of the quantum computer, a process …

In this paper we consider circuit synthesis for n-wire linear reversible circuits using the C-
NOT gate library. These circuits are an important class of reversible circuits with applications …

We present a quantum circuit representation consisting entirely of qubit initialisations (I), a
network of controlled-NOT gates (C) and measurements with respect to different bases (M) …