Quantum Kolmogorov complexity


(2007). Quantum Kolmogorov complexity. Perimeter Institute. https://pirsa.org/07010005


Quantum Kolmogorov complexity. Perimeter Institute, Jan. 10, 2007, https://pirsa.org/07010005


          @misc{ pirsa_PIRSA:07010005,
            doi = {10.48660/07010005},
            url = {https://pirsa.org/07010005},
            author = {},
            keywords = {Quantum Information},
            language = {en},
            title = {Quantum Kolmogorov complexity},
            publisher = {Perimeter Institute},
            year = {2007},
            month = {jan},
            note = {PIRSA:07010005 see, \url{https://pirsa.org}}


Kolmogorov complexity is a measure of the information contained in a binary string. We investigate the notion of quantum Kolmogorov complexity, a measure of the information required to describe a quantum state. We show that for any definition of quantum Kolmogorov complexity measuring the number of classical bits required to describe a pure quantum state, there exists a pure n-qubit state which requires exponentially many bits of description. This is shown by relating the classical communication complexity to the quantum Kolmogorov complexity. Furthermore we give some examples of how quantum Kolmogorov complexity can be applied to prove results in different fields, such as quantum computation and communication.