Journal article 598 views 26 downloads
Computability in Basic Quantum Mechanics
Logical Methods in Computer Science, Volume: 14, Issue: 2
Swansea University Author: Eike Neumann
-
PDF | Version of Record
Copyright: E. Neumann, M. Pape, and T. Streicher. This work is licensed under the Creative Commons Attribution License. To view a copy of this license
Download (433.89KB)
DOI (Published version): 10.23638/LMCS-14(2:14)2018
Abstract
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space H. In terms of the Hilbert lattice L of closed linear subspaces of 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...
| Published in: | Logical Methods in Computer Science |
|---|---|
| ISSN: | 1860-5974 |
| Published: |
2018
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa60139 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space H. In terms of the Hilbert lattice L of closed linear subspaces of 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 which is equivalent to the category 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. |
|---|---|
| College: |
Faculty of Science and Engineering |
| Issue: |
2 |