The operator sum representation of open quantum system dynamics

From amowiki
Revision as of 13:26, 11 March 2009 by imported>Ichuang (→‎OSR: examples)
Jump to navigation Jump to search

The operator sum representation of open quantum system dynamics

Modern atomic physics rests on engineering the physics of quantum systems, and one of the greatest parts of this challenge is control of decoherence. Beginning with the ideas born from manipulating spontaneous emission rates with optical cavities, the study of open quantum system dynamics has grown to encompass laser physics, cooling of atoms, and nascent thoughts on quantum thermodynamics. And one of the most important of the new reaches of this study is the development of quantum error correction, by which open quantum system dynamics can be reversed, under certain circumstances.

The master equation and quantum trajectories approaches to this study have in common their use of continuous time in describing open quantum system dynamics. However, it is often not important to be able to know the state of a system at all times. In fact, in increasingly many experiments, what is needed is knowledge of the state only at discrete times, such as before and after some operation. For example, in quantum information science, such operations can be individual logic gates, or full communication protocols such as teleportation or entanglement distillation.

Very generally, a discrete time picture is exceedingly useful in modeling and analyzing noisy channels, such as are used in communication. In the world of classical physics, Shannon's theory of how to communicate reliably over noisy channels led to the development of modern information theory, and error correction codes. Analogously, quantum information theory has developed to describe how to communicate reliably over noisy quantum channels, with a slew of novel quantum error correction codes. Among other things, such codes allow reliable information processing systems to be realized from unreliable components, provided the component failure probabilities are beneath a fixed threshold set by code properties.

In this section, we present a discrete time model of open quantum system dynamics, known as the operator sum representation ("OSR"). One nice feature of this representation is that the Lindblad form of the master equation can be derived from it, as we show. The OSR also provides a comprehensive way to grasp the different unravelings possible for open system dynamics, as we describe with examples demonstrating quantum error correction.

OSR: definition and properties

Suppose the system under study is described by state . It interacts with an environment, initially in some state , through a unitary interaction , producing

Suppose the output state of the environment is measured in the basis (all mutually orthogonal). Since the environment is doing the measuring, the measurement results are left unknown, but this does not change the fact that the resulting state of the system is given by averaging over the environment's measurement results. Using the notation

we can write the resulting system as the statistical mixture of states

Let be the operator (in the Hilbert space of the system) given by the partial matrix element over the environment with and . The output state of the system is thus

where is the input system state. Note that by construction,

where is the identity operator acting in the Hilbert space of the system.

Eq.(\ref{eq:osr}) is known as the operator sum representation, and the are known as operation elements, or {\em Kraus operators}. When the operation elements satisfy , a constraint known as the completeness relation, the corresponding satisfies three important properties, that \begin{itemize}

  • for all with .
  • is manifestly convex and linear, that is
  • is completely positive, meaning that if

then (it is a positive operator), and for any (acting on just a part of system still produces a legitimate state). \end{itemize} Proving that leaves the trace unchanged is easy, but providing complete positivity is outside of the scope of this brief introduction (see, for example, Chapter 8 of Nielsen and Chuang, for a proof). Moreover, it turns out that if a quantum operation is {\em defined} as being a map satisfying these three properties, then it must have an operator sum representation, so the OSR is indeed very fundamental.

The practical importance of the operator sum representation lies in the fact that any set of operators satisfying defines a valid OSR, and that all interactions with an environment can be described by some set of operation elements satisfying . It is also useful to know that for a system of dimensions, the maximum number of operation elements needed to describe an arbitrary interaction with an environment is .

OSR: examples

Let us consider some examples of some simple operator sum representations of interactions.

1. When there is no interaction with an environment, the operation element is a unitary transform , such that .

2. When the interaction is measurement with projectors , then .

3. Suppose the interaction is

The operator sum representaton of open quantum system dynamics-pdamp-circ2.png

where the box with line represents a controlled rotation about the axis by angle , and the "environment" is modeled as a single qubit. The resulting operation elements are

where . Direct calculations shows that

which is the transformation expected for pure phase damping ().

4. For amplitude damping of a single qubit, the operation elements are similar to those for phase damping:

Unitary degree of freedom in the operator sum representation

Multiple choices of operation elements lead to the same density matrix mapping . This is a consequence of the infinite number of unravelings of density matrices into pure state ensembles, manifested in this representation by the fact that the map cannot depend on the environment's choice of measurement basis:

The operator sum representaton of open quantum system dynamics-quantum-operation-freedom.png

In this diagram, the unitary transform inserted before the environment's measurement parameterizes this unitary degree of freedom in the OSR. It leads to the fact that if are a valid set of operation elements for , then

also give a valid set of operation elements, for any unitary matrix with elements .

An example of this is the fact that

defines an OSR equivalent to that given earlier, for phase damping, for appropriate choice of .

From OSR to master equation in Lindblad form

We have previously seen that open quantum systems can be described by a master equation in Lindblad form, namely

where are jump operators. It has been stated that this form is necessary to guarantee physical validity (trace preservation and complete positivity), but no derivation origin has been given.

A master equation in Lindblad form can be derived from an operator sum representation for an interaction with an environment, in the following way. Let , parameterize the strength of the interaction, such that we may approximate

in the same spirit of coarse-grained evolution in which master equations are derived. Without loss of generality, one of the operation elements for should be of the order of unity, such that to leading order,

where is independent of .

Define and as being the hermitean and anti-hermitean parts of , such that describes the first-order Hamiltonian evolution under . Specifically, to leading order in ,

Because of the completeness relation ,

The terms in the OSR with are of order , so that we may define

Thus, to leading order in , we may express in terms of as

giving

Finally, this produces the coarse-grained equation of motion

which is the desired master equation in Lindblad form.

The key steps to keep in mind, in this identification between the operator sum representation and the master equation, are

  • The Hamiltonian changes from the original system Hamiltonian to becoming , where is derived from the unity-order operation element in . Often, may be small, causing a small renormalization of energies, such as in the Lamb shift associated with spontaneous emission decay. However, it can also be substantial and not commute with , as demonstrated by other unravelings of spontaneous emission.
  • The remaining operation elements in define the jump operators, when expanded to leading order in , for small interaction parameter .

Quantum error correction

Perhaps one of the most surprising and fundamentally interesting results from quantum information is quantum error correction. Classical error correction is a process used to reverse random errors which happen, say in a communication channel, which undesirably distorts a message being transmitted. This can be accomplished, for example, using redundancy, say by repeating the transmission of a given message three or more times, and using majority voting to recover the original at the receiver.

However, before 1995, it was believed that such an error correction concept could not apply to quantum systems, because \begin{itemize}

  • Quantum states collapse when measured
  • Errors are continuous
  • Quantum states cannot be cloned

\end{itemize} In particular, for example, one cannot encode a quantum state against errors simply by replicating it three or more times, as . Such perfect "cloning" is known to be fundamentally impossible within the framework of quantum mechanics, and furthermore, even with such a state in hand, errors to cannot in general be corrected simply by using redundant copies.

Nevertheless, it turns out there are ways around all of these objections. The part of the Hilbert space containing the information about the state you wish to preserve need not be measured; only the effect of the environment need be determined by a measurement. And using entangled states allow errors to be made orthogonal and distinguishable; entanglement also replaces the role played by redundant copies in classical error correction.

Here, we illustrate the basic ideas behind quantum error correction using a set of specific examples.

3-qubit bit-flip code

Suppose errors occur to a qubit as described by the quantum operation , where is a probability. This process is known as a "bit-flip" channel, because the qubit is left alone with probability , and flipped by with probability . We provide in the following an encoding and recovery method, allowing bit-flip errors on an unknown qubit to be corrected.

The first key idea is to encode using entangled states, rather than using redundancy. Define "logical zero" as and "logical one" as , and suppose instead of sending through the channel, instead we send . Much like for a classical three-bit majority voting code, we find that the effect of the quantum noise process (acting independently and identically on the three qubits in the code) performs the transformation

where the probabilities of each pathway are given in the column on the right. The output state of the channel is the resulting statistical mixture of states.

Classical error correction would proceed by measuring the noisy output, processing the measurement, then reconstructing the original with high fidelity. Quantum error correction, however, must be more subtle. Here is the second key idea: instead of projectively measuring the output state, we perform partial measurements, to determine only the effect of the environment, and leave the encoded qubit untouched, with high probability.

Specifically, suppose that pairs of qubits can be measured, to determine if they are identical (either or , or opposite, or ), without revealing the specific values of the qubits. Define two such parity measurements,

corresponding to measuring the parities of the first and second qubits, and the second and third qubits, respectively. Let the output of these measurements be if the two qubits are identical, and otherwise.

Considering just the four high probability output states, we find the following:

where the second and third columns give the measurement results for and , known as the syndrome. Note that none of the measurement results distinguish between and , and thus the encoded qubit is left intact. After doing this measurement, we can recover the initial state by applying the unitary transformation given in the fourth column.

The final output state after performing this correction procedure is not perfect, because of the probability of two or more errors occurring. Quantitatively, the fidelity of the reconstructed state is

Interestingly, this scheme also corrects a small rotational error, even though the error is continuous! Let the error be described by the quantum operation

We have that , so the syndrome measurement result collapses this state into either or . The fidelity of the resulting output, after recovery , is

In comparison, if no encoding were done then the output fidelity would have been . This reduction of error from to is a signature of the success of the error correction, even for continuous errors.

3-qubit phase-flip code

A similar procedure can be used to correct phase flip errors. Let . Recall that and . Thus, . Thus, we can correct phase flip errors by the encoding , , where , and we perform the syndrome measurements and .

Arbitrary errors are superpositions of bit-flip and phase-flip errors

The reason phase flip errors are significant and interesting is because of the following.

bit-flip (), phase-flip (), and bit-phase flip () errors.

can be written as . Let be a single qubit, and define , where . Then

where is a matrix of c-number coefficients.

For example, for , we have . The syndrome measurement then projects the environment into definite error states, removing the off-diagonal terms (proportional to instead of to ) in this expression.

Quantum error correction: Shor's 9-qubit code

A combination of the bit-flip and phase-flip codes allows correction of any single qubit error. This code encodes a single qubit as

The syndrome measurement operators are

for bit flip errors, and

for phase flip errors. It is simple to see that any single qubit bit flip or phase flip or bit-phase flip error gives a unique syndrome measurement result, by direct examination. It corrects to leading order errors resulting from small rotations, as well. And perhaps, not so obviously, the code also perfectly corrects for errors resulting from removal of any single qubit!