Abstract
The work includes the analyses of the theoretical capabilities of quantum-mechanical versus classical computer models in terms of their universality, their application domain, their efficacy in solving the problems and their technological feasibility. The concepts of deterministic Turing machine, probabilistic Turing machine and quantum-mechanical Turing machine are exposed. The concept of basic information unit of quantum-mechanical computer modelqubit is introduced and the qubit is represented through the use of Bloch sphere. The use of Dirac's bra-ket notation in description of quantum-mechanical state is explained, and the notation is used to form state equation of a quantummechanical Turing machine cell. Especially, consequences of quantum parallelism, quantum interference and wave function collapse are studied in respect to capabilities of quantum-mechanical computer models. The interrelationship between classes of problems that can be efficiently solved by quantum mechanical and/or classical computer models is displayed.
Publisher
Centre for Evaluation in Education and Science (CEON/CEES)
Reference28 articles.
1. Benenti G, Casati G, Strini G. Principles of quantum computation and information, World Scientific Publishing Co. Pte. Ltd. London, 2004.;
2. Kaye P. R, Laflamme R, Mosca M. An Introduction to Quantum Computing, Oxford University Press, New York, 2007.;
3. Tomašević M. V. Strukture podataka, Elektrotehnički fakultet Univerziteta u Beogradu, Beograd, 2000.;
4. Bernhardt C. Quantum computing for everyone, The MIT Press, Cambridge, Massachusetts, 2019.;
5. Turing A. On Computable Numbers with an Application to the Entscheidungsproblem, In Proceedings of the London Mathematical Society, Vol. 42, pp. 230-265, 1936.;
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Qubits, Quantum Bits, and Quantum Computing;Automated Secure Computing for Next‐Generation Systems;2023-11-16