Читать книгу Reversible and DNA Computing - Hafiz M. H. Babu - Страница 38

Example 1.10

Оглавление

Figure 1.7 shows the quantum representation of a reversible Fredkin (FRG) gate. The figure describes that there is only one NOT operation, four quantum CNOT operations, and three quantum controlled‐V (controlled‐) operations. So, the quantum gate calculation complexity of the reversible FRG gate is .

Reversible and DNA Computing

Подняться наверх