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

Springer eBooks

Mathematics of Quantum Computing: An Introduction

Wolfgang Scherer

Published Jan 1, 2019• 56 citations
Publisher
DOI
10.1007/978-3-030-12358-1

Related papers

The Theory of Quantum Computation: An Introduction

Tino Gramß

Wiley eBooks•May 14, 1998•2 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

Mathematics of Quantum Computing: Case Studies and Analysis

Soumyadip Sarkar

•Jan 1, 2026•0 citations

A Rosetta Stone for Quantum Mechanics with an Introduction to Quantum Computation

Samuel J. Lomonaco, Jr. .

The purpose of these lecture notes is to provide readers, who have some mathematical background but little or no exposure to quantum mechanics and quantum computation, with enough material to begin reading the research literature in quantum computation and quantum information theory. This paper is a written version of the first of eight one hour lectures given in the American Mathematical Society (AMS) Short Course on Quantum Computation held in conjunction with the Annual Meeting of the AMS in Washington, DC, USA in January 2000, and will appear in the AMS PSAPM volume entitled "Quantum Computation." Part 1 of the paper is an introduction the to the concept of the qubit. Part 2 gives an introduction to quantum mechanics covering such topics as Dirac notation, quantum measurement, Heisenberg uncertainty, Schrodinger's equation, density operators, partial trace, multipartite quantum systems, the Heisenberg versus the Schrodinger picture, quantum entanglement, EPR paradox, quantum entropy. Part 3 gives a brief introduction to quantum computation, covering such topics as elementary quantum computing devices, wiring diagrams, the no-cloning theorem, quantum teleportation, Shor's algorithm, Grover's algorithm. Many examples are given. A table of contents as well as an index are provided for readers who wish to "pick and choose." Since this paper is intended for a diverse audience, it is written in an informal style at varying levels of difficulty and sophistication from the very elementary to the more advanced.

arXiv:quant-ph/0007045•Jul 17, 2000•14 citations

Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium: American Mathematical Challenge Society, Short Course, January 17-18, 2000, Washington, DC

Samuel J. Lomonaco

An invitation to quantum computation: A Rosetta stone for quantum mechanics with an introduction to quantum computation by S. J. Lomonaco, Jr. Qubit devices by H. E. Brandt Quantum algorithms and quantum complexity theory: Introduction to quantum algorithms by P. W. Shor Shor's quantum factoring algorithm by S. J. Lomonaco, Jr. Grover's quantum search algorithm by S. J. Lomonaco, Jr. A survey of quantum complexity theory by U. V. Vazirani Quantum error correcting codes and quantum cryptography: An introduction to quantum error correction by D. Gottesman A talk on quantum cryptography or how Alice outwits Eve by S. J. Lomonaco, Jr. More mathematical connections: Topological quantum codes and anyons by A. Kitaev Quantum topology and quantum computing by L. H. Kauffman An entangled tale of quantum entanglement by S. J. Lomonaco, Jr. Index.

American Mathematical Society eBooks•Apr 1, 2002•9 citations

Mathematics for Quantum Computing

WORLD SCIENTIFIC eBooks•Sep 1, 2012•0 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.
The purpose of these lecture notes is to provide readers, who have some mathematical background but little or no exposure to quantum mechanics and quantum computation, with enough material to begin reading the research literature in quantum computation and quantum information theory. This paper is a written version of the first of eight one hour lectures given in the American Mathematical Society (AMS) Short Course on Quantum Computation held in conjunction with the Annual Meeting of the AMS in Washington, DC, USA in January 2000, and will appear in the AMS PSAPM volume entitled "Quantum Computation." Part 1 of the paper is an introduction the to the concept of the qubit. Part 2 gives an introduction to quantum mechanics covering such topics as Dirac notation, quantum measurement, Heisenberg uncertainty, Schrodinger's equation, density operators, partial trace, multipartite quantum systems, the Heisenberg versus the Schrodinger picture, quantum entanglement, EPR paradox, quantum entropy. Part 3 gives a brief introduction to quantum computation, covering such topics as elementary quantum computing devices, wiring diagrams, the no-cloning theorem, quantum teleportation, Shor's algorithm, Grover's algorithm. Many examples are given. A table of contents as well as an index are provided for readers who wish to "pick and choose." Since this paper is intended for a diverse audience, it is written in an informal style at varying levels of difficulty and sophistication from the very elementary to the more advanced.
An invitation to quantum computation: A Rosetta stone for quantum mechanics with an introduction to quantum computation by S. J. Lomonaco, Jr. Qubit devices by H. E. Brandt Quantum algorithms and quantum complexity theory: Introduction to quantum algorithms by P. W. Shor Shor's quantum factoring algorithm by S. J. Lomonaco, Jr. Grover's quantum search algorithm by S. J. Lomonaco, Jr. A survey of quantum complexity theory by U. V. Vazirani Quantum error correcting codes and quantum cryptography: An introduction to quantum error correction by D. Gottesman A talk on quantum cryptography or how Alice outwits Eve by S. J. Lomonaco, Jr. More mathematical connections: Topological quantum codes and anyons by A. Kitaev Quantum topology and quantum computing by L. H. Kauffman An entangled tale of quantum entanglement by S. J. Lomonaco, Jr. Index.