Chapter 8 - Decoherence-Free/Noiseless Subsystems

From Qunet
Revision as of 15:18, 28 February 2011 by Mbyrd (talk | contribs) (A Decoherence-Free Subspace Using Four Qubits)
Jump to: navigation, search

Introduction

In the last chapter we saw that it is possible, at least in principle, to detect and correct errors in quantum systems. In this chapter a different method for protecting against errors is explored. This method encodes information into quantum states such that the information avoids errors. The information is encoded in such a way that it is invariant under the errors produced by the system-bath Hamiltonian. The initial work involved what are called decoherence-free subspaces and was later generalized to subsystems. (These terms are defined below. Reviews may be found in Whaley/Lidar and Byrd/Wu/Lidar.) Although there are alternative descriptions of decoherence-free subspaces and the subsystem generalization in terms of master equations, in this chapter the Hamiltonian description is used. See Whaley/Lidar and references therein.

General Considerations

In what follows, a general quantum system will be assumed to be coupled non-trivially to a bath such that the entire system-bath Hamiltonian is given by


(8.1)

where acts only on the system, acts only on the bath, and


(8.2)

is the interaction Hamiltonian with the acting only on the system and the acting only on the bath. The "error algebra" is denoted and is the algebra generated by the set . The obviously cause errors because they describe the interaction between the system and the bath. The reason the error algebra contains other terms is that when the system and bath together evolve unitarily, the exponential of the Hamiltonian means that products of the with each other and also with will be present in the unitary evolution. In the case that is identically zero, or we can remove it by changing basis (to a rotating frame), the problem simplifies to the consideration only of the algebra of the or the modified ( in the rotating frame) need be considered, respectively.

At this point, the objective is to find a set of states which will be immune to the errors which are present. Such states are identified using the error algebra. The way this is done is to put the algebra in a form which is block-diagonal. This type of algebra is said to be "reducible" which means that one may always block-diagonalize it. (See Appendix D.) Suppose that each element of the algebra can be put into the same block-diagonal form using a particular unitary transformation . Then for any element of the error algebra, , is block-diagonal. If the information is stored in states which are acted upon by these blocks, and only these blocks, then the information is protected because the information stays in the states which are defined by these blocks. If the blocks are blocks, i.e., submatrices, which are just numbers, then the states which make up such a system are called decoherence-free "subspaces". If the blocks are larger, then they are called decoherence-free subsystems, or noiseless subsystems.

In the next few sections, the examples will illustrate this construction and how the states are protected.

A Phase-Protected Two-Qubit Decoherence-Free Subspace

One of the simplest example of a decoherence-free subspace is a method for using two physical qubits to encode one logical qubit in such a way that the logical qubit is protected against phase errors which operate on both physical qubits in the same way. This is called a collective phase error and is quite useful as will be shown in Chapter 10.

Let us begin by assuming there is no system Hamiltonian and that the two physical qubits in the system are acted upon by the Hamiltonian


(8.3)

where is a phase operator which acts on the th qubit. This Hamiltonian acts the same on each of the two qubits to produce the same phase error on each. If we now choose our logical states two be


(8.4)

then our logical states will be given by


(8.5)

If we now suppose that the system and bath are initially uncoupled, then the states, acted upon by the Hamiltonian gives


(8.6)

which gives a decoupled system and bath. This is clear since the exponential of this Hamiltonian gives the unitary evolution of the state. Thus


(8.7)

where . This Hamiltonian acts as the identity on the logical states of the system. To be even more explicit, when one can trace out the bath degrees of freedom to find that the state of the system remains unchanged by this Hamiltonian. Thus the system has been encoded in such a way that this type of error does not adversely affect the state of the system. This allows for perfect storage.

It is perhaps worth emphasizing that this is a simple model of a particular type of decoherence which would ordinarily lead to collective phase errors on the system states. Such noise has also been called "weak decoherence." However, because the information is encoded, it is protected against these types of errors. In the language of a quantum error correcting codes, this is an infinite distance code since the error does not lead to an error no matter how long, or to what extent the error acts. In the next subsection we will see how this can be extended to collective errors acting on a number of qubits in an arbitrary way, not just codes that will protect against phase errors.

A Decoherence-Free Subspace Using Four Qubits

Consider a Hamiltonian which causes arbitrary collective errors on a collection of four qubits,


(8.8)

where are arbitrary constants. The standard procedure would be to find irreducible representations of the algebra of errors which is generated by the three collective errors


(8.9)

Here again we are supposing that there is no system Hamiltonian, .



(8.9)


A Noiseless Subsystem Using Three Qubits

The Utility of DNS

Quantum Computing on a DNS