Wiley eBooks
Quantum Circuits
Malek Benslama, Achour Benslama, Skander Aris
Abstract
Quantum circuits can be reversible in so far that the initial state can be determined from the final state. The reasoning always begins from the space of the states, which is a purely quantum space. The Toffoli gates are reversible and universal primitive functions, which mean that any reversible function can be constructed in terms of Toffoli gates. Any reversible circuit can be constructed from the Toffoli gate; it acts as NON gate with dual control. In quantum calculation, the quantum finite automaton or quantum state machine is the quantum analogue of the probabilistic automaton or Markov decision process. It is linked to the quantum computer in a similar way to the finite automaton, which is linked to the Turing machine. A quantum finite automaton can be understood as the quantization of finite sub-offsets or as a quantization of Markov chains.