//]]>
Normal View MARC View ISBD View

Foundations of quantum programming /

by Ying, Mingsheng.
Published by : Morgan Kaufmann, an imprint of Elsevier, (Cambridge, MA : ) Physical details: xi, 357 p. ; 25 cm ISBN: 0128023066 Subject(s): Quantum computers. | Programming languages (Electronic computers) Year: 2016
Online Resources:
Tags from this library:
No tags from this library for this title.

Includes bibliographical references and index

Introduction and Preliminaries -- Introduction -- Brief History of Quantum Programming Research -- Design of Quantum Programming Languages -- Semantics of Quantum Programming Languages -- Verification and Analysis of Quantum Programs -- Approaches to Quantum Programming -- Superposition-of-Data-Quantum Programs with Classical Control -- Superposition-of-Programs-Quantum Programs with Quantum Control -- Structure of the Book -- Preliminaries -- Quantum Mechanics -- Hilbert Spaces -- Linear Operators -- Unitary Transformations -- Quantum Measurements -- Tensor Products of Hilbert Spaces -- Density Operators -- Quantum Operations -- Quantum Circuits -- Basic Definitions -- One-Qubit Gates -- Controlled Gates -- Quantum Multiplexor -- Universality of Gates -- Measurement in Circuits -- Quantum Algorithms -- Quantum Parallelism and Interference -- Deulsch-Jozsa Algorithm -- Grover Search Algorithm -- Quantum Walks -- Quantum-Walk Search Algorithm -- Quantum Fourier Transform -- Phase Estimation -- Bibliographic Remarks -- Quantum Programs with Classical Control -- Syntax and Semantics of Quantum Programs -- Syntax -- Operational Semantics -- Denotational Semantics -- Basic Properties of Semantic Functions -- Quantum Domains -- Semantic Function of Loop -- Change and Access of Quantum Variables -- Termination and Divergence Probabilities -- Semantic Functions as Quantum Operations -- Classical Recursion in Quantum Programming -- Syntax -- Operational Semantics -- Denotational Semantics -- Fixed Point Characterization -- Illustrative Example: Grover Quantum Search -- Proofs of Lemmas -- Bibliographic Remarks -- Logic for Quantum Programs -- Quantum Predicates -- Quantum Weakest Preconditions -- Floyd-Hoare Logic for Quantum Programs -- Correctness Formulas -- Weakest Preconditions of Quantum Programs -- Proof System for Partial Correctness -- Proof System for Total Correctness -- An Illustrative Example: Reasoning about the Grover Algorithm -- Commutativity of Quantum Weakest Preconditions -- Bibliographic Remarks -- Analysis of Quantum Programs -- Termination Analysis of Quantum while-Loops -- Quantum while-Loops with Unitary Bodies -- General Quantum while Loops -- An Example -- Quantum Graph Theory -- Basic Definitions -- Bottom Strongly Connected Components -- Decomposition of the Stale Hilbert Space -- Reachability Analysis of Quantum Markov Chains -- Reachability Probability -- Repeated Reachability Probability -- Persistence Probability -- Proofs of Technical Lemmas -- Bibliographic Remarks -- Quantum Programs with Quantum Control -- Quantum Case Statements -- Case Statements: From Classical to Quantum -- QuGCL: A Language with Quantum Case Statement -- Guarded Compositions of Quantum Operations -- Guarded Composition of Unitary Operators -- Operator-Valued Functions -- Guarded Composition of Operator-Valued Functions -- Guarded Composition of Quantum Operations -- Semantics of QuGCL Programs -- Classical States -- Semi-Classical Semantics -- Purely Quantum Semantics -- Weakest Precondition Semantics -- An Example -- Quantum Choice -- Choices: From Classical to Quantum via Probabilistic -- Quantum Implementation of Probabilistic Choice -- Algebraic Laws -- Illustrative Examples -- Quantum Walks -- Quantum Phase Estimation -- Discussions -- Coefficients in Guarded Compositions of Quantum Operations -- Quantum Case Statements Guarded by Subspaces -- Proofs of Lemmas, Propositions and Theorems -- Bibliographic Remarks -- Quantum Recursion -- Syntax of Quantum Recursive Programs -- Motivating Examples: Recursive Quantum Walks -- Specification of Recursive Quantum Walks -- How to Solve Recursive Quantum Equations -- Second Quantization -- Multiple-Particle States -- Fock Spaces -- Observables in Fock Spaces -- Evolution in Fock Spaces -- Creation and Annihilation of Particles -- Solving Recursive Equations in the Free Fock Space -- A Domain of Operators in the Free Fock Space -- Semantic Functional of Program Schemes -- Fixed Point Semantics -- Syntactic Approximation -- Recovering Symmetry and Antisymmetry -- Symmetrization Functional -- Symmetrization of the Semantics of Quantum Recursive Programs -- Principal System Semantics of Quantum Recursion -- Illustrative Examples: Revisit Recursive Quantum Walks -- Quantum while Loops (with Quantum Control) -- Bibliographic Remarks -- Prospects -- Prospects -- Quantum Programs and Quantum Machines -- Implementation of Quantum Programming Languages -- Functional Quantum Programming -- Categorical Semantics of Quantum Programs -- From Concurrent Quantum Programs to Quantum Concurrency -- Entanglement in Quantum Programming -- Model-Checking Quantum Systems -- Quantum Programming Applied to Physics

Available to OhioLINK libraries

Foundations of Quantum Programming discusses how new programming methodologies and technologies developed for current computers can be extended to exploit the unique power of quantum computers, which promise dramatic advantages in processing speed over currently available computer systems. Governments and industries around the globe are now investing vast amounts of money with the expectation of building practical quantum computers. Drawing upon years of experience and research in quantum computing research and using numerous examples and illustrations, Mingsheng Ying has created a very useful reference on quantum programming languages and important tools and techniques required for quantum programming, making the book a valuable resource for academics, researchers, and developers

There are no comments for this item.

Log in to your account to post a comment.

Languages: 
English |
العربية