Abstract
Research interest in controllable two-level systems, which have been enthusiastically called quantum bits or qubits, has grown enormously during the last decade. Behind a huge burst of activity in this field stands an idea of what is possible in principle but extremely difficult to achieve instrumentally - the fascinating idea of quantum computing. The very principle of quantum superposition allows many operations to be performed on a quantum computer in parallel, while an ordinary ‘classical’ computer, however fast, can only handle one operation at a time. The enthusiasm is not held back by the fact that exploiting quantum parallelism is by no means straightforward, and there exist only a few algorithms (e.g., [1, 2]) for which the quantum computer (if ever built) would offer an essential improvement in comparison with its ‘classical’ counterpart. Even if other uses of quantum computing prove limited (which might or might not be the case), its existence would most certainly lead to a breakthrough in simulations of real physical many-particle systems.
Original language | English |
---|---|
Title of host publication | Springer Series in Solid-State Sciences |
Publisher | Springer |
Pages | 77-101 |
Number of pages | 25 |
DOIs | |
Publication status | Published - 2007 |
Publication series
Name | Springer Series in Solid-State Sciences |
---|---|
Volume | 156 |
ISSN (Print) | 0171-1873 |
ISSN (Electronic) | 2197-4179 |
Bibliographical note
Funding Information:We thank B. L. Altshuler, Y. M. Galperin, R. Fazio and A. Shnirman for useful comments. One of us (I.V.L.) is thankful to Professor S. N. Karmakar for warm hospitality extended to him during this workshop at Saha Institute of Nuclear Physics in Kolkata. This work was supported by the EPSRC grant GR/R95432.
Publisher Copyright:
© 2007, Springer-Verlag Berlin Heidelberg.
Keywords
- Background Charge
- Coupling Strength
- Density Matrix
- Impurity Index
- Josephson Junction
ASJC Scopus subject areas
- Condensed Matter Physics