| 000 | 03204nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-02516-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240730163950.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 220601s2012 sz | s |||| 0|eng d | ||
| 020 |
_a9783031025167 _9978-3-031-02516-7 |
||
| 024 | 7 |
_a10.1007/978-3-031-02516-7 _2doi |
|
| 050 | 4 | _aQA1-939 | |
| 072 | 7 |
_aPB _2bicssc |
|
| 072 | 7 |
_aMAT000000 _2bisacsh |
|
| 072 | 7 |
_aPB _2thema |
|
| 082 | 0 | 4 |
_a510 _223 |
| 100 | 1 |
_aMiszczak, Jaroslaw. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _981395 |
|
| 245 | 1 | 0 |
_aHigh Level Structures for Quantum Computing _h[electronic resource] / _cby Jaroslaw Miszczak. |
| 250 | _a1st ed. 2012. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2012. |
|
| 300 |
_aXVI, 113 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSynthesis Lectures on Quantum Computing, _x1945-9734 |
|
| 505 | 0 | _aIntroduction -- Turing machines -- Quantum Finite State Automata -- Computational Circuits -- Random Access Machines -- Quantum Programming Environment -- Quantum Programming Languages -- Imperative quantum programming -- Functional Quantum Programming -- Outlook. | |
| 520 | _aThis 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. Table of Contents: Introduction / Turing machines / Quantum Finite State Automata / Computational Circuits / Random Access Machines / Quantum Programming Environment / Quantum Programming Languages / Imperative quantum programming / Functional Quantum Programming / Outlook. | ||
| 650 | 0 |
_aMathematics. _911584 |
|
| 650 | 0 |
_aQuantum computers. _93985 |
|
| 650 | 0 |
_aQuantum physics. _981396 |
|
| 650 | 1 | 4 |
_aMathematics. _911584 |
| 650 | 2 | 4 |
_aQuantum Computing. _910080 |
| 650 | 2 | 4 |
_aQuantum Physics. _981397 |
| 710 | 2 |
_aSpringerLink (Online service) _981398 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031013881 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031036446 |
| 830 | 0 |
_aSynthesis Lectures on Quantum Computing, _x1945-9734 _981399 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-02516-7 |
| 912 | _aZDB-2-SXSC | ||
| 942 | _cEBK | ||
| 999 |
_c85169 _d85169 |
||