Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Theoretical Physics

Quantum probabilities, Kolmogorov probabilities, and informational probabilities

Mioara Mugur-Schächter

Published Jan 1, 1994• 3 citations
Publisher
DOI
10.1007/bf00671614

Related papers

Non-Kolmogorov Probability and Quantum Physics

Andrei Yu. Khrennikov

Springer eBooks•Jan 1, 1997•3 citations

Quantum Measurements and Kolmogorov's Theory of Probability

D. A. Slavnov

Theoretical and Mathematical Physics•Sep 1, 2003•7 citations

Quantum Kolmogorov complexity and quantum key distribution

Takayuki Miyadera, Hideki Imai

We discuss the Bennett-Brassard 1984 (BB84) quantum key distribution protocol in the light of quantum algorithmic information. While Shannon's information theory needs a probability to define a notion of information, algorithmic information theory does not need it and can assign a notion of information to an individual object. The program length necessary to describe an object, Kolmogorov complexity, plays the most fundamental role in the theory. In the context of algorithmic information theory, we formulate a security criterion for the quantum key distribution by using the quantum Kolmogorov complexity that was recently defined by Vit\'anyi. We show that a simple BB84 protocol indeed distributes a binary sequence between Alice and Bob that looks almost random for Eve with a probability exponentially close to 1.

arXiv:0811.2460•Physical Review A•Jan 26, 2009•7 citations

Classical (Kolmogorovian) and Quantum (Born) Probability

Andrei Yu. Khrennikov

Springer eBooks•Dec 31, 2009•0 citations

Three approaches to the quantitative definition of information in an individual pure quantum state

Paul M. B. Vitanyi

In analogy of classical Kolmogorov complexity we develop a theory of the algorithmic information in bits contained in any one of continuously many pure quantum states: quantum Kolmogorov complexity. Classical Kolmogorov complexity coincides with the new quantum Kolmogorov complexity restricted to the classical domain. Quantum Kolmogorov complexity is upper bounded and can be effectively approximated from above. With high probability a quantum object is incompressible. There are two alternative approaches possible: to define the complexity as the length of the shortest qubit program that effectively describes the object, and to use classical descriptions with computable real parameters.

arXiv:quant-ph/9907035•IEEE Conference on Computational Complexity (CCC)•Nov 7, 2002•24 citations

Quantum theory and non-kolmogorovian probability

Luigi Accardi

Springer eBooks•Apr 6, 2008•5 citations
We discuss the Bennett-Brassard 1984 (BB84) quantum key distribution protocol in the light of quantum algorithmic information. While Shannon's information theory needs a probability to define a notion of information, algorithmic information theory does not need it and can assign a notion of information to an individual object. The program length necessary to describe an object, Kolmogorov complexity, plays the most fundamental role in the theory. In the context of algorithmic information theory, we formulate a security criterion for the quantum key distribution by using the quantum Kolmogorov complexity that was recently defined by Vit\'anyi. We show that a simple BB84 protocol indeed distributes a binary sequence between Alice and Bob that looks almost random for Eve with a probability exponentially close to 1.
In analogy of classical Kolmogorov complexity we develop a theory of the algorithmic information in bits contained in any one of continuously many pure quantum states: quantum Kolmogorov complexity. Classical Kolmogorov complexity coincides with the new quantum Kolmogorov complexity restricted to the classical domain. Quantum Kolmogorov complexity is upper bounded and can be effectively approximated from above. With high probability a quantum object is incompressible. There are two alternative approaches possible: to define the complexity as the length of the shortest qubit program that effectively describes the object, and to use classical descriptions with computable real parameters.