PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
Kolmogorov complexity of a (classical) string or, more generally, of a (classical) finite object, is defined as the shortest effective binary description of that string or object. Berthiaume, van Dam and Laplante extended the notion of (classical) Kolmogorov complexity to the quantum domain. We introduce the notion of complexity of a quantum density operator and that of a unitary transformation and establish its relation with the qubit complexity of a quantum state.
Alexei Kaltchenko
"Qubit complexity and the complexity of operators acting on the space of quantum states", Proc. SPIE 12093, Quantum Information Science, Sensing, and Computation XIV, 120930E (30 May 2022); https://doi.org/10.1117/12.2627079
ACCESS THE FULL ARTICLE
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
The alert did not successfully save. Please try again later.
Alexei Kaltchenko, "Qubit complexity and the complexity of operators acting on the space of quantum states," Proc. SPIE 12093, Quantum Information Science, Sensing, and Computation XIV, 120930E (30 May 2022); https://doi.org/10.1117/12.2627079