🔢 mathematics

Free Multiplicative Convolution and Erlang Moments in Monitored Quantum Transport

This paper establishes that the transmission eigenvalues of monitored Haar products converge to a free multiplicative convolution limit, identifying the resulting spectral distribution via an explicit S-transform and deriving its Erlang-type moments to explain polynomials in Beenakker's recursion while characterizing key spectral features like the atom at unity and a real branch point.

Original authors: Joon Hyung Lee

Published 2026-07-08

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Joon Hyung Lee

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

The Big Picture: A Quantum Game of "Pass the Parcel"

Imagine a game where you have a box of quantum information (like a secret message) that needs to travel through a long chain of rooms.

The Players: In each room, there is a chaotic mixer (a random "scrambler") that spins the box around wildly. This represents the random unitary matrices ( $S_i$ ) in the paper.
The Filter: After the box is spun, it passes through a special filter (the projection $P$ ). This filter is like a sieve that lets some parts of the message through but blocks others.
The Loss: Sometimes, the filter is imperfect, or the box gets "leaky." In the paper's model, this is the "loss" or "monitoring." If the box leaks, information is lost forever.
The Journey: The box goes through $L$ of these rooms in a row. The final question is: How much of the original message made it to the end?

The paper studies the math behind this journey to predict exactly how much information survives, especially when the chain is very long and the filters are very specific.

Key Concepts Explained

1. The "Transmission Eigenvalues" (The Scorecard)

In quantum physics, we don't just ask "Did it get through?" We ask, "How well did it get through?"

The Analogy: Imagine the message is a beam of light. Some parts of the beam go straight through the filter (perfect transmission), some get scattered, and some are absorbed.
The Math: The paper looks at the "transmission eigenvalues." Think of these as a scorecard for every single piece of the message. A score of 1 means it passed perfectly; a score of 0 means it was completely blocked.
The Goal: The authors want to know the distribution of these scores. Do most scores cluster near 1? Near 0? Or are they spread out?

2. The "Monitored" Twist

In the real world, we often check on the message as it travels. This is called "monitoring."

The Analogy: Imagine a security guard checking the box at every room. Every time the guard looks, there's a chance they accidentally drop a piece of the box or block a path.
The Paper's Finding: The authors prove that if you have a fixed number of rooms ( $L$ ), the pattern of scores settles into a predictable shape. It's like rolling a die many times; eventually, you know exactly how many 1s, 2s, and 3s you will get on average.

3. The "Small-Loss" Limit (The Infinite Chain)

The paper then asks a harder question: What happens if the chain is infinitely long, but the loss in each room is tiny?

The Analogy: Imagine walking a very long distance where you lose a tiny, almost invisible speck of dust with every step. If you walk 1,000 steps, you lose a lot of dust. If you walk 1,000,000 steps, you lose a mountain of dust.
The Magic Formula: The authors found a specific mathematical formula (involving an exponential function) that describes the final shape of the scores in this "long but gentle" scenario. They call this the "Free Multiplicative Convolution."
- Simple translation: It's a special way of combining probabilities that works perfectly for quantum systems where things are "free" (independent) and multiplied together.

4. The "Erlang" Connection (The Surprise Guest)

Here is the most surprising part of the paper.

The History: A physicist named Beenakker had previously discovered a complex formula to calculate these scores. It looked like a messy sum of numbers that mathematicians call "Erlang polynomials" (usually used to model phone calls waiting in a queue).
The Paper's Explanation: The author, Joon Hyung Lee, shows that Beenakker's messy formula isn't random. It appears naturally because of the "Free Multiplicative Convolution" math.
The Metaphor: It's like someone found a complicated recipe for a cake and wrote down the ingredients in a confusing list. This paper says, "Ah, that's just a standard cake recipe! The confusing list is just the result of a specific baking technique called 'Lagrange Inversion'." The paper explains why the Erlang numbers show up.

5. The "Phase Change" (The Tipping Point)

The paper identifies a critical moment in the journey, controlled by a number called $\tau$ (tau).

The Analogy: Imagine a dam holding back water.
- Low Water ( $\tau < 1$ ): The dam is strong. There is a "perfect" path where the message gets through 100% of the time (an "atom" at score 1).
- Critical Water ( $\tau = 1$ ): The water level hits the top. The perfect path disappears.
- High Water ( $\tau > 1$ ): The dam is broken. No message gets through perfectly; everything is scattered.
The Result: The paper calculates exactly where this "tipping point" happens and how the distribution of scores changes as you cross it.

6. The "Fano Factor" (The Noise Level)

Finally, the paper calculates the "Fano factor," which measures how "noisy" or unpredictable the transmission is.

The Result: At the critical tipping point ( $\tau = 1$ ), the noise level is exactly $1 - 2/e$ (a specific number roughly equal to 0.26). This tells us exactly how much the signal fluctuates at the moment the perfect path vanishes.

Summary of What Was Proven

Fixed Chain: If you have a set number of rooms, the math is predictable and follows a specific pattern.
Long Chain: If you have a very long chain with tiny losses, the pattern converges to a beautiful, smooth curve described by a simple exponential formula.
The "Why": The complicated formulas used by other scientists (Beenakker) are actually just the result of this smooth curve being broken down into steps.
The Conjecture: The author believes (but hasn't fully proven yet) that this math works perfectly even when the chain length and the number of rooms grow together in a specific way. They provided strong evidence for this by checking the first few steps of the math.

In a nutshell: This paper takes a complex quantum physics problem about information loss, translates it into a clean mathematical language, and reveals that the messy formulas people were using are actually just the natural result of a very elegant, underlying mathematical structure.

Technical Summary: Free Multiplicative Convolution and Erlang Moments in Monitored Quantum Transport

Problem Statement
The paper investigates the statistical properties of transmission eigenvalues in a model of monitored quantum transport. Specifically, it analyzes the spectrum of the matrix $B_L^\dagger B_L$ , where $B_L = (PS_L)(PS_{L-1})\cdots(PS_1)$ . Here, $S_1, \dots, S_L$ are independent Haar-distributed unitary matrices in $U(N)$ , and $P$ is a deterministic orthogonal projection of rank $M = (1-c)N$ . The eigenvalues of $B_L^\dagger B_L$ represent the transmission eigenvalues of the system, which determine the full counting statistics of transferred charge.

Previous work by Beenakker and Chen established that the averaged transmission moments satisfy a recursion involving finite exponential sums resembling the Erlang B formula. However, the free-probabilistic origin of these Erlang-type structures remained unexplained. This paper aims to derive these moments and the limiting spectral distribution using the framework of free multiplicative convolution, bridging the gap between random matrix products and the specific combinatorial structures observed in the monitored transport model.

Methodology
The analysis proceeds through three distinct asymptotic regimes and mathematical tools:

Fixed-Length Limit ( $N \to \infty$ , $L$ fixed):
The paper utilizes the standard asymptotic freeness theorem for deterministic matrices and independent Haar conjugates. It establishes that for a fixed number of steps $L$ , the empirical spectral distribution (ESD) of $B_L^\dagger B_L$ converges in probability to the $L$ -fold free multiplicative convolution of the single-step law. The single-step law is identified as $\nu_c = (1-c)\delta_1 + c\delta_0$ , corresponding to the eigenvalues of $(PS)^\dagger(PS)$ .
Free Small-Loss Limit ( $c \to 0$ , $L \to \infty$ ):
By taking the limit where the loss parameter scales as $c = \tau/n$ and the number of steps $n \to \infty$ , the paper analyzes the convergence of the S-transform. The S-transform of the single-step law is $S_{\nu_c}(z) = \frac{1+z}{1-c+z}$ . The $n$ -fold convolution yields $S_{\nu_c^{\boxtimes n}}(z) = \left(\frac{1+z}{1-\tau/n+z}\right)^n$ , which converges locally uniformly to $S_{\mu_\tau}(z) = \exp\left(\frac{\tau}{1+z}\right)$ . This identifies the limiting measure $\mu_\tau$ as a free multiplicative convolution semigroup.
Lagrange Inversion and Combinatorics:
To recover the explicit moments $m_p(\tau) = \int x^p d\mu_\tau(x)$ , the paper employs Lagrange inversion on the inverse moment series derived from the S-transform. The inverse series is expanded using the generating function for Laguerre polynomials. This expansion allows for the explicit calculation of moments, revealing a structure involving Erlang-type polynomials $G_p(\tau)$ .
Diagonal Scaling Analysis ( $L \sim \tau N$ ):
The paper formulates a conjecture for the "diagonal" regime where the number of steps $L$ and the system size $N$ grow simultaneously such that $L/N \to \tau$ and the projection rank is $N-1$ ( $c=1/N$ ). While a rigorous proof for this regime is not provided, the paper derives low-order moment recursions (up to the third moment) to provide evidence. It highlights that the general problem requires proving the asymptotic factorization of products of normalized traces, a property not yet established for this specific diagonal scaling.

Key Contributions and Results

Identification of the Limiting Law: The paper proves that for fixed $L$ , the ESD converges to $\nu_c^{\boxtimes L}$ . Furthermore, it identifies the limiting law $\mu_\tau$ for the small-loss free-probability limit, characterized uniquely by the S-transform $S_{\mu_\tau}(z) = \exp\left(\frac{\tau}{1+z}\right)$ .
Explanation of Erlang Moments: The paper derives an explicit formula for the moments of $\mu_\tau$ :
$m_p(\tau) = e^{-p\tau} \sum_{k=0}^{p-1} \left(1 - \frac{k}{p}\right) \frac{(p\tau)^k}{k!}$
This is expressed in terms of Erlang-type polynomials $G_p(\tau)$ . This derivation provides a free-probabilistic explanation for the finite exponential sums appearing in Beenakker's recursion, linking them to the Lagrange inversion of a Laguerre expansion.
Spectral Structure: The paper characterizes the spectral properties of $\mu_\tau$ $μ_{τ}$ :
- Atom at 1: There is an atom at $x=1$ with weight $(1-\tau)_+$ . For $\tau < 1$ , perfect transmission persists; for $\tau \ge 1$ , the atom vanishes.
- Branch Point: The Stieltjes transform equation possesses a real branch point at $x^*(\tau) = \tau e^{1-\tau}$ . A phase transition occurs at $\tau=1$ , where the branch point collides with the hard edge at $x=1$ , coinciding with the disappearance of the atom.
Charge Statistics: The paper computes the first two cumulants of the charge transfer per channel, $\kappa_1(\tau) = e^{-\tau}$ and $\kappa_2(\tau) = (e^\tau - 1 - \tau)e^{-2\tau}$ . Consequently, the Fano factor is derived as $F(\tau) = 1 - (1+\tau)e^{-\tau}$ , with a specific value of $F(1) = 1 - 2/e$ at the critical monitoring strength.
Diagonal Scaling Conjecture: The paper formulates Conjecture 3, asserting that the diagonal scaling limit ( $L \sim \tau N, c=1/N$ ) converges to the same measure $\mu_\tau$ . It provides evidence by showing that the first two moments satisfy the conjectured limit and derives the recursion for the third moment, noting that the general case hinges on the factorization of trace products.

Significance and Claims
The paper claims to provide a rigorous free-probabilistic foundation for the Erlang structures observed in monitored quantum transport. It demonstrates that the complex combinatorial sums in Beenakker's recursion arise naturally from the Lagrange inversion of the S-transform of a free multiplicative convolution semigroup.

The authors explicitly state that their rigorous results apply to the fixed- $L$ limit and the free small-loss limit (where $N \to \infty$ first, then $c \to 0$ ). The diagonal scaling limit ( $L \sim N$ ) is presented as a conjecture supported by low-order moment checks. The paper does not claim to have solved the diagonal scaling problem but identifies the specific technical hurdle: the asymptotic factorization of normalized trace products. It suggests that tools from finite free probability (specifically the framework of Marcus, Spielman, and Srivastava) may offer a route to resolving this remaining problem. The work also notes that the limiting moment sequences for the complex (unitary) ensemble coincide with those of the real (orthogonal) ensemble computed by Beenakker, as the difference appears only in $1/N$ corrections.