Skip to content

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.

Let

Φt,0\Phi_{t,0}

be the reduced dynamical map from an initial time 00 to time tt, so that

ρ(t)=Φt,0ρ(0).\rho(t)=\Phi_{t,0}\rho(0).

The family is CP-divisible if, for every t≥s≥0t\ge s\ge0, there exists a completely positive trace-preserving map Φt,s\Phi_{t,s} such that

Φt,0=Φt,sΦs,0.\Phi_{t,0} = \Phi_{t,s}\Phi_{s,0}.

The map Φt,s\Phi_{t,s} is the intermediate propagator from ss to tt. If it is CPTP for every interval, then the future evolution from ss to tt can be represented as a quantum channel acting only on the present reduced state.

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:

(Φt,s⊗idR)(X)≥0(\Phi_{t,s}\otimes\mathrm{id}_R)(X)\ge0

for every positive operator XX 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.

A time-homogeneous quantum dynamical semigroup is a special case:

Φt=etL,Φt+s=ΦtΦs.\Phi_t=e^{t\mathcal L}, \qquad \Phi_{t+s}=\Phi_t\Phi_s.

The intermediate map is simply

Φt,s=e(t−s)L,\Phi_{t,s}=e^{(t-s)\mathcal L},

which is CPTP for all t≥st\ge s when L\mathcal L 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:

Φt,0≠Φt−s,0in general.\Phi_{t,0} \ne \Phi_{t-s,0} \quad \text{in general}.

Thus:

time-homogeneous Lindblad semigroup
-> CP-divisible evolution
-> each finite-time map is CPTP

The reverse implications do not generally hold.

Invertible Maps and Intermediate Propagators

Section titled “Invertible Maps and Intermediate Propagators”

If Φs,0\Phi_{s,0} is invertible as a linear map on operators, then the intermediate map is forced to be

Φt,s=Φt,0Φs,0−1.\Phi_{t,s} = \Phi_{t,0}\Phi_{s,0}^{-1}.

This formula is useful for calculations, but it comes with a warning: Φs,0−1\Phi_{s,0}^{-1} need not be a physical channel. CP divisibility asks whether the product above is CPTP.

If Φs,0\Phi_{s,0} 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 Φt,s\Phi_{t,s} exists on the relevant operator space and is compatible with Φt,0=Φt,sΦs,0\Phi_{t,0}=\Phi_{t,s}\Phi_{s,0}.

For a differentiable, invertible finite-dimensional family,

K(t)=Φ˙t,0Φt,0−1\mathcal K(t) = \dot\Phi_{t,0}\Phi_{t,0}^{-1}

defines a time-local generator:

dρdt=K(t)ρ.\frac{d\rho}{dt} = \mathcal K(t)\rho.

Under the usual finite-dimensional regularity assumptions, CP divisibility is equivalent to the generator having instantaneous GKSL form with nonnegative canonical rates:

K(t)ρ=−iℏ[H(t),ρ]+∑jγj(t)(Lj(t)ρLj†(t)−12{Lj†(t)Lj(t),ρ}),γj(t)≥0.\begin{aligned} \mathcal K(t)\rho =& - \frac{i}{\hbar}[H(t),\rho] \\ &+ \sum_j\gamma_j(t) \left( L_j(t)\rho L_j^\dagger(t) - \frac12 \{L_j^\dagger(t)L_j(t),\rho\} \right), \qquad \gamma_j(t)\ge0. \end{aligned}

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 00 to tt may still be physical; the issue is the intermediate-channel interpretation.

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:

CP divisible⟹P divisible,\text{CP divisible} \Longrightarrow \text{P divisible},

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.

In a finite-dimensional numerical calculation, one can test candidate intermediate maps using the Choi Matrix.

For an intermediate map Φt,s\Phi_{t,s}:

  1. Build the superoperator for Φt,s\Phi_{t,s}.
  2. Convert it to the chosen Choi convention.
  3. Check trace preservation.
  4. Check Choi positivity.

With the output-input convention used in this volume, trace preservation is

Tr⁡outJΦt,s=Iin,\operatorname{Tr}_{\mathrm{out}}J_{\Phi_{t,s}} = I_{\mathrm{in}},

and complete positivity is

JΦt,s≥0.J_{\Phi_{t,s}}\ge0.

Numerically, one tests whether the smallest Choi eigenvalue is nonnegative within tolerance. See Solving Lindblad Equations for the corresponding notebook contract.

Markovian and Non-Markovian Noise owns the operational QI workflow from finite channel records through interval Choi tests, singular-map cautions, confounder controls, and scoped escalation; this page retains the formal definition, generator criteria, and divisibility examples.

Consider a qubit dephasing map

ρ01(t)=η(t)ρ01(0),ρ00(t)=ρ00(0).\rho_{01}(t) = \eta(t)\rho_{01}(0), \qquad \rho_{00}(t)=\rho_{00}(0).

Assume η(t)≠0\eta(t)\ne0 on the interval being tested. The intermediate coherence factor is

η(t,s)=η(t)η(s).\eta(t,s) = \frac{\eta(t)}{\eta(s)}.

For ordinary qubit dephasing, the intermediate map is completely positive when

∣η(t,s)∣≤1.|\eta(t,s)|\le1.

Thus CP divisibility requires

∣η(t)∣≤∣η(s)∣for all t≥s.|\eta(t)|\le|\eta(s)| \qquad \text{for all }t\ge s.

If coherence magnitude revives, the finite-time maps Φt,0\Phi_{t,0} may still be CPTP, but the evolution is not CP-divisible over the revival interval.

For exponential Markovian dephasing,

η(t)=e−Γϕt,Γϕ≥0,\eta(t)=e^{-\Gamma_\phi t}, \qquad \Gamma_\phi\ge0,

the condition is satisfied.

For zero-temperature amplitude damping, write the excited-state survival factor as

q(t)=e−Γ1tq(t)=e^{-\Gamma_1t}

in the Markovian case. More generally, a finite-time amplitude-damping-like map has

ρee(t)=q(t)ρee(0),ρeg(t)=q(t) ρeg(0)\rho_{ee}(t)=q(t)\rho_{ee}(0), \qquad \rho_{eg}(t)=\sqrt{q(t)}\,\rho_{eg}(0)

with 0≤q(t)≤10\le q(t)\le1 for each physical finite-time map.

When q(s)>0q(s)>0, the intermediate damping parameter depends on

q(t)q(s).\frac{q(t)}{q(s)}.

CP divisibility requires

0≤q(t)q(s)≤1for all t≥s.0\le\frac{q(t)}{q(s)}\le1 \qquad \text{for all }t\ge s.

Thus the survival probability must not increase. A revival of q(t)q(t) 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.

CP divisibility asks whether the reduced state at time ss is a sufficient quantum state for predicting the future interval s→ts\to t by a channel. If the answer is yes for every interval, no extra memory variable is needed at the level of quantum operations.

If CP divisibility fails, the present reduced state is not enough to represent the future as a universally valid channel on arbitrary system-reference inputs. The missing information may live in:

  • system-environment correlations;
  • a changed environment state;
  • a structured reservoir mode;
  • a classical or quantum memory register;
  • an initial preparation dependence not captured by ρS(s)\rho_S(s).

The failure is a diagnostic of reduced-description memory, not a statement that the total system violates quantum mechanics.

  • Equating CP divisibility with time-homogeneous semigroup structure.
  • Assuming that every CPTP finite-time map belongs to a CP-divisible family.
  • Using Φt,s=Φt,0Φs,0−1\Phi_{t,s}=\Phi_{t,0}\Phi_{s,0}^{-1} without checking conditioning or noninvertibility.
  • Treating a negative instantaneous rate as proof that the finite-time map is not completely positive.
  • Checking positivity on a few states but not Choi positivity of the intermediate map.
  • Ignoring the distinction between P divisibility and CP divisibility.
  • Forgetting that CP divisibility is a property of a family of maps, not of one isolated channel.

Show that a Lindblad semigroup Φt=etL\Phi_t=e^{t\mathcal L} is CP-divisible.

Solution

For t≥st\ge s,

Φt=etL=e(t−s)LesL.\Phi_t = e^{t\mathcal L} = e^{(t-s)\mathcal L}e^{s\mathcal L}.

Thus

Φt,s=e(t−s)L.\Phi_{t,s}=e^{(t-s)\mathcal L}.

If L\mathcal L is a Lindblad–GKSL generator, eτLe^{\tau\mathcal L} is CPTP for every τ≥0\tau\ge0. Therefore Φt,s\Phi_{t,s} is CPTP for every t≥st\ge s, so the semigroup is CP-divisible.

A qubit dephasing map has η(1)=0.3\eta(1)=0.3 and η(2)=0.5\eta(2)=0.5. Can the family be CP-divisible on the interval from 11 to 22?

Solution

The intermediate coherence factor is

η(2,1)=η(2)η(1)=0.50.3.\eta(2,1) = \frac{\eta(2)}{\eta(1)} = \frac{0.5}{0.3}.

Its magnitude is greater than 11, 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 t=1t=1 and t=2t=2 are valid channels.

Why can Φt,0\Phi_{t,0} be CPTP while Φt,s\Phi_{t,s} is not CPTP?

Solution

The map Φt,0\Phi_{t,0} describes evolution from the original preparation to time tt. It can be a valid channel on the allowed initial states and references. CP divisibility asks a stronger question: after evolving to time ss, can the interval from ss to tt be represented by a CPTP map acting on an arbitrary present system state?

If the system and environment are correlated at time ss, or if the environment has changed in a way not encoded in ρS(s)\rho_S(s), this intermediate-channel description can fail even though the original finite-time map remains CPTP.

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.

  • Á. Rivas, S. F. Huelga, and M. B. Plenio, “Entanglement and non-Markovianity of quantum evolutions,” Physical Review Letters 105, 050403 (2010).
  • M. M. Wolf, J. Eisert, T. S. Cubitt, and J. I. Cirac, “Assessing non-Markovian quantum dynamics,” Physical Review Letters 101, 150402 (2008).
  • D. Chruściński, A. Kossakowski, and Á. Rivas, “Measures of non-Markovianity: Divisibility versus backflow of information,” Physical Review A 83, 052128 (2011).
  • Á. Rivas, S. F. Huelga, and M. B. Plenio, “Quantum non-Markovianity: characterization, quantification and detection,” Reports on Progress in Physics 77, 094001 (2014).
  • 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).