CP Divisibility
CP divisibility is a map-level way to say that an open quantum evolution can be broken into legitimate quantum channels over every intermediate time interval. It is one of the cleanest finite-dimensional diagnostics of Markovianity, especially when the reduced dynamics is described by a family of quantum channels rather than by an explicit microscopic bath.
It is not the only meaning of non-Markovianity. The broader terminology is compared in What Non-Markovian Means, while Non-Markovianity Measures compares divisibility-based measures with trace-distance and entanglement-based measures. This page focuses on the divisibility criterion itself.
Intermediate Quantum Channels
Section titled “Intermediate Quantum Channels”Let
be the reduced dynamical map from an initial time to time , so that
The family is CP-divisible if, for every , there exists a completely positive trace-preserving map such that
The map is the intermediate propagator from to . The condition concerns a family of maps for a fixed initial preparation procedure. Interventions at intermediate times require additional information about the multi-time process, discussed below.
Why Complete Positivity Matters
Section titled “Why Complete Positivity Matters”Positivity alone says that states of the system remain positive. Complete positivity says the same remains true when the system is entangled with an arbitrary reference:
for every positive operator on system plus reference.
This is the correct channel condition for a subsystem whose correlations with outside degrees of freedom may matter operationally. A merely positive intermediate map may preserve system states while failing on entangled system-reference states.
Relation to Semigroups
Section titled “Relation to Semigroups”A time-homogeneous quantum dynamical semigroup is a special case:
The intermediate map is simply
which is CPTP for all when is a valid Lindblad–GKSL generator.
CP divisibility is weaker than semigroup structure. A driven or time-dependent open system can be CP-divisible without being time homogeneous:
Thus:
time-homogeneous Lindblad semigroup -> CP-divisible evolution -> each finite-time map is CPTPThe reverse implications do not generally hold.
Invertible Maps and Intermediate Propagators
Section titled “Invertible Maps and Intermediate Propagators”If is invertible as a linear map on operators, then the intermediate map is forced to be
This formula is useful for calculations, but it comes with a warning: need not be a physical channel. CP divisibility asks whether the product above is CPTP.
If is not invertible, intermediate maps may not be unique. In that case, divisibility must be formulated with care: one asks whether at least one CPTP map exists on the relevant operator space and is compatible with .
Time-Local Generator Criterion
Section titled “Time-Local Generator Criterion”For a differentiable, invertible finite-dimensional family,
defines a time-local generator:
Under the usual finite-dimensional regularity assumptions, CP divisibility is equivalent to the generator having instantaneous GKSL form with nonnegative canonical rates:
Here the canonical are traceless and Hilbert–Schmidt orthonormal, , after diagonalizing the dissipative coefficient matrix. This fixes the scale of the rates. This is the time-dependent analogue of the Lindblad–GKSL Equation. If a canonical rate becomes negative, CP divisibility fails at that time. The finite-time map from to may still be physical; the issue is the intermediate-channel interpretation.
CP Divisibility Versus P Divisibility
Section titled “CP Divisibility Versus P Divisibility”P divisibility asks only that each intermediate map be positive and trace preserving. CP divisibility asks that it be completely positive and trace preserving.
The hierarchy is:
but not conversely. The distinction matters because positivity can miss failures that appear only when the system is tested together with an entangled reference.
P divisibility is closely tied to monotonic contraction of trace distance for pairs of system states. CP divisibility is the stronger channel-level condition. See Information Backflow for the trace-distance diagnostic.
Practical Choi Test
Section titled “Practical Choi Test”In a finite-dimensional numerical calculation, one can test candidate intermediate maps using the Choi Matrix.
For an intermediate map :
- Build the superoperator for .
- Convert it to the chosen Choi convention.
- Check trace preservation.
- Check Choi positivity.
With the output-input convention used in this volume, trace preservation is
and complete positivity is
Numerically, one tests whether the smallest Choi eigenvalue is nonnegative within tolerance. See Solving Lindblad Equations for a numerical implementation.
Markovian and Non-Markovian Noise shows how to apply interval Choi tests to measured channel data, including uncertain or nearly singular maps.
Example: Pure Dephasing
Section titled “Example: Pure Dephasing”Consider a qubit dephasing map
Assume on the interval being tested. The intermediate coherence factor is
For ordinary qubit dephasing, the intermediate map is completely positive when
Thus CP divisibility requires
The unnormalized Choi matrix has eigenvalues , , , and . Thus if and , the intermediate matrix has an eigenvalue : the failure of complete positivity is explicit.
If , no inverse exists. The channel has erased the distinction between the two transverse states and . Divisibility requires that this lost distinction never return. More generally, a necessary condition for factorization is .
If coherence magnitude revives, the finite-time maps may still be CPTP, but the evolution is not CP-divisible over the revival interval.
For exponential Markovian dephasing,
the condition is satisfied.
Example: Amplitude Damping
Section titled “Example: Amplitude Damping”For zero-temperature amplitude damping, write the excited-state survival factor as
in the Markovian case. More generally, a finite-time amplitude-damping-like map has
with for each physical finite-time map.
When , the intermediate damping parameter depends on
CP divisibility requires
Thus the survival probability must not increase. A revival of signals that population or excitation has flowed back from the environment or an enlarged mode into the system, so the reduced evolution is not CP-divisible over that interval.
What Divisibility Does and Does Not Predict
Section titled “What Divisibility Does and Does Not Predict”CP divisibility says that the unperturbed one-time maps admit a channel between every pair of times. It is a useful mathematical memory criterion, but it does not say that the present reduced state contains all the information needed to predict arbitrary future experiments.
An intermediate measurement or replacement of the system state can change its correlations with the environment while leaving information in the environment itself. Future outcomes may then depend on earlier interventions even when the original map family was CP-divisible. The operational Markov condition of Pollock and collaborators tests these multi-time statistics.
A concrete example is a qubit with a static, randomly chosen detuning of zero mean and Gaussian variance . Averaging the phase gives , a CP-divisible dephasing family. Nevertheless, the same unknown acts throughout each run. An ideal pulse halfway through an interval reverses the sign of the accumulated phase and restores the coherence at its end. This echo reveals temporal correlations absent from a memoryless dephasing model fitted to the same free-decay curve.
If CP divisibility fails, no factorization into channels on the whole system operator space reproduces the specified map family. The total system–environment dynamics can still be perfectly physical. A structured mode, changing bath state, or system–environment correlations can carry the information missing from the reduced description.
Exercises
Section titled “Exercises”Semigroup implies CP divisibility
Section titled “Semigroup implies CP divisibility”Show that a Lindblad semigroup is CP-divisible.
Solution
For ,
Thus
If is a Lindblad–GKSL generator, is CPTP for every . Therefore is CPTP for every , so the semigroup is CP-divisible.
Dephasing revival
Section titled “Dephasing revival”A qubit dephasing map has and . Can the family be CP-divisible on the interval from to ?
Solution
The intermediate coherence factor is
Its magnitude is greater than , so the intermediate dephasing map would amplify coherences beyond the allowed qubit dephasing-channel range. The family is not CP-divisible on that interval, even if the individual maps at and are valid channels.
Finite-time map versus intermediate map
Section titled “Finite-time map versus intermediate map”Why can be CPTP while is not CPTP?
Solution
The map describes evolution from the original preparation to time . It can be a valid channel on the allowed initial states and references. CP divisibility asks a stronger question: after evolving to time , can the interval from to be represented by a CPTP map acting on an arbitrary present system state?
If the system and environment are correlated at time , or if the environment has changed in a way not encoded in , this intermediate-channel description can fail even though the original finite-time map remains CPTP.
P versus CP divisibility
Section titled “P versus CP divisibility”Why is P divisibility weaker than CP divisibility?
Solution
P divisibility requires intermediate maps to preserve positivity of system states. CP divisibility requires positivity even after tensoring with an identity map on an arbitrary reference. Every completely positive map is positive, so CP divisibility implies P divisibility.
The converse fails because some positive maps are not completely positive. Such maps may behave well on isolated system density matrices but fail on entangled system-reference states.
References
Section titled “References”- H.-P. Breuer, E.-M. Laine, J. Piilo, and B. Vacchini, “Colloquium: Non-Markovian dynamics in open quantum systems,” Reviews of Modern Physics 88, 021002 (2016).
- D. Chruściński, A. Kossakowski, and Á. Rivas, “Measures of non-Markovianity: Divisibility versus backflow of information,” Physical Review A 83, 052128 (2011).
- F. A. Pollock, C. Rodríguez-Rosario, T. Frauenheim, M. Paternostro, and K. Modi, “Operational Markov Condition for Quantum Processes,” Physical Review Letters 120, 040405 (2018), doi:10.1103/PhysRevLett.120.040405.
- Á. Rivas, S. F. Huelga, and M. B. Plenio, “Entanglement and non-Markovianity of quantum evolutions,” Physical Review Letters 105, 050403 (2010).
- Á. Rivas, S. F. Huelga, and M. B. Plenio, “Quantum non-Markovianity: characterization, quantification and detection,” Reports on Progress in Physics 77, 094001 (2014).
- M. M. Wolf, J. Eisert, T. S. Cubitt, and J. I. Cirac, “Assessing non-Markovian quantum dynamics,” Physical Review Letters 101, 150402 (2008).