## An extension of gleason’s theorem for quantum computation

Venue: | International Journal of Theoretical Physics |

Citations: | 4 - 0 self |

### BibTeX

@ARTICLE{Edalat_anextension,

author = {Abbas Edalat},

title = {An extension of gleason’s theorem for quantum computation},

journal = {International Journal of Theoretical Physics},

year = {}

}

### OpenURL

### Abstract

We develop a synthesis of Turing’s paradigm of computation and von Neumann’s quantum logic to serve as a model for quantum computation with recursion, such that potentially non-terminating computation can take place, as in a quantum Turing machine. This model is based on the extension of von Neumann’s quantum logic to partial states, defined here as sub-probability measures on the Hilbert space, equipped with the natural pointwise partial ordering. The subprobability measures allow a certain probability for the non-termination of the computation. We then derive an extension of Gleason’s theorem and show that, for Hilbert spaces of dimension greater than two, the partial order of sub-probability measures is order isomorphic with the collection of partial density operators, i.e. trace class positive operators with trace between zero and one, equipped with the usual partial ordering induced from positive operators. We show that the expected value of a bounded observable with respect to a partial state can be defined as a closed bounded interval, which extends the classical definition of expected value. 1

### Citations

1167 |
On computable numbers, with an application to the entscheidungsproblem
- Turing
- 1937
(Show Context)
Citation Context ... 1936, Alan Turing proved that it is not decidable in general if a program terminates, i.e. one cannot in general determine, in a finite amount of time, if a given program terminates on a given input =-=[8, 9]-=-. This extremely important result in computer science has since been called “the halting problem”. It is a basic consequence of the halting problem that in probabilistic programs, when one computes th... |

457 | Domain theory
- Abramsky, Jung
- 1994
(Show Context)
Citation Context ...as a quantum event. Then S(H) is a non-distributive complete lattice with A ∧ B = A ∩ B and A ∨ B = span{A,B}, the subspace generated by A and B. A probability measure on S(H) is a mapping p : S(H) → =-=[0,1]-=- such that (i) p({0}) = 0, (ii) p(H) = 1, 3(iii) p( ∨ n≥0 An) = ∑ n≥0 p(An), for any sequence An of mutually orthogonal subspaces An. A state of the quantum logic or of quantum events is a probabilit... |

446 |
Mathematical Foundations of Quantum Mechanics
- Neumann
- 1932
(Show Context)
Citation Context ...be based on von Neumann’s formulation, which uses the notion of a state of quantum logic, a probability measure on the collection of quantum events, i.e., on the closed subspaces of the Hilbert space =-=[11, 10]-=-. An observable, discrete or continuous, is defined as a mapping from the Borel subsets of the real line to the collection of states of the quantum logic. These two notions are then used to derive the... |

156 |
Measures on the closed subspaces of a Hilbert space
- Gleason
- 1957
(Show Context)
Citation Context ...ubspace K ∈ S(H). The following celebrated theorem was assumed by von Neumann, then conjectured by Mackey and finally proved by Gleason. A more elementary proof was later provided in [2]. Theorem 3.1 =-=[3]-=- The map G is onto if the dimension of H is greater than two. □ In order to obtain an extension of Gleason’s theorem for partial states, we consider the notion of partial density operators. A positive... |

136 |
Semantics of probabilistic programs
- Kozen
- 1981
(Show Context)
Citation Context ...odel the probabilistic results: the total probabilities of the definite outcome add up to a number less than one, allowing a certain probability for the nontermination of the program; see for example =-=[4]-=-. In order to reconcile von Neumann’s quantum logic with the halting problem, we therefore consider sub-probability measures on quantum events, i.e. measures µ on the closed subspaces of the Hilbert s... |

14 | An Elementay Proof of Gleason’s Theorem - Cooke, M, et al. - 1984 |

2 | Functional Analysis, volume one of Methods of Modern Mathematical Physics - Redd, Simon - 1980 |

2 |
Toward a quantum programming language. Available from http://quasar.mathstat.uottawa.ca/~selinger/papers.html
- Selinger
- 2003
(Show Context)
Citation Context ...logic. All in all, this shows that partial density operators provide a convenient model for quantum computation with recursion. The partial order of partial density operators has already been used in =-=[6]-=- to develop a functional programming language for quantum computation. In a typical recursive computation, the partial density operator in each loop of iteration increases in the partial order and in ... |

2 | Quantum Mechanics of Atoms and Molecules, volume 3 of A - Thirring - 1979 |