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

Essentials

Mathematical formulation

Martin Pieper

Published Jan 1, 2021• 2 citations
Publisher
DOI
10.1007/978-3-658-32645-6_3

Related papers

Mathematical Formulation of Our Theory

Satoru Yamamoto

Springer eBooks•Jan 1, 2023•0 citations

Linear algebra and quantum algorithm

BongJu Kim

In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations of quantum mechanics had been established in around 1930, by von Neumann. The formulation uses functional analysis, linear algebra and probability theory. The knowledge of the mathematical formulation of QM is enough quantum mechanical knowledge for approaching to quantum algorithm and it might be efficient way for mathematicians that starting with mathematical formulations of QM. We explain the mathematical formulations of quantum mechanics briefly, quantum bits, quantum gates, quantum discrete Fourier transformation, Deutsch's algorithm and Shor's algorithm.

arXiv:2008.08905•Aug 14, 2020•0 citations

The Algebraic Formulation

Valter Moretti

Springer eBooks•Jan 1, 2019•4 citations

Certain intriguing physical, mathematical and logical aspects concerning quantization

Andrés J. Kálnay

Different level sources of possible inconsistencies of Quantum Physics are studied. The point of view is defended that inconsistencies may arise due to improper philosophical foundations of Quantum Physics but that there is a way out to each of the up to now suggested purely mathematical inconsistencies of each of the main mathematical formulations of Quantum mechanics. An example is worked out explicitly. The point of view is also supported that even if the above statement may be correct, i.e., that no purely mathematical inconsistencies exist in each of the main mathematical formulations, it is highly worthwhile to study alternatives as those offered by the Lie-Admissible Formulations of Quantum Mechanics.

Hadronic J.; (United States)•Apr 1, 1981•3 citations

Mathematical Supplement

Walter Greiner

Springer eBooks•Jan 1, 2001•0 citations

Mathematical Supplement

Walter Greiner

Springer eBooks•Jan 1, 1989•1 citation
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations of quantum mechanics had been established in around 1930, by von Neumann. The formulation uses functional analysis, linear algebra and probability theory. The knowledge of the mathematical formulation of QM is enough quantum mechanical knowledge for approaching to quantum algorithm and it might be efficient way for mathematicians that starting with mathematical formulations of QM. We explain the mathematical formulations of quantum mechanics briefly, quantum bits, quantum gates, quantum discrete Fourier transformation, Deutsch's algorithm and Shor's algorithm.
Different level sources of possible inconsistencies of Quantum Physics are studied. The point of view is defended that inconsistencies may arise due to improper philosophical foundations of Quantum Physics but that there is a way out to each of the up to now suggested purely mathematical inconsistencies of each of the main mathematical formulations of Quantum mechanics. An example is worked out explicitly. The point of view is also supported that even if the above statement may be correct, i.e., that no purely mathematical inconsistencies exist in each of the main mathematical formulations, it is highly worthwhile to study alternatives as those offered by the Lie-Admissible Formulations of Quantum Mechanics.