Quantum Computing and its Efficiency

Marco O. Lanzagorta, Jeffrey K. Uhlmann

Quantum computing (QC) has become an important area of research in computer science because of its potential to provide more efficient algorithmic solutions to certain problems than are possible with classical computing (CC). In particular, QC is able to exploit the special properties of quantum superposition to achieve computational parallelism beyond what can be achieved with parallel CC computers. However, these special properties are not applicable for general computation. Therefore, we propose the use of "hybrid quantum computers" (HQCs) that combine both classical and quantum computing architectures in order to leverage the benefits of both. We demonstrate how an HQC can exploit quantum search to support general database operations more efficiently than is possible with CC. Our solution is based on new quantum results that are of independent significance to the field of quantum computing. More specifically, we demonstrate that the most restrictive implications of the quantum No-Cloning Theorem can be avoided through the use of semiclones.

Mikio Nakahara

Andrea Pasin

Quantum Computing (QC) is an emerging research field that is attracting significant interest from the scientific community. In fact, it is believed that quantum computers can be employed to solve complex computational problems more efficiently than traditional computers, due to their inherent capabilities of exploring large search spaces very efficiently by leveraging the principles of quantum mechanics, such as superposition, entanglement, and tunnelling. However, quantum computers are still in their early stages of development and their applications are very limited, especially in the field of Information Access (IA). Nevertheless, IA systems often face complex optimization problems that might be solved more efficiently through the usage of quantum computers. This paper outlines the author's PhD objectives in designing new methodologies for the application and evaluation of QC technologies for IA problems. Furthermore, this work provides an overview of the achieved preliminary results and a discussion of possible future research directions.

Vaishali Bhatia, K. R. Ramkumar

Quantum Computing is a prominent word in this era as it allows computation to be performed in no time. The motive of using Quantum Computing (QC) is that even exponentially large number of problems can be solved using it which was earlier difficult with the classical computing. Conventional methods are based on usage of bits which consist of 0's and 1's while QC works with qubits. The main issue is that conventional computing has issue of storage as well as computation even when parallel computation is performed on it. Concept of quantum parallelism allows the computation to be performed in exponentially very low time as compared to conventional method. This paper will discuss about Quantum Computing Algorithms and how Shor's algorithm is able to break RSA algorithms is discussed. Entanglement and superposition of qubits helps fast computation. The demonstration of the applicability has been evaluated based on Computation time, storage capacity, accuracy, confidentiality, efficiency, integrity, and availability. Among various algorithms Shor's technique is able to break various encryption algorithm with more supremacy as compared to conventional computing methods. In nutshell, paper will discuss about various QC algorithms and will illustrate how shor's algorithm is able to crack RSA.