|
| related topics |
| {time, systems, information} |
| {algorithm, log, probability} |
| {state, phys, rev} |
| {information, entropy, channel} |
| {qubit, qubits, gate} |
| {photon, photons, single} |
| {entanglement, phys, rev} |
| {field, particle, equation} |
| {state, states, coherent} |
| {classical, space, random} |
| {measurement, state, measurements} |
| {error, code, errors} |
|
The Second Quantized Quantum Turing Machine and Kolmogorov Complexity
Caroline Rogers, Vlatko Vedral
abstract: The Kolmogorov complexity of a physical state is the minimal physical
resources required to reproduce that state. We define a second quantized
quantum Turing machine and use it to define second quantized Kolmogorov
complexity. There are two advantages to our approach - our measure of second
quantized Kolmogorov complexity is closer to physical reality and unlike other
quantum Kolmogorov complexities it is continuous. We give examples where second
quantized and quantum Kolmogorov complexity differ.
- oai_identifier:
- oai:arXiv.org:quant-ph/0506266
- categories:
- quant-ph
- comments:
- 5 pages, 0 figures
- arxiv_id:
- quant-ph/0506266
- created:
- 2005-06-30
- updated:
- 2008-04-05
Full article ▸
|
|
| related documents |
| 0101060v1 |
| 0402197v6 |
| 0611250v1 |
| 9811039v4 |
| 0512115v4 |
| 9811069v2 |
| 0610047v1 |
| 0701200v3 |
| 0510072v1 |
| 0507262v1 |
| 0101088v1 |
| 0608156v1 |
| 0512146v1 |
| 0508156v3 |
| 0612052v2 |
| 0609160v1 |
| 0612033v1 |
| 0606242v3 |
| 0507024v1 |
| 0703193v2 |
| 0507194v1 |
| 0701198v1 |
| 0507218v1 |
| 0701079v1 |
| 0603155v1 |
|