← Latest papers
⚛️ quantum physics

Lecture notes on classical and quantum non-Markovianity

These lecture notes introduce graduate students to classical and quantum non-Markovianity by emphasizing the correspondence between classical stochastic concepts and quantum dynamical maps, with a specific focus on characterizations based on channel divisibility and state distinguishability.

Original authors: Graeme Pleasance

Published 2026-07-09
📖 6 min read🧠 Deep dive

Original authors: Graeme Pleasance

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: Memory vs. Forgetting

Imagine you are watching a movie.

  • Markovian (Memoryless): This is like a movie where the next scene depends only on what is happening right now. If the hero is currently running, the next scene is just "running." The movie doesn't care if the hero was sad five minutes ago or if it rained yesterday. The system has "forgotten" its past.
  • Non-Markovian (With Memory): This is like a movie where the next scene depends on the whole story so far. If the hero is running, it might be because they were chased by a dragon three scenes ago. The system "remembers" its history, and that memory changes what happens next.

This paper is a guide for students trying to understand how to tell the difference between these two types of behavior, specifically in the weird world of Quantum Mechanics (where particles act like waves and probabilities) compared to the Classical World (where coins flip and balls roll).

Part 1: The Classical World (The Coin Flip)

The paper starts by reviewing how we handle "normal" randomness, like flipping a coin or a drunk person walking on a grid (a "random walk").

  • The Rule of Thumb: In a standard "Markov" process, the future is determined solely by the present. If you know where the drunk person is right now, you don't need to know where they were an hour ago to predict where they will be in the next minute.
  • The "Divisibility" Test: The authors introduce a mathematical test called P-divisibility. Imagine you have a video of the drunk person walking. If you can cut the video into any two chunks (from time A to B, and B to C) and the transition from A to C is just the combination of A to B and B to C, the process is "divisible" and memoryless.
  • The Twist: The paper shows that sometimes a process looks divisible (you can mathematically chop it up), but it's actually non-Markovian. It's like a magic trick where the pieces fit together mathematically, but the story inside the pieces implies the character is remembering things they shouldn't.

Part 2: The Quantum World (The Spooky Box)

Now, the paper moves to Open Quantum Systems. Imagine a quantum particle (the "System") inside a box, but the box is leaking and interacting with the air outside (the "Environment").

  • The Problem with Quantum Memory: In the classical world, you can easily define "memory" by looking at probabilities. In the quantum world, this is tricky. If you try to measure a quantum particle to see its history, the act of measuring changes the particle. It's like trying to check if a soufflé is done by poking it; the poking ruins the soufflé. Because of this, the standard definition of "Markovian" (forgetting the past) doesn't work perfectly for quantum systems.

Part 3: Two Ways to Spot "Memory" in Quantum Systems

Since the old definition doesn't work, the paper focuses on two modern ways to detect if a quantum system is remembering its past (Non-Markovian) or forgetting it (Markovian).

1. The "Divisibility" Check (The RHP Method)

  • The Analogy: Imagine you have a machine that transforms a piece of paper (the quantum state).
  • The Test: If you can break the machine's operation into two steps (Step A then Step B) and both steps are physically valid machines that could exist on their own, the process is Markovian.
  • The Failure: If you try to break the process into steps, and one of those steps turns out to be "impossible" (mathematically, it would create negative probabilities or break the laws of physics), then the system has Non-Markovian memory. The system is "holding onto" information from the past that prevents the process from being cleanly chopped up.
  • The Paper's Claim: The authors show that if the "decay rate" (how fast the system loses energy or information) ever goes negative, the system is Non-Markovian. It's like a bank account where you suddenly get money back from the bank because you over-withdrew earlier. That "negative decay" means information is flowing back from the environment to the system.

2. The "Distinguishability" Check (The BLP Method)

  • The Analogy: Imagine you have two different quantum coins, Coin A and Coin B. You want to tell them apart.
  • The Test: In a Markovian world, as time passes, the coins get more mixed up with the environment. They become harder to tell apart. The "distance" between them shrinks steadily.
  • The Failure: In a Non-Markovian world, the coins might get mixed up, but then the environment "spits" some information back out. Suddenly, the coins become easier to tell apart again. The "distance" between them increases.
  • The Paper's Claim: If the ability to tell two quantum states apart ever increases over time, the system is Non-Markovian. This is called "Information Backflow." It's like a conversation where you forget what someone said, but then they remind you, and suddenly you remember everything clearly again.

Part 4: The Spin-Boson Example (The Real-World Test)

To prove these ideas work, the authors apply them to a famous model called the Spin-Boson model.

  • The Setup: Imagine a tiny magnet (a "spin" or qubit) interacting with a bath of vibrating springs (bosons).
  • The Result:
    • If the springs are very weak and fast (like a gentle breeze), the magnet forgets its past quickly. The decay rate is always positive. Result: Markovian.
    • If the springs are strong and slow (like a heavy, sticky fluid), the magnet gets "stuck" in its history. The decay rate swings back and forth, even becoming negative. Result: Non-Markovian.
  • The Conclusion: Both the "Divisibility" test and the "Distinguishability" test agree on this model. When the system remembers (Non-Markovian), the decay rate is negative, and the distinguishability of states grows.

Summary of Key Takeaways

  1. Classical vs. Quantum: In classical physics, "memory" is easy to define. In quantum physics, it's hard because measuring the past changes the present.
  2. Two Definitions: The paper focuses on two main ways to define quantum memory:
    • CP-Divisibility: Can we mathematically chop the process into valid, physical steps? (If no, it has memory).
    • State Distinguishability: Do two quantum states get harder to tell apart over time? (If they get easier to tell apart, information is flowing back, and it has memory).
  3. The Connection: The paper proves that for many common systems, these two definitions are actually saying the same thing: if the system "remembers," the decay rate becomes negative, and information flows back from the environment.

What the paper does NOT do:
The paper is a theoretical lecture note. It does not discuss clinical applications, medical uses, or specific future technologies. It strictly defines the mathematical rules for identifying memory in quantum systems and proves how these rules apply to a specific model of a magnet interacting with vibrations.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →