Quantum algorithmic information theory
| dc.creator | Svozil, Karl | |
| dc.date | 1995-10-05 | |
| dc.date.accessioned | 2026-07-07T06:13:37Z | |
| dc.date.available | 2026-07-07T06:13:37Z | |
| dc.description | The agenda of quantum algorithmic information theory, ordered `top-down,' is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental atoms processed by quantum computation are the quantum bits which are dealt with in quantum information theory. The theory of quantum computation will be based upon a model of universal quantum computer whose elementary unit is a two-port interferometer capable of arbitrary $U(2)$ transformations. Basic to all these considerations is quantum theory, in particular Hilbert space quantum mechanics. | |
| dc.description | latex, amsfonts; series of lectures given at the summer school "Chaitin Complexity and Applications", Mangalia, June 27th - July 6th, 1995, Mangalia, Romania | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9510005 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9510005 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93172 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum algorithmic information theory | |
| dc.type | text |