Radomir S. Stankovic Ph.D.
| Position |
Department / Business Unit |
|
|
| Institution |
Disciplines |
| University of Nis |
Mathematics |
| City |
State / Provence |
|
|
| Country |
Website |
| Yugoslavia |
|
| Fax |
|
|
|
|
Related Content
Numerical simulation results are presented which suggest that a class of non-adiabatic rapid passage sweeps known as twisted rapid passage should be capable of implementing a universal set of quantum gates that operate with high fidelity. The universal set consists of the Hadamard and NOT gates, together with variants of the phase, pi/8, and controlled-phase gates. The simulations suggest that the universal set of gates produced by twisted rapid passage shows promise as possible elements of a fault-tolerant scheme for quantum computing.
It was once widely believed that quantum computation would never become a reality. However, the discovery of quantum error correction and the proof of the accuracy threshold theorem nearly ten years ago gave rise to extensive development and research aimed at creating a working, scalable quantum computer. Over a decade has passed since this monumental accomplishment yet no book-length pedagogical presentation of this important theory exists. Quantum Error Correction and Fault Tolerant Quantum Computing offers the first full-length exposition on the realization of a theory once thought impossible. It provides in-depth coverage on the most important class of codes discovered to date-quantum stabilizer codes. It brings together the central themes of quantum error correction and fault-tolerant procedures to prove the accuracy threshold theorem for a particular noise error model. The author also includes a derivation of well-known bounds on the parameters of quantum error correcting code.
Packed with over 40 real-world problems, 35 field exercises, and 17 worked-out examples, this book is the essential resource for any researcher interested in entering the quantum field as well as for those who want to understand how the unexpected realization of quantum computing is possible.
Prof. John A. Pelesko, a mathematician with the University of Delaware, describes self-assembly and offers his views on how understanding of models and mathematics of self-assembly can improve man-made engineering.
|