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

1.17.1 Reversible NOT Gate (Feynman Gate) Example 1.13

Оглавление

A 2 2 Feynman gate is also called CNOT. This gate is one through because it passes one of its inputs. Every linear reversible function can be built by using only 2 2 Feynman gates and inverters. Since this is a 2 2 gate, the quantum cost is 1. Quantum equivalent circuit of the Feynman gate is shown in Figure 1.9.

Reversible and DNA Computing

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