Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909080086380544 |
|---|---|
| author | Lemus, Mariano Faleiro, Ricardo Mateus, Paulo Paunković, Nikola Souto, André |
| author_facet | Lemus, Mariano Faleiro, Ricardo Mateus, Paulo Paunković, Nikola Souto, André |
| contents | This work presents a study of Kolmogorov complexity for general quantum states from the perspective of deterministic-control quantum Turing Machines (dcq-TM). We extend the dcq-TM model to incorporate mixed state inputs and outputs, and define dcq-computable states as those that can be approximated by a dcq-TM. Moreover, we introduce (conditional) Kolmogorov complexity of quantum states and use it to study three particular aspects of the algorithmic information contained in a quantum state: a comparison of the information in a quantum state with that of its classical representation as an array of real numbers, an exploration of the limits of quantum state copying in the context of algorithmic complexity, and study of the complexity of correlations in quantum systems, resulting in a correlation-aware definition for algorithmic mutual information that satisfies symmetry of information property. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_14252 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines Lemus, Mariano Faleiro, Ricardo Mateus, Paulo Paunković, Nikola Souto, André Quantum Physics Computational Complexity Mathematical Physics This work presents a study of Kolmogorov complexity for general quantum states from the perspective of deterministic-control quantum Turing Machines (dcq-TM). We extend the dcq-TM model to incorporate mixed state inputs and outputs, and define dcq-computable states as those that can be approximated by a dcq-TM. Moreover, we introduce (conditional) Kolmogorov complexity of quantum states and use it to study three particular aspects of the algorithmic information contained in a quantum state: a comparison of the information in a quantum state with that of its classical representation as an array of real numbers, an exploration of the limits of quantum state copying in the context of algorithmic complexity, and study of the complexity of correlations in quantum systems, resulting in a correlation-aware definition for algorithmic mutual information that satisfies symmetry of information property. |
| title | Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines |
| topic | Quantum Physics Computational Complexity Mathematical Physics |
| url | https://arxiv.org/abs/2305.14252 |