Quantum Computation (Q4469181)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2074150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quantum Computation |
scientific article; zbMATH DE number 2074150 |
Statements
Quantum Computation (English)
0 references
14 June 2004
0 references
0.8539485335350037
0 references
0.818558931350708
0 references
0.8164395689964294
0 references
0.8101597428321838
0 references
This is a very nice essay introducing to and explaining well the highlights of quantum computation for readers who have elementary knowledge from linear and multilinear algebra. After introducing to \({\mathbf C}^2\) operators and tensor products the necessary features of quantum mechanics are explained. Then quantum gates and quantum circuits are considered in a short but very instructive manner. After explaining dense coding and teleportation the Deutsch-Josza algorithm, and Grovers search algorithm are described. Eventually the quantum Fourier transformation and phase estimation as the main ingredients of Shor's algorithm are presented. This article can be best recommended as a short, clear, and rigorous introduction to the title problem.
0 references
