Kids Library Home

Welcome to the Kids' Library!

Search for books, movies, music, magazines, and more.

     
Available items only
E-Book/E-Doc
Author Ying, Mingsheng, author.

Title Foundations of quantum programming / Mingsheng Ying.

Publication Info. Cambridge, MA : Morgan Kaufmann, an imprint of Elsevier, [2016]
©2016

Copies

Location Call No. OPAC Message Status
 Axe Elsevier ScienceDirect Ebook  Electronic Book    ---  Available
Description 1 online resource
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
Bibliography Includes bibliographical references and index.
Note Online resource; title from PDF title page (EBSCO, viewed April 4, 2016).
Summary 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.
Contents Front Cover; Foundations of Quantum Programming; Copyright; Contents; Preface; Acknowledgments; Part I: Introduction and preliminaries; Chapter 1: Introduction; 1.1 Brief history of quantum programming research; 1.1.1 Design of Quantum Programming Languages; 1.1.2 Semantics of Quantum Programming Languages; 1.1.3 Verification and Analysis of Quantum Programs; 1.2 Approaches to quantum programming; 1.2.1 Superposition-of-Data -- Quantum Programs with Classical Control; 1.2.2 Superposition-of-Programs -- Quantum Programs with Quantum Control; 1.3 Structure of the Book; Chapter 2: Preliminaries
2.1 Quantum mechanics2.1.1 Hilbert Spaces; 2.1.2 Linear Operators; 2.1.3 Unitary Transformations; 2.1.4 Quantum Measurements; 2.1.5 Tensor Products of Hilbert Spaces; 2.1.6 Density Operators; 2.1.7 Quantum Operations; 2.2 Quantum circuits; 2.2.1 Basic Definitions; 2.2.2 One-Qubit Gates; 2.2.3 Controlled Gates; 2.2.4 Quantum Multiplexor; 2.2.5 Universality of Gates; 2.2.6 Measurement in Circuits; 2.3 Quantum algorithms; 2.3.1 Quantum Parallelism and Interference; 2.3.2 Deutsch-Jozsa Algorithm; 2.3.3 Grover Search Algorithm; 2.3.4 Quantum Walks; 2.3.5 Quantum-Walk Search Algorithm
2.3.6 Quantum Fourier Transform2.3.7 Phase Estimation; 2.4 Bibliographic remarks; Part II: Quantum programswith classicalcontrol; Chapter 3: Syntax and semantics of quantum programs; 3.1 Syntax; 3.2 Operational semantics; 3.3 Denotational semantics; 3.3.1 Basic Properties of Semantic Functions; 3.3.2 Quantum Domains; 3.3.3 Semantic Function of Loop; 3.3.4 Change and Access of Quantum Variables; 3.3.5 Termination and Divergence Probabilities; 3.3.6 Semantic Functions as Quantum Operations; 3.4 Classical recursion in quantum programming; 3.4.1 Syntax; 3.4.2 Operational Semantics
3.4.3 Denotational Semantics3.4.4 Fixed Point Characterization; 3.5 Illustrative example: Grover quantum search; 3.6 Proofs of lemmas; 3.7 Bibliographic remarks; Chapter 4: Logic for quantum programs; 4.1 Quantum predicates; 4.1.1 Quantum Weakest Preconditions; 4.2 Floyd-Hoare logic for quantum programs; 4.2.1 Correctness Formulas; 4.2.2 Weakest Preconditions of Quantum Programs; 4.2.3 Proof System for Partial Correctness; 4.2.4 Proof System for Total Correctness; 4.2.5 An Illustrative Example: Reasoning aboutthe Grover Algorithm; 4.3 Commutativity of quantum weakest preconditions
4.4 Bibliographic remarksChapter 5: Analysis of quantum programs; 5.1 Termination analysis of quantum while-loops; 5.1.1 Quantum while-Loops with Unitary Bodies; 5.1.2 General Quantum while-Loops; 5.1.3 An Example; 5.2 Quantum graph theory; 5.2.1 Basic Definitions; 5.2.2 Bottom Strongly Connected Components; 5.2.3 Decomposition of the State Hilbert Space; 5.3 Reachability analysis of quantum Markov chains; 5.3.1 Reachability Probability; 5.3.2 Repeated Reachability Probability; 5.3.3 Persistence Probability; 5.4 Proofs of technical lemmas; 5.5 Bibliographic remarks
Subject Quantum computers.
Programming languages (Electronic computers)
Ordinateurs quantiques.
COMPUTERS -- General.
Programming languages (Electronic computers)
Quantum computers
Other Form: Print version : 9780128023068
ISBN 9780128025468 (electronic bk.)
0128025468 (electronic bk.)
0128023066
9780128023068
9780128023068
Standard No. AU@ 000057263271
AU@ 000057278660
CHNEW 001013483
DEBBG BV043969875
DEBSZ 482469986
DEBSZ 485804050
GBVCP 879418745
GBVCP 882758411
UKMGB 017798429

 
    
Available items only