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

1.11 Quantum Gate Calculation Complexity

Оглавление

The quantum gate calculation complexity of the quantum representation of a reversible circuit specifies the total number of quantum gates (NOT gates, CNOT gates, and controlled‐V (controlled‐) gates) used in the quantum representation of a reversible circuit. Consequently, the quantum gate calculation complexity can be determined using the following equation:

(1.11.1)

where

  = Quantum gate calculation complexity

  = A quantum NOT gate

  = A quantum CNOT gate

  = A quantum controlled‐V (controlled‐) gate


Figure 1.6 Block diagram of the reversible FRG gate.


Figure 1.7 Quantum representation of a reversible FRG gate.

Reversible and DNA Computing

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