🔢 mathematics

The Born Representation Theorem and the Unistochastic Theorem

This paper presents constructive proofs demonstrating that any stochastic matrix can be represented via a generalized Born rule using a POVM and PVM, and further shows that by dilating the vector space, any stochastic matrix can be derived from a unistochastic matrix, thereby establishing the primacy of unistochastic matrices in relation to quantum theory and Markov processes.

Original authors: Jacob A. Barandes

Published 2026-08-06

📖 8 min read🧠 Deep dive

CC BY 4.0

Original authors: Jacob A. Barandes

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine the universe as a giant, cosmic game of chance. Sometimes, the rules are simple: you flip a coin, and it lands heads or tails. Other times, the rules are more like a complex board game where the outcome depends on a hidden roll of the dice. In the world of science, we use special grids of numbers called stochastic matrices to map out these games. Think of them as "probability maps" that tell you, if you start in one spot, how likely you are to end up in another. These maps are the backbone of everything from predicting the weather to modeling how diseases spread.

But there's a second, stranger kind of game happening in the universe: the quantum world. Here, things don't just roll dice; they dance to a rhythm of waves and probabilities that seem to break the rules of our everyday logic. In this quantum realm, scientists use a famous formula called the Born rule to calculate the odds of finding a particle in a specific place. For decades, physicists have wondered: Is there a deep, hidden connection between the boring, everyday probability maps we use for weather and the weird, wave-like math of the quantum world? Could the messy, random-looking world we see actually be a shadow of a perfect, underlying quantum dance?

This paper, written by Jacob A. Barandes, dives right into that mystery. It doesn't just guess; it builds a bridge. The author proves two new mathematical theorems that show how any "probability map" (a stochastic matrix) can be built from the building blocks of quantum mechanics. The first discovery, called the Born Representation Theorem, shows that you can take any random probability map and rewrite it using a special quantum formula involving "measurements" and "projections." It's like taking a messy, hand-drawn map of a city and realizing it can be perfectly recreated using a high-tech GPS system.

The second, even more surprising discovery is the Unistochastic Theorem. This theorem suggests that if you are willing to imagine a slightly larger, hidden world (a bigger mathematical space), every possible probability map can be derived from a "perfect" quantum dance. In this hidden world, the rules are governed by a unitary matrix—a fancy way of saying a perfect, reversible quantum machine. The paper proves that the messy, one-way randomness we see in the real world is actually just a "shadow" or a simplified view of this perfect, underlying quantum order. It's as if the chaotic traffic of a busy city is actually just a blurry photo of a perfectly synchronized ballet happening on a higher dimension.

The Big Picture: From Randomness to Rhythm

To understand what this paper does, let's start with the basics. Imagine you have a bag of marbles. If you pull one out, you might get a red one, a blue one, or a green one. A stochastic matrix is just a table that tells you the odds of getting a red marble if you started with a blue one, or a green one if you started with a red one. These tables are used everywhere to model things that change over time, like how a virus spreads or how a stock market moves.

Now, enter the quantum world. In quantum mechanics, things are described by waves. When you measure a quantum system, the wave "collapses" into a specific result. The Born rule is the formula that tells you the probability of getting a specific result. It's the rulebook for the quantum dice.

The big question this paper tackles is: Can every single probability map (stochastic matrix) be explained by the quantum Born rule?

The answer, according to this paper, is a resounding yes. But it comes with a twist.

The First Magic Trick: The Born Representation Theorem

The first theorem the author proves is like a magic trick where you take a messy, ordinary probability map and show it's actually made of quantum ingredients.

The paper shows that for any probability map you can dream up, you can find two special sets of quantum tools:

A POVM (Positive-Operator-Valued Measure): Think of this as a set of "filters" or "sensors" that can catch different outcomes. They are flexible and can overlap.
A PVM (Projection-Valued Measure): Think of these as "perfect, non-overlapping mirrors" that split the world into distinct, separate pieces.

The theorem proves that if you take one of these "filters" and one of these "mirrors," multiply them together, and look at the result (using a mathematical operation called a "trace"), you get exactly the number you need for your probability map.

Why does this matter? It means that the formula quantum physicists use to calculate the odds of finding an electron in a specific spot is actually the same formula used to calculate the odds of a random walk in a city. The paper proves that the "Born rule" isn't just for quantum particles; it's a universal language for describing probability.

The Second Magic Trick: The Unistochastic Theorem

Here is where things get really wild. The first theorem showed that probability maps can be built from quantum tools. But what if we want to build them from perfect quantum tools?

In the quantum world, there is a special kind of matrix called a unitary matrix. These are the "perfect dancers" of the quantum world. They represent processes that are perfectly reversible and conserve energy. If you take a unitary matrix and just look at the size of its numbers (ignoring the direction), you get a unistochastic matrix. These are special probability maps that come directly from a perfect quantum dance.

The paper asks: Can every single probability map be turned into a unistochastic matrix?

The answer is: Yes, but you have to look at a bigger picture.

The Unistochastic Theorem proves that if you are willing to imagine a slightly larger, hidden world (specifically, a space with up to $N^2$ dimensions, where $N$ is the size of your original map), you can always find a perfect quantum dance (a unitary matrix) that, when you "squint" at it or "marginalize" it (ignore some of the details), looks exactly like your original messy probability map.

The Analogy: Imagine you are watching a shadow puppet show. The shadow on the wall (your probability map) looks flat and simple. The Unistochastic Theorem proves that no matter how weird the shadow looks, it was always cast by a 3D puppet (the unitary matrix) moving in a hidden, higher-dimensional room. The shadow isn't random; it's just a 2D slice of a perfect 3D dance.

What This Means for the Real World

The paper doesn't just stay in the realm of abstract math; it hints at how this could change our understanding of time and processes.

The author suggests that this connection could help us understand Markov chains, which are models for things that change step-by-step, like a game of snakes and ladders or the movement of a stock price.

Reversible Processes: If a process is perfectly reversible (like a video played backward that looks normal), it's already a simple quantum dance.
Irreversible Processes: If a process loses information (like a video played backward that looks weird, or a cup of coffee cooling down), the paper suggests it's still a quantum dance, but one where we are forced to "project" or "collapse" the wave at every step to see the result.

The paper concludes that the chaotic, random-looking world we experience might actually be a "marginalized" view of a deeper, perfectly ordered, unitary reality. It doesn't say the world is quantum in a way that breaks physics; rather, it says that the math of probability and the math of quantum mechanics are two sides of the same coin.

The Bottom Line

This paper is a proof, not just a suggestion. The author has constructed a mathematical recipe that works for every possible probability map.

It proves that any stochastic matrix can be written using the Born rule.
It proves that any stochastic matrix can be derived from a unistochastic matrix by expanding the dimension of the space.
It does not claim that we can build a time machine or that we can instantly solve the Collatz conjecture (a famous unsolved math problem mentioned as an example). It simply provides a new mathematical lens through which to view these problems.

In short, Jacob A. Barandes has shown that the universe's randomness is not a bug; it's a feature of a much larger, perfectly synchronized quantum system. The "noise" we see is just the music of the spheres, played on a stage we can't quite see yet.

Technical Summary: The Born Representation Theorem and the Unistochastic Theorem

Problem Statement
The paper addresses the mathematical relationship between classical stochastic matrices, which model discrete stochastic processes and conditional probability distributions, and the probability formulas of quantum theory. Specifically, it investigates whether the entries of any arbitrary stochastic matrix (which may be non-square and non-doubly stochastic) can be derived from or represented by matrices that are special cases of stochastic matrices, specifically those arising from unitary quantum evolution. While Birkhoff's theorem establishes that doubly stochastic matrices are convex combinations of permutation matrices, the paper seeks to determine if a similar "primacy" exists for general stochastic matrices with respect to unistochastic matrices (matrices whose entries are the modulus squares of unitary matrix entries).

Methodology
The author employs constructive proofs to establish two new theorems. The methodology relies on linear algebra, matrix analysis, and the formalism of quantum measurement theory, specifically utilizing:

Positive-Operator-Valued Measures (POVMs): Sets of positive semidefinite matrices summing to the identity.
Projection-Valued Measures (PVMs): Sets of orthogonal projection matrices summing to the identity.
Kraus Decompositions: Factorizations of stochastic matrices using Kraus operators.
Matrix Dilation: Extending the dimensionality of the underlying vector space to embed non-square or non-unistochastic matrices into larger unitary structures.
Trace Formulas: Expressing matrix entries as traces of pairwise products of operators.

Key Contributions and Results

1. The Born Representation Theorem (Theorem 3.1)
The first major result demonstrates that any $M \times N$ stochastic matrix $\Gamma$ can be expressed entry-by-entry as the trace of a pairwise product of two matrices:
$\Gamma_{ij} = \text{tr}(E_i P_j)$
where:

$\{P_j\}_{j=1}^N$ is an $N$ -member Projection-Valued Measure (PVM) of $N \times N$ matrices.
$\{E_i\}_{i=1}^M$ is an $M$ -member Positive-Operator-Valued Measure (POVM) of $N \times N$ matrices.

The construction is explicit: one chooses a standard diagonal PVM $\{P_j\}$ and defines the POVM elements as convex sums of these projections weighted by the stochastic matrix entries ( $E_i = \sum_j \Gamma_{ij} P_j$ ).

Significance: This formula coincides precisely with the generalized quantum Born rule, where $P_j$ represents a pure state and $E_i$ represents a measurement effect.
Corollary: If the POVM $\{E_i\}$ is itself a PVM (i.e., the elements are orthogonal projections), the resulting stochastic matrix $\Gamma$ is unistochastic. This implies $\Gamma_{ij} = |U_{ij}|^2$ for some unitary matrix $U$ .

2. The Unistochastic Theorem (Theorem 3.3)
The second result extends the scope of the first theorem to show that any stochastic matrix (even if not unistochastic and not square) can be derived from a unistochastic matrix of a bounded, larger size via marginalization.

Construction: For an $M \times L$ stochastic matrix $\Gamma$ , the theorem constructs a larger $N^2 \times N^2$ unistochastic matrix $\Gamma_\Gamma$ (where $N = \max(M, L)$ ).
Mechanism: The proof involves:
1. Embedding $\Gamma$ into a square $N \times N$ stochastic matrix $\tilde{\Gamma}$ .
2. Factorizing $\tilde{\Gamma}$ using Kraus operators $K_k$ derived from a matrix $\Theta$ where $\tilde{\Gamma}_{ij} = |\Theta_{ij}|^2$ .
3. Constructing an $N^2 \times N^2$ unitary matrix $U$ whose columns are formed from these Kraus operators (extended via the Gram-Schmidt process).
4. Defining a larger PVM on the $N^2$ -dimensional space via tensor products and unitary conjugation.
Result: The entries of the original matrix $\Gamma$ are recovered by marginalizing the larger unistochastic matrix:
$\Gamma_{ij} = \sum_{k=1}^N (\Gamma_\Gamma)_{(ik),(j1)}$
Alternatively, $\Gamma_{ij}$ can be expressed as $\text{Tr}(P'_i P_{(j1)})$ , where $P'_i$ is a sum of projections in the dilated space.

Significance and Claims
The paper claims to establish a "kind of primacy of unistochastic matrices over stochastic matrices." The core assertion is that while not every stochastic matrix is unistochastic in its native dimension, every stochastic matrix can be viewed as a marginalization of a unistochastic matrix in a higher-dimensional space (specifically, a space of dimension $N^2$ ).

This result suggests a deep structural connection between classical stochastic processes and unitary quantum time evolution. The paper posits that any discrete-time stochastic process governed by a constant stochastic matrix can be associated with a unitarily evolving quantum system on a Hilbert space of dimension no greater than $N^2$ .

Potential Applications Discussed
The paper briefly outlines potential applications to discrete-time, finite-state, time-homogeneous Markov chains:

Logically Reversible Processes: For deterministic processes represented by permutation matrices, the paper notes that these are trivially unistochastic. One can define a continuous-time interpolation via $U(t) = \Sigma^t$ , identifying a Hamiltonian generator and a Schrödinger equation.
Logically Irreversible Processes: For deterministic processes that lose information (e.g., the Collatz process example provided) or general probabilistic Markov chains, the Unistochastic Theorem implies an underlying unitary evolution in a larger space. However, the paper notes that to recover the exact behavior of the original irreversible process, one must impose Hilbert-space projections at each integer time step.

The paper concludes by noting that these theorems provide a constructive framework for understanding how classical stochastic dynamics might emerge from or be embedded within unitary quantum dynamics, without inventing specific experimental proposals beyond these theoretical mappings.