Multiple-control Toffoli gates are basic building blocks for reversible and quantum circuits. 3-bit Peres gate can be considered as a pair of 3-bit and 2-bit Toffoli gates, which can be implemented with fewer elementary quantum gates (what defines a metric called quantum cost) than the total number of elementary quantum gates required by each of Toffoli gates implemented separately. Due to this property, Peres gates are often used for quantum cost reduction of reversible circuits. This paper introduces a generalization of the Peres gate with n > 2 control signals. For such generalized gates corresponding quantum circuits are presented. The realizations have quantum cost of n2and require no ancillary signals. The proposed designs are built from elementary quantum gates, which consist of NOT, controlled NOT, controlled `square-roots-of-NOT' (known as controlled V/V+gates) and controlled `higher roots-of-NOT' (up to 2n-1-roots-of-NOT). The obtained quantum circuits are not entangled. The proposed designs are used to construct Toffoli gates of n control signals with quantum cost of 2n2- 2n + 1 and using no ancillary signals. This is an improvement in comparison with 2n+1- 3 and 48n2+ O(n), which are quantum costs of the known designs of the multiple-control Toffoli gate without ancillary signals.
CALA-
n: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts
We introduce a new quantum layout-aware approach to realize cost-effective
n-bit gates using the Bloch sphere, for
2≤n≤5 qubits. These
n-bit gates are entirely constructed from the Clifford+T gates, in the approach of selecting sequences of rotations visualized on the Bloch sphere. This Bloch sphere approach ensures to match the quantum layout for synthesizing (transpiling) these
n-bit gates into an IBM quantum computer. Various standard
n-bit gates (Toffoli, Fredkin, etc.) and their operational equivalent of our proposed
n-bit gates are examined and evaluated, in the context of the final quantum costs, as the final counts of generated IBM native gates. In this paper, we demonstrate that all our
n-bit gates always have lower quantum costs than those of standard
n-bit gates after transpilation. Hence, our Bloch sphere approach can be used to build a quantum library of various cost-effective
n-bit gates for different layouts of IBM quantum computers.