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

Mathematical Foundations of Quantum Computing

Kolla Bhanu Prakash

Published Aug 17, 2026• 0 citations
Publisher
DOI
10.1002/9781394433933.ch2

Related papers

Theoretical Foundations of Quantum Computing

Elsevier eBooks•Aug 29, 2025•0 citations

Mathematical Foundations of Quantum Computing for Computer Science Researchers

Gérard Fleury, Philippe Lacomme

This paper provides a short introduction to the mathematical foundation of quantum computation for researchers in computer science by providing an introduction fo the mathematical basis of calculations. This paper concerns the mathematical foundations of quantum computation addressing first the representation of qubit using the Bloch sphere and second the special relations between SU(2) and SO(3). The properties of SU(2) are introduced focusing especially about the double-covering of SO(3) and explaining how to map rotations of SO(3) into matrices of SU(2). Quantum physic operators are based on SU(2) since we have a direct relationship to SO(3) namely one isomorphism. We start first from basic representations of qubit in R^3 and representations of operators in SU(2) and we next discuss with operators that permit to move from one SU(2) to another one according to a specific operator of SU(2) that is related to rotation into R^3.

arXiv:2303.01938•Mar 2, 2023•1 citation

Foundations on Quantum Computing

Masahito Hayashi, Satoshi Ishizaka, Akinori Kawachi +2 more

Graduate texts in physics•Aug 22, 2014•0 citations

Quantum Computation

Helmut Bez, Tony Croft

Quantum Computation presents the mathematics of quantum computation. The purpose is to introduce the topic of quantum computing to students in computer science, physics and mathematics who have no prior knowledge of this field. The book is written in two parts. The primary mathematical topics required for an initial understanding of quantum computation are dealt with in Part I: sets, functions, complex numbers and other relevant mathematical structures from linear and abstract algebra. Topics are illustrated with examples focussing on the quantum computational aspects which will follow in more detail in Part II. Part II discusses quantum information, quantum measurement and quantum algorithms. These topics provide foundations upon which more advanced topics may be approached with confidence. Features A more accessible approach than most competitor texts, which move into advanced, research-level topics too quickly for today's students. Part I is comprehensive in providing all necessary mathematical underpinning, particularly for those who need more opportunity to develop their mathematical competence. More confident students may move directly to Part II and dip back into Part I as a reference. Ideal for use as an introductory text for courses in quantum computing. Fully worked examples illustrate the application of mathematical techniques. Exercises throughout develop concepts and enhance understanding. End-of-chapter exercises offer more practice in developing a secure foundation.

Chapman & Hall/CRC eBooks•Jan 6, 2023•0 citations

Mathematics for Quantum Computing

Liao Heng, Bill McColl

Cambridge University Press eBooks•Dec 3, 2021•1 citation

Enhancing Feynman's Quantum Computational Positioning to Inject New Possibility into the Foundations of the Quantum Computing Industry

Pravir Malik

Due to his charisma. exceptional insight and logical capabilities Nobel Laureate Richard Feynman has had a decisive role in how the quantum computing industry has evolved. He equated nature's apparent probabilistic dynamics with the need for a different kind of probabilistic computer, beyond the classical digital computer, that could sufficiently imitate this, and worked out the initial mathematics of such a computer. This has been the genesis of the hardware and software development of today's entire quantum computing industry. Yet, by piercing behind Nature's probabilistic veil based on a light-based quantum computational model, it becomes possible to enhance Feynman's conceptualization and resulting mathematics to do with simulating time, space, and nature's unpredictability itself, to create a foundationally different quantum computer. This would result in reinterpreting foundational quantum equations such as Heisenberg's Uncertainty Principle, Schrodinger's Wave Equation, and Euler's Identity, to thereby conceptualize a fundamentally different type of quantum computation leading to an entirely different genre of emergent-type quantum computational devices. The very foundation of the entire quantum computing industry would be changed as a result.

IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)•Oct 12, 2022•2 citations
This paper provides a short introduction to the mathematical foundation of quantum computation for researchers in computer science by providing an introduction fo the mathematical basis of calculations. This paper concerns the mathematical foundations of quantum computation addressing first the representation of qubit using the Bloch sphere and second the special relations between SU(2) and SO(3). The properties of SU(2) are introduced focusing especially about the double-covering of SO(3) and explaining how to map rotations of SO(3) into matrices of SU(2). Quantum physic operators are based on SU(2) since we have a direct relationship to SO(3) namely one isomorphism. We start first from basic representations of qubit in R^3 and representations of operators in SU(2) and we next discuss with operators that permit to move from one SU(2) to another one according to a specific operator of SU(2) that is related to rotation into R^3.
Quantum Computation presents the mathematics of quantum computation. The purpose is to introduce the topic of quantum computing to students in computer science, physics and mathematics who have no prior knowledge of this field. The book is written in two parts. The primary mathematical topics required for an initial understanding of quantum computation are dealt with in Part I: sets, functions, complex numbers and other relevant mathematical structures from linear and abstract algebra. Topics are illustrated with examples focussing on the quantum computational aspects which will follow in more detail in Part II. Part II discusses quantum information, quantum measurement and quantum algorithms. These topics provide foundations upon which more advanced topics may be approached with confidence. Features A more accessible approach than most competitor texts, which move into advanced, research-level topics too quickly for today's students. Part I is comprehensive in providing all necessary mathematical underpinning, particularly for those who need more opportunity to develop their mathematical competence. More confident students may move directly to Part II and dip back into Part I as a reference. Ideal for use as an introductory text for courses in quantum computing. Fully worked examples illustrate the application of mathematical techniques. Exercises throughout develop concepts and enhance understanding. End-of-chapter exercises offer more practice in developing a secure foundation.
Due to his charisma. exceptional insight and logical capabilities Nobel Laureate Richard Feynman has had a decisive role in how the quantum computing industry has evolved. He equated nature's apparent probabilistic dynamics with the need for a different kind of probabilistic computer, beyond the classical digital computer, that could sufficiently imitate this, and worked out the initial mathematics of such a computer. This has been the genesis of the hardware and software development of today's entire quantum computing industry. Yet, by piercing behind Nature's probabilistic veil based on a light-based quantum computational model, it becomes possible to enhance Feynman's conceptualization and resulting mathematics to do with simulating time, space, and nature's unpredictability itself, to create a foundationally different quantum computer. This would result in reinterpreting foundational quantum equations such as Heisenberg's Uncertainty Principle, Schrodinger's Wave Equation, and Euler's Identity, to thereby conceptualize a fundamentally different type of quantum computation leading to an entirely different genre of emergent-type quantum computational devices. The very foundation of the entire quantum computing industry would be changed as a result.