⚛️ quantum physics

Efficient measure of information backflow with a quasistochastic process

This paper proposes an efficient, state-independent measure of information backflow in open quantum systems by leveraging quasiprobability representations and majorization theory, thereby overcoming the computational challenges of traditional optimization-based methods while accurately characterizing non-Markovian dynamics.

Original authors: Kelvin Onggadinata, Teck Seng Koh

Published 2026-04-01

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Kelvin Onggadinata, Teck Seng Koh

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 you are watching a cup of hot coffee cool down on a table. In a normal, predictable world (what physicists call a "Markovian" process), the heat flows out of the coffee into the air and never comes back. The coffee just gets cooler and cooler. The "information" about how hot the coffee was is lost to the environment forever.

But in the strange world of quantum mechanics (the physics of atoms and subatomic particles), things can get weird. Sometimes, the environment doesn't just absorb information; it can spit it back. The coffee might suddenly get a tiny bit hotter again because the air around it gave the heat back. This is called non-Markovianity, or "memory effects." It's like the universe has a short-term memory and occasionally forgets to let go of things.

The Problem: Finding the "Backflow" is Hard

Scientists have been trying to build a tool to detect when this "information backflow" happens. The old way of doing this is like trying to find a leak in a massive, complex dam by testing every single drop of water.

To use the old methods, you have to:

Pick two specific quantum states (like two different arrangements of atoms).
Watch them evolve.
Check if they become more distinguishable (more different) over time.
The Catch: You have to repeat this for every possible pair of states to be sure you haven't missed a leak. This is mathematically exhausting and computationally impossible for complex systems. It's like trying to find a needle in a haystack by checking every single piece of hay one by one.

The New Solution: A "Magic Mirror"

The authors of this paper, Kelvin Onggadinata and Teck Seng Koh, have invented a much smarter way to find these leaks. They didn't try to track the water drops; instead, they built a magic mirror that shows the whole dam at once.

Here is how their new method works, using simple analogies:

1. The Quasiprobability Map (The Magic Mirror)

In quantum mechanics, we usually describe things using complex math that doesn't look like normal numbers. The authors use a technique called Quasiprobability Representation.

Analogy: Imagine you have a 3D sculpture (the quantum system). Usually, you can only see it from one angle, and it looks like a weird shadow. This new method is like putting the sculpture in a special room with mirrors that flatten it into a 2D map.
The Twist: In this 2D map, some numbers can be negative (like owing money). These "negative probabilities" are the signature of quantum weirdness. But the authors found a way to use this map to track the system's evolution as if it were a simple flow chart.

2. The "Shuffle" Test (Majorization)

Once the system is on this 2D map, the authors look at how the "disorder" (entropy) changes.

Analogy: Imagine you have a deck of cards. If you shuffle them perfectly (Markovian), the deck gets more mixed up, and you can never un-shuffle it. The order is lost forever.
The Test: The authors check if the "shuffling" process follows a strict rule: The deck should always get more mixed up, never less.
If the deck suddenly becomes more ordered (the information flows back from the environment), the rule is broken. That's your signal: Non-Markovianity detected!

3. The "No-Needle" Advantage

The best part of their new tool is that you don't need to test specific pairs of states (the needles).

Analogy: Instead of testing every drop of water, they just look at the shape of the pipe itself. If the pipe bends in a certain way, they know for a fact that water must be flowing backward, regardless of what kind of water is inside.
The Result: Their formula is a simple calculation based on the "shape" of the evolution. No optimization, no guessing, no checking millions of scenarios. It's a direct, state-independent witness.

Why This Matters

Speed and Efficiency: For complex quantum computers (which have many "qubits" or quantum bits), the old methods would take forever to calculate. This new method is fast and efficient, like switching from a hand-cranked calculator to a supercomputer.
Understanding the Basics: It helps scientists understand the fundamental difference between the classical world (where things just dissipate) and the quantum world (where things can remember and bounce back).
Practical Application: If you are building a quantum computer, you need to know when your system is "leaking" information or when it's "remembering" things in a way that causes errors. This tool helps engineers spot those glitches instantly.

The Bottom Line

The authors have created a universal "lie detector" for quantum memory. Instead of interrogating every single suspect (every possible quantum state), they simply look at the behavior of the system as a whole. If the system's "disorder" stops increasing and starts decreasing, the detector goes off, telling us that information has flowed back from the environment.

It's a simpler, faster, and more elegant way to understand how the quantum world remembers its past.

1. Problem Statement

The characterization and quantification of non-Markovian dynamics in open quantum systems are critical for quantum computing and communication. Non-Markovianity is characterized by a "memory effect" where information flows back from the environment to the system, temporarily reviving quantum features.

Current Limitations: The standard approach to detecting information backflow relies on the Breuer-Laine-Piilo (BLP) measure, which tracks the increase in the trace distance between two quantum states over time.
- The BLP measure requires optimization over the entire state space (finding the pair of initial states that maximizes the information backflow).
- This optimization is analytically challenging and numerically demanding, particularly for high-dimensional systems.
Goal: The authors aim to develop an efficient, state-independent witness and measure of information backflow that avoids the need for state-space optimization.

2. Methodology

The authors propose a novel framework based on Quasiprobability Representation (QPR) and the theory of majorization.

Quasiprobability Representation (QPR):
- Quantum states, channels, and measurements are mapped to real-valued vectors and matrices using a "frame" and its "dual frame."
- In this representation, a quantum channel $\Lambda_t$ is mapped to a quasistochastic matrix $S_{\Lambda_t}$ . If the channel is unital, this matrix becomes quasibistochastic (rows and columns sum to 1).
- Unlike standard probability distributions, these quasidistributions can contain negative values, which serve as a signature of nonclassicality.
Majorization and Entropy:
- The authors utilize recent advances in the majorization theory of quasiprobabilities. Specifically, they employ the Rényi- $\alpha$ entropy ( $H_\alpha$ ).
- They select $\alpha = 2$ (Collision Entropy), which allows for a compact mathematical formulation.
- Key Theoretical Insight: For a Markovian process, the evolution of the quasiprobability vector $q(t) = S_{\Lambda_t} q(0)$ must satisfy a monotonicity condition regarding the disorder (entropy) of the state.
Derivation of the Witness:
- The authors show that for Markovian dynamics, the Rényi-2 entropy must be non-decreasing (or the "purity" non-increasing) in a specific sense.
- By expressing the Rényi-2 entropy as $H_2(q) = -\log(q^T q)$ , the condition for Markovianity is reduced to a matrix inequality involving the dynamical map:
  $(S_{\Lambda_t})^T S_{\Lambda_t} \leq \mathbb{1}$
- This implies that the eigenvalues of the matrix product $(S_{\Lambda_t})^T S_{\Lambda_t}$ must be monotonically decreasing over time.
- Violation: If the eigenvalues increase at any point, it signifies a violation of the Markovian condition, indicating information backflow.

3. Key Contributions

State-Independent Measure: The proposed measure, denoted as $N$ , depends solely on the dynamical map ( $S_{\Lambda_t}$ ) and not on specific initial quantum states. This eliminates the computationally expensive optimization over the state space required by the BLP measure.
Analytical Simplicity: The measure is defined via the time derivative of the norm of the matrix product:
$N = \int_{\zeta > 0} dt \, \zeta(t), \quad \text{where} \quad \zeta(t) = \frac{d}{dt} \left\| (S_{\Lambda_t})^T S_{\Lambda_t} \right\|$
Frame Independence: The authors prove that the measure is invariant under different choices of minimal frame representations (e.g., different quasiprobability bases), ensuring the robustness of the result.
Foundational Insight: The work connects the concept of time-reversal in quantum mechanics to the transpose operation in the QPR framework, suggesting a unified view of classical and quantum reversibility.

4. Results and Examples

The authors validated their measure using three paradigmatic examples, comparing the results with known BLP and divisibility criteria:

A. Pure Decoherence Model:
- Applied to a qubit in a bosonic bath.
- Result: The derived non-Markovianity criterion ( $\gamma(t) < 0$ ) perfectly matches the BLP measure and P-divisibility conditions.
- Value: While the condition for non-Markovianity is the same, the calculated value of the measure $N$ differs from the BLP measure, offering a distinct quantification of memory effects.
B. Dissipation Model:
- Applied to a system with population dissipation.
- Result: The witness again coincides with the BLP and CP-divisibility criteria for the onset of non-Markovianity ( $\gamma(t) < 0$ ).
C. Random Unitary Channel (Qubit and Qutrit):
- Qubit ( $d=2$ ): The derived conditions match BLP and P-divisibility but differ from CP-divisibility (highlighting the hierarchy where information backflow is a weaker condition than divisibility).
- Qutrit ( $d=3$ ): The authors derived necessary and sufficient conditions for Markovianity in a random unitary channel for a qutrit system.
- Significance: Previous BLP-based characterizations for qutrits were only sufficient (not necessary) and highly non-trivial. This new method provides a complete characterization without optimization.

5. Significance and Discussion

Efficiency: The primary significance is the removal of the optimization bottleneck. This makes the quantification of non-Markovianity feasible for high-dimensional systems where state-space optimization is intractable.
Nonclassicality and Negativity: The paper discusses the role of negativity in the quasistochastic map. Interestingly, the authors find that while the dynamical map $S_{\Lambda_t}$ can be represented non-negatively even in non-Markovian regimes, the generator of the evolution ( $L$ ) often exhibits negative off-diagonal elements when non-Markovianity occurs. This suggests that negativity in the generator is a necessary (but not sufficient) condition for non-Markovianity.
Foundational Implications: The work bridges the gap between classical stochastic processes and quantum dynamics. It suggests that the transpose operation in QPR serves as a unified mathematical tool for "time-reversal" in both classical and quantum theories, linking information backflow to the properties of the dynamical map's transpose.
Future Directions: The authors suggest that this framework could be extended to study quantum regression formulas using Kirkwood-Dirac quasiprobabilities, further deepening the understanding of quantum memory effects.

In conclusion, this paper provides a powerful, computationally efficient, and theoretically robust tool for detecting and quantifying information backflow in open quantum systems, advancing the field beyond the limitations of traditional trace-distance-based methods.