An extension of Gleason's theorem for quantum computation

DOI10.1023/B:IJTP.0000048823.93080.7EMaRDI QIDQ1768737zbMATH OpenFDO

Authors Abbas Edalat

Publication date 15 March 2005

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0311070

zbMATH Keywords

Gleason's theoremhalting probleminterval expected valuequantum logicquantum programming language

Mathematics Subject Classification ID

Theory of programming languages (68N15) General and philosophical questions in quantum theory (81P05) Quantum computation (81P68)

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 sub-probability 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.

Recommendations

• Computer Science Logic
• Gleason's theorem is not constructively provable
• A note on many valued quantum computational logics
• A Gleason-type theorem for qubits based on mixtures of projective measurements
• scientific article; zbMATH DE number 3866255

Cited in

(4)

• Towards implementation of a generalized architecture for high-level quantum programming language
• scientific article; zbMATH DE number 2076191 (Why is no real title available?)
• scientific article; zbMATH DE number 2086395 (Why is no real title available?)
• scientific article; zbMATH DE number 5066359 (Why is no real title available?)

This page was built for publication: An extension of Gleason's theorem for quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768737)