IEEE Congress on Evolutionary Computation (CEC)

Quantum computing for beginners

A. Narayanan

Published Jan 20, 2003• 66 citations

Abstract

The paper introduces the basic concepts and principles behind quantum computing and examines in detail Shor's (1994) quantum algorithm for factoring very large numbers. Some basic methodological principles and guidelines for constructing quantum algorithms are stated. The aim is not to provide a formal exposition of quantum computing but to identify its novelty and potential use in tackling NP-hard problems.

DOI: 10.1109/cec.1999.785552

Related papers

An introductory tutorial to quantum computing

A. Narayanan

This article discusses the basic principles and concepts behind quantum computing and examines Shor's quantum factoring algorithm in detail. It is clear that the work described by Shor represents a significant advance in one's knowledge of how to program quantum computational networks, if and when they exist. There is disagreement on whether quantum computers can ever be built, because of their susceptibility to noise caused by thermal vibrations and construction faults.

Jan 1, 199713 citations

A brief review on Quantum Computing and the Shor's Factoring Algorithm

L. Martina, Giulio Soliani

Quantum Information and Quantum Computation are rapidly evolving domains in their theoretical foundations, implementations and applications. The main scope of the present book is to give the basic ideas of this field to undergraduate students in Physics. A rigorous approach is used to provide the key concepts and methods. Many examples are discussed. To be self-contained, the principles of Quantum Mechanics are reviewed. The discussion is aimed to the specific, but paradigmatic, factorization problem of integers, dealt by the Quantum Shor’s Algorithm. Thus, notions of the Number Theory are given in the first Chapter, while the exposition of the algorithm and its implementation is reserved to the last Section.

Jan 1, 20060 citations

Factorization by the Quantum Algorithm

Qing Wang

This paper studies the factorization in classical computation,the concept and properties of quantum computing and quantum computers.The authors focus on the theoretical principles of the Shor quantum Algorithm to show the obvious advantages and the great potential of this method.

Journal of Information Engineering UniversityJan 1, 20030 citations

QUANTUM ALGORITHMS: UNLEASHING THE POWER OF QUANTUM COMPUTING

Assistant Professor, Poddar Management, Technical Campus, Jaipur, Mr. Shashikant Sharma, Dr. Sanjeev Solanki +2 more

Quantum computing, based on the fundamental principles of quantum mechanics, has become a breakthrough that has the potential to revolutionize computing. At the forefront of this quantum revolution are quantum algorithms that use the origin of qubits to solve computational problems much faster than classical algorithms. This article provides a review of quantum algorithms to introduce their principles, examine famous examples such as the Grover and Shor algorithms, and delve into their applications, including quantum machine learning. Exploring the fundamentals of quantum computing begins with an overview that highlights the unique features of quantum computing compared to classical computing. We then examine several different algorithmic paradigms to highlight the unique advantages that quantum parallelism and interference bring to computing. The best knowledge of quantum algorithms focuses on Grover's blind search, Shor's efficient factorization algorithm, and the quantum phase approach for solving quantum chemistry and eigenvalue problems. As well as celebrating the achievements of quantum algorithms, this research also looks at the challenges and limitations that hinder their widespread use. Topics such as decoherence, error correction, and finding errors in quantum computing are discussed in the context of overcoming obstacles to the use of practical quantum algorithms. In addition, the latest developments are clarified by showing the successes of the experiments and their implications for the future. As we stand at the forefront of a new era in computing, this article not only provides a snapshot of the current state of quantum algorithms but also speculates on future directions. The potential applications of quantum algorithms in many fields and the ongoing quest to overcome current limitations offer exciting opportunities for further research. This research aims to contribute to the ongoing debate about quantum algorithms, gaining a deeper understanding of their impact on the future of computing.

Oorja- International Journal of Management and ITJan 1, 20030 citations

Quantum Computing: Circuits, Algorithms, and Applications

Muhammad Ali Shafique, Arslan Munir, Imran Latif

Quantum computing, a transformative field that emerged from quantum mechanics and computer science, has gained immense attention for its potential to revolutionize computation. This paper aims to address the fundamentals of quantum computing and provide a comprehensive guide for both novices and experts in the field of quantum computing. Beginning with the foundational principles of quantum computing, we introduce readers to the fundamental concepts of qubits, superposition, entanglement, interference, and noise. We explore quantum hardware, quantum gates, and basic quantum circuits. This study offers insight into the current phase of quantum computing, including the noisy intermediate-scale quantum (NISQ) era and its potential for solving real-world problems. Furthermore, we discuss the development of quantum algorithms and their applications, with a focus on famous algorithms like Shor’s algorithm and Grover’s algorithm. We also touch upon quantum computing’s impact on various industries, such as cryptography, optimization, machine learning, and material science. By the end of this paper, readers will have a solid understanding of quantum computing’s principles, applications, and the steps involved in developing quantum circuits. Our goal is to provide a valuable resource for those eager to embark on their quantum computing journey and for researchers looking to stay updated on this rapidly evolving field.

IEEE AccessJan 1, 202497 citations

EXPLAINING THE BASICS OF QUANTUM MECHANICS FOR COMPUTING

Sanjay Tiwari, Neeraj Bhat, Varun Sharma +1 more

Quantum computers operate on the principles of quantum logic, a fundamentally distinct paradigm from classical Boolean logic. This disparity leads to quantum computation's enhanced efficiency compared to classical computing. In this comprehensive review, we demystify the fundamental concepts of quantum computation, covering the creation of elementary gates and networks. We highlight the capabilities of quantum algorithms by examining the simple Deutsch problem and, in straightforward terms, dissect the renowned Shor algorithm for factoring large numbers into primes. Furthermore, we delve into the realm of physical quantum computer implementations, with a particular focus on tlo he linear ion trap approach. Here, we shed light on the primary challenge hindering the realization of practical quantum computers: the issue of decoherence. Nonetheless, we demonstrate that this hurdle can be overcome through the application of quantum error correction methods

International Journal of Psychosocial RehabilitationApr 1, 20200 citations