Explaining Basic Aspects of Quantum Computation Based on Functional Approach

ABSTRACT The aim of this paper is to obtain an inter-pretation of foundations of the quantum compu-tation under the light of the level of functionalabstraction [1] and supported by its mathemat-ical basis. This approach seems more accessi-ble to programmers and increases the study andinterest in quantum programming. The neces-sity for secret message exchange and the possi-bility of reading secret information have devel-oped cryptographic methods. The security ofcurrent methods is based on hard computationalproblems enabling a good safety level. However,if there is a marked growth in computationalpower, leaks in the safety system of the crypto-graphic methods could occur. Due to this fact,alternative methods have been studied, whichmay, in the near future, replace existing tech-niques, providing safer systems independently ofthe exponential growth of the available powercomputations. In the modern algorithms [2], thesecret of the message is found in its key, whichis used as a parameter in the coding and de-coding of the message. The longer the key is,the more difficult it will be to break it. In thesymmetric algorithms, also known as the pri-vate key, the same key is used in the coding aswell as in the decoding. So, it needs to arrangea key previously. Taking into account that inmany applications such as commercial and bank-ing transactions through the internet, the use ofthis key is not practical. This work implementsan asymmetric algorithm or public key. Fol-lowing the methodology suggested by Sabry[3],