English

Computability in Basic Quantum Mechanics

Logic in Computer Science 2023-06-22 v8

Abstract

The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space H\mathcal{H}. In terms of the Hilbert lattice L\mathcal{L} of closed linear subspaces of H\mathcal{H} the notions of state and observable can be formulated as kinds of measures as in [21]. The aim of this paper is to show that there is a good notion of computability for these data structures in the sense of Weihrauch's Type Two Effectivity (TTE) [26]. Instead of explicitly exhibiting admissible representations for the data types under consideration we show that they do live within the category QCB0\mathbf{QCB}_0 which is equivalent to the category AdmRep\mathbf{AdmRep} of admissible representations and continuously realizable maps between them. For this purpose in case of observables we have to replace measures by valuations which allows us to prove an effective version of von Neumann's Spectral Theorem.

Keywords

Cite

@article{arxiv.1610.09209,
  title  = {Computability in Basic Quantum Mechanics},
  author = {Eike Neumann and Martin Pape and Thomas Streicher},
  journal= {arXiv preprint arXiv:1610.09209},
  year   = {2023}
}