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

Oxford University Press eBooks

Mathematical tools

Riccardo Manenti, Mário Motta

Published Aug 25, 2023• 0 citations
Publisher

Abstract

Abstract In this chapter, we introduce some mathematical tools used throughout the rest of the textbook, to provide readers from different backgrounds with a good understanding of our notation and terminology. These mathematical tools include the binary system, Boolean functions, and sets of logic gates universal for classical computation. We then introduce the notion of a decision problem, a mathematical problem whose solution is either yes or no and discuss how a computation solves it by exploiting two physical resources: time and space. We conclude by presenting several examples of decision problems, including satisfiability, MAXCUT, traveling salesman, and the hidden subgroup problem

DOI
10.1093/oso/9780198787488.003.0001

Related papers

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

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 Mechanics: A Simplified Approach

Shabnam Siddiqui

Quantum mechanics is one of the most challenging subjects to learn. It is challenging because quantum phenomenon is counterintuitive, and the mathematics used to explain such a phenomenon is very abstract, and difficult to grasp. This textbook is an attempt to overcome these challenges. Every chapter presents quantum ideas step- by- step in a structured way with a comparison between quantum and classical concepts. It provides a clear distinction between classical and quantum logic. Conceptual questions are provided after every important section so that the reader can test their understanding at every step. Such an approach aids in preventing misconceptions. Problem solving is not restricted to solving differential equations and integration. But it requires to systematically and creatively analyze a problem, to apply the new and powerful concepts for finding a solution and to understand the physical meaning of the solution. The tutorials on special topics are an effort to teach problem solving by actively engaging the reader in a thinking process, to apply the concepts and to understand the physical meaning of the solution. The simulations are provided for some of the topics. The simulations aid in the visualization of the quantum phenomenon, and for meaningful understanding of the mathematics. This approach may lead to development of "quantum mechanical intuition "as well as learning mathematical techniques for problem solving. Most importantly, the book is not flooded with numerous topics that makes the reader confused and distracted, rather the most important topics are discussed at a deeper level. The understanding of quantum mechanics is incomplete without understanding the early ideas and experiments that lead to the development of the quantum theory. Thus, the first two chapters of the book are dedicated to such topics. The key features of this book are: A simplified, structured, and step-by-step introduction to quantum mechanics. The simplification is attained through use of two-level system, step- by- step discussion of important topics in a simplified language at a deeper level, analogies, and visualization using illustrations and simulations A systematic arrangement of topics, and numerous worked- out examples. The presentation of the structure in the mathematical formalism of quantum mechanics provides clarity in understanding complicated and abstract mathematics. It also helps to understand the distinction between the quantum mechanical and classical approaches Conceptual questions at the end of every important section. The conceptual questions can be used in a classroom as a point of discussion between an instructor and students Tutorials on special topics. Simulations on special topics aid in the visualization of the physical phenomenon, and demonstration of the application of mathematics An in-depth discussion of the wave-particle duality, measurement problem, and their philosophical implications in Chapter 2 provides an understanding of the broader meaning of quantum mechanics

CRC Press eBooks•Oct 10, 2018•1 citation

Quantum computers

Ovidiu Cristinel Stoica

If you progressed up to this point, it should be easy for you to make the quantum leap. Several steps we've already made prepared the ground to discuss Quantum Computing. In previous chapters, we introduced the representation of bits as vectors in a vector space, and we generalized from two to a continuum of possible values, introducing concepts and notations that will ease our understanding. Now we will see what a quantum system is, then what a quantum computer is. We will see that quantum computations admit greater relativity of computation and have greater ambiguity than classical computations.

CRC Press eBooks•Apr 28, 2026•0 citations

Postulates of quantum physics

Michel Le Bellac

In this chapter we shall present the basic postulates of quantum physics, generalizing the results obtained in the preceding chapter for the two special cases of photon polarization and spin 1/2. In general, the space of states will a priori have any dimension N, which may even be infinite, rather than only two dimensions. The postulates which we present in this chapter fix the general conceptual framework of quantum mechanics and do not directly provide the tools necessary for solving specific problems. The solution of a specific physical problem always involves a modeling stage, where the system to be studied is simplified, the approximations to be used are defined, and so on, and this modeling stage inevitably rests on more or less heuristic arguments which cannot be derived within the general framework of quantum physics. In Section 3.2.5 we gave an example of a heuristic procedure leading to the solution of a specific problem, that of the motion of a spin 1/2 in a magnetic field. Other sets of postulates can be used. For example, another approach is to state the postulates of quantum mechanics in terms of path integrals. As is often the case, the same physical theory can be dressed in various different mathematical clothes. Finally, it should be emphasized that the postulates of quantum physics give rise to some difficult epistemological problems which are still largely under debate and which we do not discuss in this book. The interested reader may consult, for example, the book by Isham [1995].

Cambridge University Press eBooks•Mar 23, 2006•0 citations

Computation

Jochen Rau

This chapter introduces the basic building blocks of quantum computing and a variety of specific algorithms. It begins with a brief review of classical computing and discusses how its key elements – bits, gates, circuits – carry over to the quantum realm. It highlights crucial differences to the classical case, such as the impossibility of copying a qubit. The quantum circuit model is shown to be universal, and a peculiar variant of quantum computing, based on measurements only, is illustrated. That a quantum computer can perform some calculations more efficiently than a classical computer, at least in principle, is exemplified with the Deutsch-Jozsa algorithm. Other examples covered in this chapter are the variational quantum eigensolver, which can be applied to the study of molecules and classical optimization problems; quantum simulation; and entanglement-assisted metrology.

Oxford University Press eBooks•May 27, 2021•0 citations
Abstract In this chapter, we introduce some mathematical tools used throughout the rest of the textbook, to provide readers from different backgrounds with a good understanding of our notation and terminology. These mathematical tools include the binary system, Boolean functions, and sets of logic gates universal for classical computation. We then introduce the notion of a decision problem, a mathematical problem whose solution is either yes or no and discuss how a computation solves it by exploiting two physical resources: time and space. We conclude by presenting several examples of decision problems, including satisfiability, MAXCUT, traveling salesman, and the hidden subgroup problem
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 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 mechanics is one of the most challenging subjects to learn. It is challenging because quantum phenomenon is counterintuitive, and the mathematics used to explain such a phenomenon is very abstract, and difficult to grasp. This textbook is an attempt to overcome these challenges. Every chapter presents quantum ideas step- by- step in a structured way with a comparison between quantum and classical concepts. It provides a clear distinction between classical and quantum logic. Conceptual questions are provided after every important section so that the reader can test their understanding at every step. Such an approach aids in preventing misconceptions. Problem solving is not restricted to solving differential equations and integration. But it requires to systematically and creatively analyze a problem, to apply the new and powerful concepts for finding a solution and to understand the physical meaning of the solution. The tutorials on special topics are an effort to teach problem solving by actively engaging the reader in a thinking process, to apply the concepts and to understand the physical meaning of the solution. The simulations are provided for some of the topics. The simulations aid in the visualization of the quantum phenomenon, and for meaningful understanding of the mathematics. This approach may lead to development of "quantum mechanical intuition "as well as learning mathematical techniques for problem solving. Most importantly, the book is not flooded with numerous topics that makes the reader confused and distracted, rather the most important topics are discussed at a deeper level. The understanding of quantum mechanics is incomplete without understanding the early ideas and experiments that lead to the development of the quantum theory. Thus, the first two chapters of the book are dedicated to such topics. The key features of this book are: A simplified, structured, and step-by-step introduction to quantum mechanics. The simplification is attained through use of two-level system, step- by- step discussion of important topics in a simplified language at a deeper level, analogies, and visualization using illustrations and simulations A systematic arrangement of topics, and numerous worked- out examples. The presentation of the structure in the mathematical formalism of quantum mechanics provides clarity in understanding complicated and abstract mathematics. It also helps to understand the distinction between the quantum mechanical and classical approaches Conceptual questions at the end of every important section. The conceptual questions can be used in a classroom as a point of discussion between an instructor and students Tutorials on special topics. Simulations on special topics aid in the visualization of the physical phenomenon, and demonstration of the application of mathematics An in-depth discussion of the wave-particle duality, measurement problem, and their philosophical implications in Chapter 2 provides an understanding of the broader meaning of quantum mechanics
If you progressed up to this point, it should be easy for you to make the quantum leap. Several steps we've already made prepared the ground to discuss Quantum Computing. In previous chapters, we introduced the representation of bits as vectors in a vector space, and we generalized from two to a continuum of possible values, introducing concepts and notations that will ease our understanding. Now we will see what a quantum system is, then what a quantum computer is. We will see that quantum computations admit greater relativity of computation and have greater ambiguity than classical computations.
In this chapter we shall present the basic postulates of quantum physics, generalizing the results obtained in the preceding chapter for the two special cases of photon polarization and spin 1/2. In general, the space of states will a priori have any dimension N, which may even be infinite, rather than only two dimensions. The postulates which we present in this chapter fix the general conceptual framework of quantum mechanics and do not directly provide the tools necessary for solving specific problems. The solution of a specific physical problem always involves a modeling stage, where the system to be studied is simplified, the approximations to be used are defined, and so on, and this modeling stage inevitably rests on more or less heuristic arguments which cannot be derived within the general framework of quantum physics. In Section 3.2.5 we gave an example of a heuristic procedure leading to the solution of a specific problem, that of the motion of a spin 1/2 in a magnetic field. Other sets of postulates can be used. For example, another approach is to state the postulates of quantum mechanics in terms of path integrals. As is often the case, the same physical theory can be dressed in various different mathematical clothes. Finally, it should be emphasized that the postulates of quantum physics give rise to some difficult epistemological problems which are still largely under debate and which we do not discuss in this book. The interested reader may consult, for example, the book by Isham [1995].
This chapter introduces the basic building blocks of quantum computing and a variety of specific algorithms. It begins with a brief review of classical computing and discusses how its key elements – bits, gates, circuits – carry over to the quantum realm. It highlights crucial differences to the classical case, such as the impossibility of copying a qubit. The quantum circuit model is shown to be universal, and a peculiar variant of quantum computing, based on measurements only, is illustrated. That a quantum computer can perform some calculations more efficiently than a classical computer, at least in principle, is exemplified with the Deutsch-Jozsa algorithm. Other examples covered in this chapter are the variational quantum eigensolver, which can be applied to the study of molecules and classical optimization problems; quantum simulation; and entanglement-assisted metrology.