Finding the Kraus decomposition from a master equation and vice versa

By Erika Andersson, J. D. Cresser, Michael J. W. Hall. 2007

155 citations recorded by the source corpus.

For any master equation which is local in time, whether Markovian, non-Markovian, of Lindblad form or not, a general procedure is given for constructing the corresponding linear map from the initial state to the state at time t, including its Kraus-type representations. Formally, this is equivalent to solving the master equation. For an N-dimensional Hilbert space it requires (i) solving a first order N 2×N 2 matrix time evolution (to obtain the completely positive map), and (ii) diagonalizing a related N 2×N 2 matrix (to obtain a Kraus-type representation). Conversely, for a given time-dependent linear map, a necessary and sufficient condition is given for the existence of a corresponding master equation, where the (not necessarily unique) form of this equation is explicitly determined. It is shown that a “best possible” master equation may always be defined, for approximating the evolution in the case that no exact master equation exists. Examples involving qubits are given.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/87f2c33c377598b369c070511463ec8d4a850e70

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Li Li
  2. Michael J. W. Hall
  3. Howard M. Wiseman
  4. Heng Fan
  5. Yi Peng
  6. Yu-Ran Zhang
  7. Jieci Wang
  8. Ming‐Liang Hu

In Computational Theory and Mathematics

  1. Heng Fan
  2. Ming‐Liang Hu

Citations in the corpus