High-level structures for quantum computing

by Miszczak, Jarosław Adam

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :High-level structures for quantum computing / Jarosław Adam Miszczak.

Summary

This book is concerned with the models of quantum computation. Information processing based on the rules of quantum mechanics provides us with new opportunities for developing more efficient algorithms and protocols. However, to harness the power offered by quantum information processing it is essential to control the behavior of quantum mechanical objects in a precise manner. As this seems to be conceptually difficult at the level of quantum states and unitary gates, high-level quantum programming languages have been proposed for this purpose. The aim of this book is to provide an introduction to abstract models of computation used in quantum information theory. Starting from the abstract models of Turing machine and finite automata, we introduce the models of Boolean circuits and Random Access Machine and use them to present quantum programming techniques and quantum programming languages.

Edition Statements

Publication Date:©2012.

Publication Statements

Publisher(s):Morgan & Claypool
Place of Publication:San Rafael, Calif
Language:eng
Publication Date:©2012.

Notes

In : Synthesis digital library of engineering and computer science.

Visionné le 18 juin 2012.

The Physical Object

Description:1 ressource en ligne (xv, 113 pages) : : ill

Edition Identifiers

ISBN:9781608458523, 1608458520, 1608458512, 9781608458516
oclc:ocn848032447
LC Classification:QA76.889
Dewey Decimal:004.1

1. Introduction -- 1.1 Computability -- 1.2 Quantum information theory -- 1.3 Programming languages

2. Turing machines -- 2.1 Classical Turing machine -- 2.2 Nondeterministic and probabilistic computation -- 2.3 Quantum Turing machine -- 2.4 Modifications of the base model -- 2.4.1 Generalized quantum Turing machine -- 2.4.2 Classically controlled quantum Turing machine -- 2.5 Quantum complexity -- 2.6 Fantasy quantum computing -- 2.7 Summary

3. Quantum finite state automata -- 3.1 Finite automata -- 3.1.1 Deterministic finite automata -- 3.1.2 Nondeterministic finite automata -- 3.1.3 Probabilistic automata -- 3.2 Quantum finite automaton -- 3.2.1 Measure-once quantum finite automaton -- 3.2.2 Measure-many quantum finite automaton -- 3.3 Quantum languages -- 3.4 Summary

4. Computational circuits -- 4.1 Boolean circuits -- 4.2 Reversible circuits -- 4.2.1 Universal reversible gates -- 4.3 Quantum circuits -- 4.4 Summary

5. Random access machines -- 5.1 Classical RAM model -- 5.1.1 Elements of the model -- 5.1.2 RAM-ALGOL -- 5.2 Quantum RAM model -- 5.3 Quantum pseudocode -- 5.3.1 Elements of quantum pseudocode -- 5.3.2 Quantum conditions -- 5.3.3 Measurement -- 5.4 Summary

6.…