THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY
From MaRDI portal
Publication:3528819
DOI10.1142/S021798490801464XzbMath1155.68026arXivquant-ph/0506266MaRDI QIDQ3528819
Vlatko Vedral, Caroline Rogers
Publication date: 17 October 2008
Published in: Modern Physics Letters B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0506266
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
81P68: Quantum computation
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Related Items
Cites Work
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
- Quantum algorithmic entropy
- Algorithmic Information Theory
- Quantum Complexity Theory
- Quantitative limits on the ability of a Maxwell demon to extract work from heat
- Programmable Quantum Gate Arrays
- Can a Universal Quantum Computer Be Fully Quantum?
- Quantum Kolmogorov complexity based on classical descriptions
- Remarks on universal quantum computer
- Quantum Kolmogorov complexity