Quantum Algorithmic Information Theory
| dc.creator | Svozil,Karl | |
| dc.date | 1996 | |
| dc.date.accessioned | 2024-02-06T12:48:14Z | |
| dc.date.available | 2024-02-06T12:48:14Z | |
| 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, which is most conveniently expressible in Hilbert space. 1.) C. Calude (ed.). The Finite, the Unbounded and the Infinite, Proceedings of the Summer School "Chaitin Complexity and Applications", Mangalia, Romania, 27 June - 6 July, 1995. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-002-05-0311 | |
| dc.identifier | https://lib.jucs.org/article/27240/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/6969 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 2(5): 311-346 | |
| dc.title | Quantum Algorithmic Information Theory | |
| dc.type | Research Article |