Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Wiley eBooks

Quantum Computing

Arish Pitchai

Published Jul 11, 2022• 2 citations
Publisher

Abstract

Quantum computing is one of the fastest growing scientific field of this decade. Quantum computers are getting ready to solve computationally complex scientific problems in the fields of astronomy, medicine, genomics, weather prediction, etc. Super computers will soon be replaced with exponentially faster quantum computers. Many existing quantum algorithms have exhibited quadratic and exponential speed up over their classical counterparts. This chapter is designed to provide an introductory knowledge of the mathematical aspects needed to understand working of quantum computers. In particular, pure mathematical notions of single and composite qubits, quantum measurement, quantum gates and circuits are defined. A special section is dedicated to explaining the quantum phenomena: superposition and entanglement. Supremacy of quantum algorithms over their classical counterparts is illustrated with the help of Deutsch Algorithm.

DOI
10.1002/9781119813439.ch3

Related papers

Quantum Computing

Senthil Kumar Arumugam, Bukola Fatimah Balogun, Ajanthaa Lakkshmanan +1 more

The recently emerged field called quantum computing uses the ideas of quantum physics to execute computations substantially faster than they could be done on a conventional computer. This chapter provides a detailed discussion, highlighting its evolution, recent advancements, future opportunities, and challenges for future generations. Rapid advancements have been made in quantum computing, driven by breakthroughs in quantum algorithms, hardware technologies, and theoretical understanding. The essential components that constitute quantum computers, known as qubits, or quantum bits, can exist in superposition and entanglement states, enabling parallel computation and complex information processing. Also, recent advancements in quantum computing have demonstrated the feasibility of quantum algorithms for solving certain problems more efficiently than classical algorithms. Quantum supremacy experiments have showcased the ability of quantum computers to outperform classical systems in specific tasks. Additionally, efforts in developing scalable qubit architectures have advanced the practicality of quantum computers.

Auerbach Publications eBooks•Mar 3, 2025•2 citations

An Introductory Study to Quantum Programming

Ankur Biswas, Amartya Chakraborty, Stobak Dutta +2 more

Computational capabilities are reaching their limits with the current technology. Quantum computing is the answer to this limitation. It has unraveled new possibilities of solving the unsolvable and computationally hard problems within a feasible time frame. In this chapter, the authors have discussed the basics of quantum computing, which include the need for quantum computers and how it internally works without getting into too much mathematics for an introductory understanding. The authors have also discussed different technologies in which the scientific communities and industries are working to make these computers feasibly work and the different programming techniques and tools available to implement the algorithms in these computers and the testbeds available to common people for testing the feasibilities of their programs.

Advances in systems analysis, software engineering, and high performance computing book series•Jan 1, 2022•0 citations

Breaking Barriers: Unleashing the Power of Quantum Algorithms

Douha Jerbi

Quantum computing is a rapidly developing field with the potential to revolutionize our ability to solve certain computational problems . While classical computers operate using classical bits, quantum computers use quantum bits (qubits), which can exist in a superposition of states, allowing for parallel computations. The existence of quantum algorithms, which can solve certain problems exponentially faster than classical algorithms, is one of the most exciting aspects of quantum computing. These exotic algorithms are designed to take advantage of quantum mechanical properties such as entanglement and interference, and have the potential to transform a range of fields, including cryptography, optimization, and machine learning.

•Apr 29, 2023•0 citations

Breaking Barriers: Unleashing the Power of Quantum Algorithms

Douha Jerbi

Quantum computing is a rapidly developing field with the potential to revolutionize our ability to solve certain computational problems . While classical computers operate using classical bits, quantum computers use quantum bits (qubits), which can exist in a superposition of states, allowing for parallel computations. The existence of quantum algorithms, which can solve certain problems exponentially faster than classical algorithms, is one of the most exciting aspects of quantum computing. These exotic algorithms are designed to take advantage of quantum mechanical properties such as entanglement and interference, and have the potential to transform a range of fields, including cryptography, optimization, and machine learning.

•Apr 29, 2023•0 citations

INTRODUCTION QUANTUM COMPUTING

Mr. V. PAVAN KUMAR, Mr. V. SURYANARAYANA REDDY, Mr. THAMBI VINOD KUMAR +2 more

Quantum computing has emerged as one of the most transformative technological developments of the twenty-first century. By exploiting the fundamental principles of quantum mechanics—namely superposition, entanglement, and measurement—quantum computers offer the potential to address problems that are beyond the practical reach of classical computing systems. As the field advances from theoretical exploration to real-world implementation, the demand for clear, structured, and comprehensive educational resources continues to grow. This book presents a systematic and accessible introduction to quantum computing, beginning with the essential concepts of classical information and computation and progressively advancing toward modern quantum algorithms and communication protocols. The initial chapters establish a strong foundation in classical bits, logic gates, Boolean algebra, reversible logic, and computational complexity, providing the conceptual bridge necessary to understand quantum computation. The discussion then moves to the quantum bit (qubit), examining its behavior through superposition, measurement, Bloch sphere representation, and physical realization. Special emphasis is placed on linear algebra as the mathematical framework underpinning quantum computing. Through this approach, readers are guided to develop an intuitive yet rigorous understanding of quantum states, quantum gates, and circuit-based computation. The text further extends these ideas to multi-qubit systems, quantum entanglement, universal gate sets, and quantum error correction, integrating theoretical principles with practical insights. To support experiential learning, the book incorporates hands-on exposure to leading quantum programming platforms, including IBM Quantum, OpenQASM, and Qiskit. These sections connect theory with practice, enabling readers to design, simulate, and execute quantum circuits on both simulators and real quantum hardware. Subsequent chapters explore key quantum communication protocols such as superdense coding, quantum teleportation, and quantum key distribution, followed by an in-depth treatment of foundational quantum algorithms including Deutsch–Jozsa, Grover’s search, Simon’s algorithm, and Shor’s factoring algorithm. This text is intended for undergraduate and postgraduate students, research scholars, and industry professionals seeking a coherent and structured pathway into quantum computing. No prior knowledge of quantum mechanics is assumed, although familiarity with linear algebra and classical computation will enhance comprehension. Each chapter is carefully organized to promote conceptual clarity, supported by illustrative examples, circuit diagrams, and concise summaries. Beyond explaining the principles and mechanisms of quantum computation, this book aims to inspire readers to engage with the future of the field—whether through academic research, industrial application, or interdisciplinary innovation. As quantum technologies continue to evolve, it is hoped that this text will serve as a dependable guide and a meaningful entry point into the quantum era.

•Feb 12, 2026•0 citations

Quantum computation for solving linear systems

Yudong Cao

Quantum computation is a subject born out of the combination between physics and computer science. It studies how the laws of quantum mechanics can be exploited to perform computations much more efficiently than current computers (termed classical computers as oppose to quantum computers). The thesis starts by introducing ideas from quantum physics and theoretical computer science and based on these ideas, introducing the basic concepts in quantum computing. These introductory discussions are intended for non-specialists to obtain the essential knowledge needed for understanding the new results presented in the subsequent chapters. After introducing the basics of quantum computing, we focus on the recently proposed quantum algorithm for linear systems. The new results include i) special instances of quantum circuits that can be implemented using current experimental resources; ii) detailed quantum algorithms that are suitable for a broader class of linear systems. We show that for some particular problems the quantum algorithm is able to achieve exponential speedup over their classical counterparts.

•Jan 1, 2013•0 citations
Quantum computing is one of the fastest growing scientific field of this decade. Quantum computers are getting ready to solve computationally complex scientific problems in the fields of astronomy, medicine, genomics, weather prediction, etc. Super computers will soon be replaced with exponentially faster quantum computers. Many existing quantum algorithms have exhibited quadratic and exponential speed up over their classical counterparts. This chapter is designed to provide an introductory knowledge of the mathematical aspects needed to understand working of quantum computers. In particular, pure mathematical notions of single and composite qubits, quantum measurement, quantum gates and circuits are defined. A special section is dedicated to explaining the quantum phenomena: superposition and entanglement. Supremacy of quantum algorithms over their classical counterparts is illustrated with the help of Deutsch Algorithm.
The recently emerged field called quantum computing uses the ideas of quantum physics to execute computations substantially faster than they could be done on a conventional computer. This chapter provides a detailed discussion, highlighting its evolution, recent advancements, future opportunities, and challenges for future generations. Rapid advancements have been made in quantum computing, driven by breakthroughs in quantum algorithms, hardware technologies, and theoretical understanding. The essential components that constitute quantum computers, known as qubits, or quantum bits, can exist in superposition and entanglement states, enabling parallel computation and complex information processing. Also, recent advancements in quantum computing have demonstrated the feasibility of quantum algorithms for solving certain problems more efficiently than classical algorithms. Quantum supremacy experiments have showcased the ability of quantum computers to outperform classical systems in specific tasks. Additionally, efforts in developing scalable qubit architectures have advanced the practicality of quantum computers.
Computational capabilities are reaching their limits with the current technology. Quantum computing is the answer to this limitation. It has unraveled new possibilities of solving the unsolvable and computationally hard problems within a feasible time frame. In this chapter, the authors have discussed the basics of quantum computing, which include the need for quantum computers and how it internally works without getting into too much mathematics for an introductory understanding. The authors have also discussed different technologies in which the scientific communities and industries are working to make these computers feasibly work and the different programming techniques and tools available to implement the algorithms in these computers and the testbeds available to common people for testing the feasibilities of their programs.
Quantum computing is a rapidly developing field with the potential to revolutionize our ability to solve certain computational problems . While classical computers operate using classical bits, quantum computers use quantum bits (qubits), which can exist in a superposition of states, allowing for parallel computations. The existence of quantum algorithms, which can solve certain problems exponentially faster than classical algorithms, is one of the most exciting aspects of quantum computing. These exotic algorithms are designed to take advantage of quantum mechanical properties such as entanglement and interference, and have the potential to transform a range of fields, including cryptography, optimization, and machine learning.
Quantum computing is a rapidly developing field with the potential to revolutionize our ability to solve certain computational problems . While classical computers operate using classical bits, quantum computers use quantum bits (qubits), which can exist in a superposition of states, allowing for parallel computations. The existence of quantum algorithms, which can solve certain problems exponentially faster than classical algorithms, is one of the most exciting aspects of quantum computing. These exotic algorithms are designed to take advantage of quantum mechanical properties such as entanglement and interference, and have the potential to transform a range of fields, including cryptography, optimization, and machine learning.
Quantum computing has emerged as one of the most transformative technological developments of the twenty-first century. By exploiting the fundamental principles of quantum mechanics—namely superposition, entanglement, and measurement—quantum computers offer the potential to address problems that are beyond the practical reach of classical computing systems. As the field advances from theoretical exploration to real-world implementation, the demand for clear, structured, and comprehensive educational resources continues to grow. This book presents a systematic and accessible introduction to quantum computing, beginning with the essential concepts of classical information and computation and progressively advancing toward modern quantum algorithms and communication protocols. The initial chapters establish a strong foundation in classical bits, logic gates, Boolean algebra, reversible logic, and computational complexity, providing the conceptual bridge necessary to understand quantum computation. The discussion then moves to the quantum bit (qubit), examining its behavior through superposition, measurement, Bloch sphere representation, and physical realization. Special emphasis is placed on linear algebra as the mathematical framework underpinning quantum computing. Through this approach, readers are guided to develop an intuitive yet rigorous understanding of quantum states, quantum gates, and circuit-based computation. The text further extends these ideas to multi-qubit systems, quantum entanglement, universal gate sets, and quantum error correction, integrating theoretical principles with practical insights. To support experiential learning, the book incorporates hands-on exposure to leading quantum programming platforms, including IBM Quantum, OpenQASM, and Qiskit. These sections connect theory with practice, enabling readers to design, simulate, and execute quantum circuits on both simulators and real quantum hardware. Subsequent chapters explore key quantum communication protocols such as superdense coding, quantum teleportation, and quantum key distribution, followed by an in-depth treatment of foundational quantum algorithms including Deutsch–Jozsa, Grover’s search, Simon’s algorithm, and Shor’s factoring algorithm. This text is intended for undergraduate and postgraduate students, research scholars, and industry professionals seeking a coherent and structured pathway into quantum computing. No prior knowledge of quantum mechanics is assumed, although familiarity with linear algebra and classical computation will enhance comprehension. Each chapter is carefully organized to promote conceptual clarity, supported by illustrative examples, circuit diagrams, and concise summaries. Beyond explaining the principles and mechanisms of quantum computation, this book aims to inspire readers to engage with the future of the field—whether through academic research, industrial application, or interdisciplinary innovation. As quantum technologies continue to evolve, it is hoped that this text will serve as a dependable guide and a meaningful entry point into the quantum era.
Quantum computation is a subject born out of the combination between physics and computer science. It studies how the laws of quantum mechanics can be exploited to perform computations much more efficiently than current computers (termed classical computers as oppose to quantum computers). The thesis starts by introducing ideas from quantum physics and theoretical computer science and based on these ideas, introducing the basic concepts in quantum computing. These introductory discussions are intended for non-specialists to obtain the essential knowledge needed for understanding the new results presented in the subsequent chapters. After introducing the basics of quantum computing, we focus on the recently proposed quantum algorithm for linear systems. The new results include i) special instances of quantum circuits that can be implemented using current experimental resources; ii) detailed quantum algorithms that are suitable for a broader class of linear systems. We show that for some particular problems the quantum algorithm is able to achieve exponential speedup over their classical counterparts.