Evolutionary algorithm based synthesis of multi-output ternary functions using quantum cascades

Abstract

Quantum Computers, which run according to to the laws of quantum mechanics, are said to be the future of today's computers. They might have exponentially more computational efficiency than any classical one. The fact that a quantum particle can be in between many states, known as entanglement of states, made Quantum Computer so powerful. Inspired by the challenge' of formulating Quantum Computer, this thesis presents the synthesis of multi-output ternary quantum logic with primitive quantum gates. The main emphasis oftliesis is given on showing that any logie can be realized using quantum primitive gates. It is also implied that these quantum circuits are reversible by nature. At the same time multiple-valued logic helps to reduce the complexity ofthe circuit when compared to binary logic. This thesis presents a comprehensive study on the fundamentals of Quantum Computations. Then a family of quantum primitive gates is proposed. These arc very simple 2-input, 2-output ternary reversible gates. These gates can be physically realized using quantum technology. Then an Evolutionary Algorithm based synthesis procedure using those primitive gates is proposed. It lias been shown that a Quantum Computer capable of executing any logic function is possible to construct using thc new gates only. The claim is supported by the experimental findings. The effect of different EA parameters on the solution is . also examined and shown. Finally some open problems for the physicists and mathematicians are brought forward.