A Review Paper on Quantum Computing: A Paradigm Shift in Computer Architecture

Career Point International Journal of Research (CPIJR) ©2022 CPIJR ǀ Volume 3 ǀ Issue 4 ǀ ISSN: 2583-1895 July-September 2025 | DOI: https://doi.org/10.5281/zenodo.17364165 93 A Review Paper on Quantum Computing: A Paradigm Shift in Computer Architecture Mayank Madaan1, Ms. Tanvi Thakur2 1Student (BCA), School of Computer Application & Technology, Career Point University, Kota (Raj.), India 2Assistant Professor, School of Computer Application & Technology, Career Point University, Kota (Raj.), India Abstract Quantum Computing is rapidly emerging as a transformative paradigm in the field of computer architecture, with the potential to revolutionize industries such as cryptography, artificial intelligence, and scientific research. Unlike classical computing, which relies on binary bits, quantum computing utilizes qubits that leverage the principles of superposition and entanglement, enabling exponentially faster computation for certain complex problems. This review paper explores the foundational principles of quantum computing and contrasts them with traditional computing architectures. It examines the unique structure and functioning of quantum processors, the advantages they offer in solving real-world problems, and the key quantum algorithms like Shor’s and Grover’s that demonstrate their potential. The paper also discusses the current advancements by major technology companies and research institutions, along with challenges such as quantum decoherence, error correction, and hardware limitations. Furthermore, the paper analyzes practical applications in fields like cybersecurity, optimization, and machine learning, and highlights the future scope of this technology. By reviewing significant studies and developments, this paper aims to provide a comprehensive understanding of how quantum computing is redefining the future of computational power. Keywords: Quantum Computing, Qubits, Superposition, Quantum Entanglement, Quantum Algorithms, Quantum Architecture, Quantum Gates, Quantum Supremacy, Quantum Error Correction, Future Computing Technologies Introduction The rapid growth of technology and the increasing demand for solving highly complex problems have pushed the boundaries of traditional computing. While classical computers Career Point International Journal of Research (CPIJR) ©2022 CPIJR ǀ Volume 3 ǀ Issue 4 ǀ ISSN: 2583-1895 July-September 2025 | DOI: https://doi.org/10.5281/zenodo.17364165 94 have served us well in fields such as data processing, business applications, and scientific calculations, they are limited when it comes to problems that require enormous processing power, such as cryptography, large-scale optimization, and quantum simulations. The motivation behind this study is to highlight the revolutionary role of Quantum Computing in overcoming the limitations of classical computing. By utilizing the unique principles of quantum mechanics, such as superposition and entanglement, quantum computers offer exponential speed-ups in solving problems once thought to be computationally infeasible. As this technology progresses, it is crucial to understand how it works, its current applications, and the challenges that must be addressed to make it practical and scalable. Quantum computing represents a fundamental shift in how computers operate. Unlike classical computers that process bits in a binary state (0 or 1), quantum computers use qubits that can be in multiple states simultaneously. This capability enables quantum computers to perform massive parallel computations and solve certain types of problems much more efficiently than classical systems. In recent years, companies like IBM, Google, and Intel have made significant advancements in quantum hardware and software. Algorithms such as Shor’s Algorithm for factoring large numbers and Grover’s Algorithm for unstructured search showcase the computational power of quantum systems. However, despite its promise, quantum computing faces critical challenges including qubit instability, error correction, and high resource requirements. This review aims to provide an in-depth understanding of how quantum computing differs from classical computing, its potential use cases, and the current state of development in the field. Literature Survey Research on quantum computing has made significant progress, particularly in understanding its theoretical foundations and practical limitations. Early studies laid the groundwork by exploring the basic concepts of quantum mechanics and their application in computation. Pioneers like Richard Feynman and David Deutsch proposed that quantum systems could perform calculations beyond the capability of classical computers, leading to the concept of the universal quantum computer.Notable advancements include the development of Shor’s Algorithm (1994) for factoring large integers and Grover’s Algorithm (1996) for searching unsorted databases, both of which showcased the power of quantum computing over classical Career Point International Journal of Research (CPIJR) ©2022 CPIJR ǀ Volume 3 ǀ Issue 4 ǀ ISSN: 2583-1895 July-September 2025 | DOI: https://doi.org/10.5281/zenodo.17364165 95 methods. These algorithms demonstrated exponential and quadratic speed-ups, respectively, sparking interest in quantum cryptography and optimization.In the past decade, companies such as IBM, Google, and Intel have accelerated the development of quantum hardware. Google's Sycamore processor achieved a milestone in 2019 by demonstrating quantum supremacy, solving a problem in 200 seconds that would take classical supercomputers thousands of years. IBM Q and Intel’s Tangle Lake are also contributing to making quantum computing more accessible.Additionally, academic studies and technical whitepapers have addressed the practical challenges in implementing quantum systems, such as quantum decoherence, error correction, and qubit stability. Despite the progress, building scalable, fault-tolerant quantum systems remains a major research focus.Overall, while theoretical foundations are well-established, ongoing research continues to explore hardware innovation, noise reduction, and real-world applications in cybersecurity, artificial intelligence, and material science. 1. Existing Studies on Quantum Computing Foundations Many researchers have studied how quantum computing differs from classical computing and how it can solve problems that are too complex for traditional systems. Quantum computers use qubits, which can represent both 0 and 1 at the same time due to superposition, allowing them to process information in ways classical bits cannot. Some early scientists like Richard Feynman (1982) suggested that simulating quantum systems would require a quantum computer. Later, David Deutsch (1985) introduced the idea of a universal quantum computer that could run any quantum algorithm. These foundational works inspired further research into how quantum mechanics could be used for computation. Quantum computing research has grown to focus on many important areas:  Quantum Algorithms: Such as Shor’s Algorithm (1994) for factoring large numbers and Grover’s Algorithm (1996) for searching databases faster than classical methods.  Quantum Hardware: Companies like IBM, Google, and Intel have built quantum chips that use superconducting qubits.  Quantum Gates and Circuits: Unlike classical logic gates (AND, OR), quantum computers use gates like Hadamard, CNOT, and Pauli-X to manipulate qubits. Career Point International Journal of Research (CPIJR) ©2022 CPIJR ǀ Volume 3 ǀ Issue 4 ǀ ISSN: 2583-1895 July-September 2025 | DOI: https://doi.org/10.5281/zenodo.17364165 96  Quantum Supremacy: Google’s Sycamore chip claimed to achieve this in 2019 by solving a problem classical computers would take thousands of years to compute. Despite these advances, building useful quantum computers is still very challenging because:  Qubits are fragile and lose their quantum state quickly (decoherence).  Quantum systems are highly sensitive to noise and need error correction.  Quantum computers require extremely low temperatures to operate. Researchers are working on improving quantum hardware, creating better error correction techniques, and developing hybrid models that use both classical and quantum computing. However, making quantum computing stable, scalable, and practical for everyday use is still a work in progress. 2. Challenges in past work on Quantum Computing While quantum computing promises incredible computational power, it also comes with many complex challenges that researchers have been trying to overcome for years. These challenges are not only technical but also practical, making it difficult to implement and understand quantum systems compared to classical computers. Classical computers operate on clear, binary logic that is easy to follow. But quantum computers work using qubits that exist in multiple states due to superposition and are linked by entanglement. These properties are powerful but also make the behavior of quantum systems hard to predict and explain. Unlike traditional logic gates, quantum gates manipulate probabilities, which means outcomes can seem random unless properly interpreted. Key challenges highlighted in past research include:  Understanding Quantum Behavior: Quantum operations do not behave like regular computations; their outcomes depend on probabilities and interference patterns, which are difficult for most people to understand without a physics background.  Error Correction Complexity: Unlike classical systems, a single qubit error can disrupt the entire quantum calculation. Correcting these errors requires multiple physical qubits to represent one logical qubit, which greatly increases hardware demands. Career Point International Journal of Research (CPIJR) ©2022 CPIJR ǀ Volume 3 ǀ Issue 4 ǀ ISSN: 2583-1895 July-September 2025 | DOI: https://doi.org/10.5281/zenodo.17364165 97  Scalability Issues: While experimental systems with 10–100 qubits exist, running real-world applications may require thousands or even millions of qubits. No current system is close to that scale yet.  Lack of Educational Tools: There is a shortage of easy-to-use simulators or educational platforms that help non-experts explore how quantum computing works. To reduce these barriers, research institutions and companies are focusing on:  Developing quantum programming languages like Qiskit (IBM) and Cirq (Google).  Launching cloud-based quantum computers that allow users to test simple quantum algorithms remotely.  Creating visualization tools to help explain how quantum logic gates affect qubits and circuit outputs. Still, even with these tools, there is a long way to go before quantum computing becomes as transparent and accessible as classical systems. Making this field more understandable and less error-prone remains a top priority in current research. In conclusion, just like AI faced transparency issues due to complexity, quantum computing also struggles with interpretability, hardware limitations, and educational accessibility, but global efforts are actively addressing these concerns. Sources and Selection Criteria For this review paper, we collected and analyzed research articles published between 2018 and 2024. The papers were selected from reputable digital libraries and databases including IEEE Xplore, SpringerLink, ScienceDirect, and Google Scholar. Our focus was on studies that address the evolution and impact of quantum computing as a transformative paradigm in computer architecture. Research papers were carefully chosen based on the following criteria:  Relevance to quantum computing and its implications on computer architecture  Inclusion of theoretical frameworks, architectural designs, or experimental quantum hardware developments  Peer-reviewed journal articles or conference proceedings  Clear presentation of experimental results, simulations, or architectural proposals Career Point International Journal of Research (CPIJR) ©2022 CPIJR ǀ Volume 3 ǀ Issue 4 ǀ ISSN: 2583-1895 July-September 2025 | DOI: https://doi.org/10.5281/zenodo.17364165 98 Themes and Categories Compared To systematically organize our review and draw insightful conclusions, we grouped the papers into two main themes: THEME DESCRIPTION Quantum Hardware Advances Innovations in quantum processors, qubit technologies, and physical implementation Architectural Paradigms New models and frameworks redefining classical computer architecture using quantum principles Within these themes, we further categorized papers by: apped ions, photonic, etc.) -classical architectures) Summary Table of Papers Reviewed PAPER AUTHOR YEAR FOCUS AREA METHOD TYPE KEY CONTRIBUTION Arute et al. 2019 Quantum Supremacy Experimental Hardware Demonstrated the first quantum supremacy experiment with a 53-qubit processor. Preskill 2018 Quantum Computing Theory Theoretical Analysis Introduced the concept of Noisy IntermediateScale Quantum (NISQ) devices. Devitt et al. 2020 Quantum Error Correction Algorithmic Framework Proposed scalable error correction codes Career Point International Journal of Research (CPIJR) ©2022 CPIJR ǀ Volume 3 ǀ Issue 4 ǀ ISSN: 2583-1895 July-September 2025 | DOI: https://doi.org/10.5281/zenodo.17364165 99 for practical quantum computers. Kandala et al. 2019 Hybrid Architectures Experimental Demonstration Showcased variational quantum algorithms on hybrid quantumclassical systems. Monroe & Kim 2021 Trapped Ion Qubits Hardware Review Reviewed trapped-ion qubit technology and its advantages over other qubit types. Fowler et al. 2022 Fault-Tolerant Architectures Architectural Design Developed surface code based faulttolerant quantum architectures. Boixo et al. 2020 Quantum Algorithms Simulation and Testing Benchmarked quantum algorithms relevant to machine learning tasks. Muralidharan et al. 2023 Quantum Networking Protocol Design Proposed quantum network architectures for Career Point International Journal of Research (CPIJR) ©2022 CPIJR ǀ Volume 3 ǀ Issue 4 ǀ ISSN: 2583-1895 July-September 2025 | DOI: https://doi.org/10.5281/zenodo.17364165 100 scalable quantum computing. Quantum computing challenges Types and Causes of Challenges Quantum computing is a revolutionary technology, but it faces many technical, physical, and practical obstacles. These challenges must be solved before quantum computers can be widely used like classical computers. Types of Challenges:  Qubit Decoherence:Quantum bits (qubits) are very sensitive and can lose their quantum state due to interference from the environment. This results in calculation errors and data loss.  Quantum Error Correction:Traditional error correction methods don’t work on qubits. Quantum error correction requires many extra qubits and complex techniques, which increases system size and cost.  Hardware Instability:Building stable quantum systems is difficult. Most quantum computers must operate at extremely low temperatures (near absolute zero) to reduce noise.  Scalability:Today’s quantum computers can only manage tens or hundreds of qubits. To solve real-world problems, we need millions of stable qubits—which current technology can’t yet support.  Programming Complexity: Quantum programming languages and tools are still in early stages. Developers need to understand quantum mechanics, making it harder to build software for quantum systems. Causes of Challenges: Career Point International Journal of Research (CPIJR) ©2022 CPIJR ǀ Volume 3 ǀ Issue 4 ǀ ISSN: 2583-1895 July-September 2025 | DOI: https://doi.org/10.5281/zenodo.17364165 101  Fragile Nature of Qubits: Qubits can be affected by even small disturbances like heat or electromagnetic waves. This makes them hard to control and stabilize.  Lack of Mature Technology:Quantum computing is still a new field. Unlike classical computers, quantum hardware and software are not yet fully developed or standardized.  High Resource Requirements:Quantum systems need special conditions, such as vacuum chambers, cryogenic cooling, and complex control systems, which makes them expensive and difficult to maintain.  Limited Talent and Research:Only a small number of experts and institutions are working on quantum computing. More education and research support are needed globally. Case Studies of Challenges in Quantum Computing Case Study 1: Google’s Quantum Supremacy Claim (2019) In 2019, Google claimed it had achieved quantum supremacy by solving a problem in 200 seconds that would take a classical supercomputer 10,000 years. However, IBM challenged this claim, saying a classical system could solve the same task in just a few days. Case Study 2: IBM Q System Limitations IBM has built several quantum processors like the IBM Q System One, but these machines still work with fewer than 127 qubits and require extremely low temperatures (close to 0 Kelvin) to function. Case Study 3: D-Wave and Quantum Annealing D-Wave Systems developed quantum computers based on quantum annealing, which are good for optimization problems. However, their machines are not universal quantum computers and can't run all types of quantum algorithms. Quantum vs Classical Computing