Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Pavičić M. — Quantum Computation and Quantum Communication: Theory and Experiments
Pavičić M. — Quantum Computation and Quantum Communication: Theory and Experiments



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Quantum Computation and Quantum Communication: Theory and Experiments

Автор: Pavičić M.

Аннотация:

Mladen Pavicic presents the main elements of the quantum computation and communication theories and their implementation in a self-consistent way that keeps the reader from getting lost in details. The book is not a textbook, does not contain exercises, and can be read without a copybook. It introduces concepts like quantum computer circuits, physical computing, qubit formalism, quantum Turing machine, quantum cryptography, and quantum error correction by means of elementary quantum mechanical formalism and elements of classical computation theory. The concepts that do not have classical counterparts, like quantum entanglement, teleportation, and the no-cloning theorem are introduced with the help of the corresponding experiments. Yet, the presentation does not stop short of discussing some challenging points: The classical Turing machine is a mathematical procedure that singles out the binary Boolean algebra for classical computers. Can the quantum Turing machine provide us with a quantum algebra for quantum computers? The qubit is a two-level system. What are the details of its three-dimensional representation on and in the Bloch sphere? Quantum circuits trace the histories of each qubit and their mutual control-target relationships. How do we handle entangled qubits that share the same state? Shor's algorithm for factoring numbers in a polynomial time is considered one of the most important boosts to the development of quantum computing since the security of today's e-business depends on the assumed exponential classical complexity of factoring numbers. Has quantum cryptography eliminated the need of implementing Shor's algorithm? Would-be super-fast quantum computers can beuniversal simulators of quantum systems. Can they also be universal computers?


Язык: en

Рубрика: Физика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2006

Количество страниц: 221

Добавлена в каталог: 14.11.2009

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Type-II down-conversion      130
Unconditional security of quantum cryptography, ix      72 83 126
Unitary operator      27 186
Unitary, orthoautomorphism      196
Universal quantum gate      53
Universal reversible gate      15
Universal Turing machine      7
Unknown state      58 137
Vacuum, state      40 117
Van der Waals gas      190
Vector, space      24
Vertex      168
Wave, approximation, rotating      115
Wave, equation, linearization      46
Wave, vector      20
Weak, interaction      190
Weierstrass solid immersion lenses      128
Welcher Weg      164
Which way      164
Winner (would be quantum computer)      124
XOR      8 65 72 74 85 174
Zeeman, effect, anomalous      88
Zeeman, effect, normal      88
Zeeman, effect, nuclear      95
Zeeman, magnetic field, external      88 90
Zeeman, magnetic field, inner      91
Zeeman, magnetic Hamiltonian part      104
Zeeman, splitting      90 142
Zeeman, sublevels      147
1 2 3 4
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте