An Introduction to the mathematical formalization of quantum mechanics

Franco Strocchi

Franco Strocchi

Tilak Sinha

Martin Pieper

Emmanuel E. Haven, Andrei Yu. Khrennikov

Mathematical formalism of quantum mechanics: brief introduction In this chapter, we present basic notions of quantum mechanics, and we emphasize “quantum mathematics.” To posit that the mathematical formalism of quantum mechanics can be used outside of quantum physics (as in sociology, economics, or finance) may be of interest. If one can steer away from merely positing and veer instead into convincing the reader that such a position is tenable, then some achievement has been booked. But the price to pay is that the formalism of quantum mechanics needs to be uncovered: how else can one judge whether what we posit is senseful? Thus, a reader can either (i) formally accept our viewpoint about the quantum-like paradigm (see Khrennikov [1]), or (ii) ask for a detailed analysis of the quantum foundations which would justify this paradigm. In the first case, it may well be sufficient to skip this chapter (but we should suggest to attempt to include Chapter 3). In the second case, we invite especially those readers who are concerned about the fact that the formal usage of the mathematical formalism of quantum mechanics may transfer major problems of quantum foundations to social science, economics, and finance, to read the present chapter carefully.

Noson S. Yanofsky

Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction to some of the ideas in quantum computing. The paper begins by motivating the central ideas of quantum mechanics and quantum computation with simple toy models. From there we move on to a formal presentation of the small fraction of (finite dimensional) quantum mechanics that we will need for basic quantum computation. Central notions of quantum architecture (qubits and quantum gates) are described. The paper ends with a presentation of one of the simplest quantum algorithms: Deutsch's algorithm. Our presentation demands neither advanced mathematics nor advanced physics.