Shaktikanta Nayak, Sitakanta Nayak, J.P.Singh
Quantum computation exploits the inherent parallelism due to the principle of superposition of quantum states and hence it has the potential to increase the solution speed for many computational problems. In recent years Grover’s search algorithm, Sore’s factorization algorithm and Deutsch’s algorithm have proven to solve some of the problems exponentially faster than their classical counter parts. The study of financial market is highly sensitive, uncertain and complex in nature. However the traditional classical computers have limited computational capacity with respect to complexity of the problem. In this paper a possible application of Deutsch’s algorithm for market price prediction has been discussed.
English 
Spanish 
Russian 
German 
French 
Japanese 
Portuguese 
Hindi