In this paper we study an improved semantics of some basic elements in quantum computation, which can be helpful to build quantum compiler and quantum operating system.
ISBN:
(纸本)9780819490780
In this paper we study an improved semantics of some basic elements in quantum computation, which can be helpful to build quantum compiler and quantum operating system.
After giving a bird's view of some existing quantum programming languages,this paper reports the recent results made by the quantum computation group of the State Key Laboratory for Novel Software Technology and t...
详细信息
After giving a bird's view of some existing quantum programming languages,this paper reports the recent results made by the quantum computation group of the State Key Laboratory for Novel Software Technology and the Department of Computer Science and Technology at Nanjing University,i.e.,the quantum programming languages NDQJava,NDQFP and their processing systems.
We apply the notion of quantum predicate proposed by D'Hondt and Panangaden to analyze a simple language fragment which may describe the quantum part of a future quantum computer in Knill's architecture. The n...
详细信息
We apply the notion of quantum predicate proposed by D'Hondt and Panangaden to analyze a simple language fragment which may describe the quantum part of a future quantum computer in Knill's architecture. The notion of weakest liberal precondition semantics, introduced by Dijkstra for classical deterministic programs and by McIver and Morgan for probabilistic programs, is generalized to our quantum programs. To help reasoning about the correctness of quantum programs, we extend the proof rules presented by Morgan for classical probabilistic loops to quantum loops. These rules are shown to be complete in the sense that any correct assertion about the quantum loops can be proved using them. Some illustrative examples are also given to demonstrate the practicality of our proof rules. (c) 2007 Elsevier B.V. All rights reserved.
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...
详细信息
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 point-wise 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.
暂无评论