Non-Markovian memory kernels
Use an exact finite-environment model to separate valid initial-time channels, divisibility, and information revival.
On this page
The question for today
What you’ll understand
- Solve a simple convolution equation and check its units.
- Recognize a valid channel with non-positive intermediate propagation.
- Use trace-distance revival as a specified memory witness without equating all definitions.
Memory means that discarding the environment can hide information needed for later predictions. It does not mean that quantum states stop obeying probability rules. With a fixed uncorrelated initial preparation, the exact map from that initial time remains completely positive and trace preserving even when a semigroup description fails. A small exactly solvable environment makes this distinction visible without an uncontrolled approximation to a large reservoir.
An exact reversible bath can return coherence
Take a system qubit and one environment qubit with interaction Hamiltonian , and prepare the environment in its plus state. Remove any commuting free Hamiltonians by changing frame. Conditional environment rotations give the overlap , multiplying the system off-diagonal entries while leaving its populations unchanged. This is exact for the stated finite composite, with no Born or Markov approximation.
An equivalent channel is the equal mixture of system phase rotations generated by the two environment Z eigenvalues. Consequently every initial-time map is a valid channel even when the cosine becomes negative. A negative coherence factor is a phase reversal, not a negative population. The magnitude returns to one after reaching zero, so local purity can revive. A one-qubit environment is not a thermal reservoir causing irreversible decay; its finite information capacity makes recurrence central rather than negligible.
A time-local equation can still carry memory
Where the cosine is nonzero, divide its derivative by itself to obtain a time-local dephasing equation. The resulting rate becomes negative during intervals of coherence revival. This does not invalidate the original channel from the initial preparation. It instead signals that intermediate propagation cannot always be represented as a completely positive dephasing channel acting on arbitrary inputs. At the cosine zeros, the reduced map is noninvertible and the time-local rate becomes singular even though the exact composite evolution is smooth.
The convolution description avoids that singular inverse by retaining a history integral. More general projection-operator equations can include an inhomogeneous term from initial correlations, as well as complicated superoperator kernels. Merely choosing a decaying kernel does not guarantee complete positivity; an approximate memory equation must be checked just as carefully as an approximate local equation. Conversely, writing an equation locally in time does not establish that it represents a memoryless physical process.
Define which meaning of memory is being tested
Completely positive divisibility asks whether each later map factors through an earlier map with a valid intermediate channel. Trace-distance backflow instead asks whether some initially distinct states become more distinguishable over an interval. Contractivity of positive trace-preserving propagation makes an increase a useful witness, but the two criteria are not equivalent for every system dimension and process. Multi-time conditional statistics provide still more information, so a label of non-Markovianity should name the operational or mathematical criterion.
For this finite-bath example, opposite equatorial inputs become the same local state at a zero of the cosine. Later they become distinguishable again. No map on that single identical intermediate state can recover two different outputs without additional information, demonstrating why the environment matters. Resetting the environment at the intermediate time changes the experiment and can eliminate this return. Parameter changes in a teaching instrument likewise should not be interpreted as implementing a continuous physical bath protocol.
Work it through
Coherence loss followed by a complete revival
Set in the finite-environment model and compare initial system states and . Calculate their trace distance at , , and . Explain the intermediate-map obstruction.
The two reduced states have equal populations but opposite real coherences, each of magnitude . Their difference has eigenvalues , so trace distance is .
At the three times, the cosine is , zero, and . The distances are therefore , zero, and one. At the final time the coherence signs have reversed but the states are again perfectly distinguishable.
At both reduced states equal . A channel acting only on that common input must give one common output, whereas the actual later outputs differ. Correlations with the retained environment supply the missing distinction.
The distances are 0.5, 0, and 1. The full initial-time maps stay CPTP, while an autonomous system-only intermediate channel cannot describe the revival through the zero-distance time.
The living notebook
Explore the model
Interactive lab · markov
Contrast recurrence with classical periodicity
Reset and set both controls to p = 1 and q = 1. Predict state-1 probability 1 after one Step and 0 after two Steps, despite stationary probability 1/2. This discrete chain is perfectly Markovian and periodic. It has no quantum coherence, bath, or trace-distance comparison of two preparations. Its oscillation shows why a wavy single-population trace alone cannot diagnose quantum memory.
- P(state 1) at step 0
- 0%
- Stationary P(state 1)
- 60%
- Chain behavior
- Monotone convergence
Exact finite-step probabilities for a two-state chain starting in state 0, not sampled trajectories. Playback advances two transitions per second. When p = q = 0 every distribution is stationary; when p = q = 1 the chain alternates forever. A single zero transition creates an absorbing state. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forA revival witness must specify what revives and under which maps; periodic populations alone are insufficient.
Pause & reason
Check your understanding
Your turn
Try it yourself
Set and start the system in . Find the coherence, purity, and local dephasing rate at and .
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
The arguments gt are π/3 and 2π/3. Keep the sign of cosine for coherence, and square it for purity.
Compare with the solution
At the first time , so ; at the second , so . Both states have purity and positive eigenvalues . The rates are and . The second lies in a revival interval, while the density matrices remain valid.
Keep the idea
Take it with you
- A valid initial-time channel need not admit CPTP intermediate maps.
- A time-local equation can have memory and singular rates.
- Trace-distance revival is a specified witness, not a universal synonym for every memory definition.
Read further
Original sources and deeper explanations to follow at your own pace.
- Breuer, Laine and Piilo, Measure for the Degree of Non-Markovian Behavior of Quantum Processes in Open Systems, trace-distance definition and dephasing example
- Gernot Schaller, Quantum Information and Quantum Computation, §4.2, equations 4.21–4.29: reduced history integral and bath correlation function, pp. 55–56
- Guarnieri, Smirne and Vacchini, Quantum Regression Theorem and Non-Markovianity of Quantum Dynamics, §§II–IV: divisibility, regression, and dephasing
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.