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

arXiv:0710.3605 · Letters in Mathematical Physics

A Kolmogorov Extension Theorem for POVMs

Roderich Tumulka

Published Feb 26, 2008• 12 citations
arXivHTMLPDF
DOI
10.1007/s11005-008-0229-8

Related papers

31pSG-11 Kolmogorov complexity と POVM 測定

孝太郎 只木

日本物理学会講演概要集•Mar 6, 2003•0 citations

Kolmogorov extension theorem for (quantum) causal modelling and general probabilistic theories

Simon Milz, Fattah Sakuldee, Felix A. Pollock +1 more

In classical physics, the Kolmogorov extension theorem lays the foundation for the theory of stochastic processes. It has been known for a long time that, in its original form, this theorem does not hold in quantum mechanics. More generally, it does not hold in any theory of stochastic processes -- classical, quantum or beyond -- that does not just describe passive observations, but allows for active interventions. Such processes form the basis of the study of causal modelling across the sciences, including in the quantum domain. To date, these frameworks have lacked a conceptual underpinning similar to that provided by Kolmogorov’s theorem for classical stochastic processes. We prove a generalized extension theorem that applies to all theories of stochastic processes, putting them on equally firm mathematical ground as their classical counterpart. Additionally, we show that quantum causal modelling and quantum stochastic processes are equivalent. This provides the correct framework for the description of experiments involving continuous control, which play a crucial role in the development of quantum technologies. Furthermore, we show that the original extension theorem follows from the generalized one in the correct limit, and elucidate how a comprehensive understanding of general stochastic processes allows one to unambiguously define the distinction between those that are classical and those that are quantum.

arXiv:1712.02589•Quantum•Apr 20, 2020•106 citations

Proof of Kolmogorovian censorship

Gergely Bana, Thomas Durt

arXiv:quant-ph/9701012•Foundations of Physics•Oct 1, 1997•20 citations

A note on quantising Kolmogorov systems

Lyn C. Thomas

Annales De L Institut Henri Poincare-physique Theorique•Jan 1, 1974•1 citation

Two Simple Proofs of Müller's Theorem

Samuel Epstein

Due to Müller's theorem, the Kolmogorov complexity of a string was shown to be equal to its quantum Kolmogorov complexity. Thus there are no benefits to using quantum mechanics to compress classical information. The quantitative amount of information in classical sources is invariant to the physical model used. These consequences make this theorem arguably the most important result in the intersection of algorithmic information theory and physics. The original proof is quite extensive. This paper contains two simple proofs of this theorem. This paper also contains new bounds for quantum Kolmogorov complexity with error.

arXiv:2402.05328•Feb 8, 2024•0 citations

Quantum Kolmogorov--Arnold representation theorem for continuous unitary-valued maps

Sviatoslav V. Dzhenzher

The classical Kolmogorov--Arnold representation theorem states that any continuous multivariate function can be exactly decomposed into a finite composition of univariate continuous functions and addition operations. This foundational result has recently inspired the development of Kolmogorov--Arnold Networks (KANs) in classical machine learning, as well as their extensions into the quantum domain (QKANs). In this paper, we establish two quantum analogues of the Kolmogorov--Arnold representation theorem for continuous unitary-valued maps of several variables within an open $1$-neighbourhood of the identity matrix \(O_1(\mathbf{I}) \subset \mathcal{U}(n)\). First, we prove a representation theorem that yields an exact additive decomposition inside the matrix exponent of anti-Hermitian-valued maps. Second, due to the non-commutative nature of quantum operators, we derive a factorised version expressing the target unitary map as a finite sequential product of univariate matrix exponentials. Finally, we provide a concrete topological counterexample based on the lifting property of \(\mathcal{SU}(2)\) to demonstrate that these local representation theorems cannot be globally extended to the entire unitary group \(\mathcal{U}(n)\) without encountering fundamental structural obstructions.

quant-pharXiv:2607.03187•Jul 6, 2026•1 citation
In classical physics, the Kolmogorov extension theorem lays the foundation for the theory of stochastic processes. It has been known for a long time that, in its original form, this theorem does not hold in quantum mechanics. More generally, it does not hold in any theory of stochastic processes -- classical, quantum or beyond -- that does not just describe passive observations, but allows for active interventions. Such processes form the basis of the study of causal modelling across the sciences, including in the quantum domain. To date, these frameworks have lacked a conceptual underpinning similar to that provided by Kolmogorov’s theorem for classical stochastic processes. We prove a generalized extension theorem that applies to all theories of stochastic processes, putting them on equally firm mathematical ground as their classical counterpart. Additionally, we show that quantum causal modelling and quantum stochastic processes are equivalent. This provides the correct framework for the description of experiments involving continuous control, which play a crucial role in the development of quantum technologies. Furthermore, we show that the original extension theorem follows from the generalized one in the correct limit, and elucidate how a comprehensive understanding of general stochastic processes allows one to unambiguously define the distinction between those that are classical and those that are quantum.
Due to Müller's theorem, the Kolmogorov complexity of a string was shown to be equal to its quantum Kolmogorov complexity. Thus there are no benefits to using quantum mechanics to compress classical information. The quantitative amount of information in classical sources is invariant to the physical model used. These consequences make this theorem arguably the most important result in the intersection of algorithmic information theory and physics. The original proof is quite extensive. This paper contains two simple proofs of this theorem. This paper also contains new bounds for quantum Kolmogorov complexity with error.
The classical Kolmogorov--Arnold representation theorem states that any continuous multivariate function can be exactly decomposed into a finite composition of univariate continuous functions and addition operations. This foundational result has recently inspired the development of Kolmogorov--Arnold Networks (KANs) in classical machine learning, as well as their extensions into the quantum domain (QKANs). In this paper, we establish two quantum analogues of the Kolmogorov--Arnold representation theorem for continuous unitary-valued maps of several variables within an open 111-neighbourhood of the identity matrix O1(I)⊂U(n)O_1(\mathbf{I}) \subset \mathcal{U}(n)O1​(I)⊂U(n). First, we prove a representation theorem that yields an exact additive decomposition inside the matrix exponent of anti-Hermitian-valued maps. Second, due to the non-commutative nature of quantum operators, we derive a factorised version expressing the target unitary map as a finite sequential product of univariate matrix exponentials. Finally, we provide a concrete topological counterexample based on the lifting property of SU(2)\mathcal{SU}(2)SU(2) to demonstrate that these local representation theorems cannot be globally extended to the entire unitary group U(n)\mathcal{U}(n)U(n) without encountering fundamental structural obstructions.