Harold Ollivier

Quantum discord: a measure of the quantumness of correlations.

Two classically identical expressions for the mutual information generally differ when the two systems involved are quantum. We investigate this difference -- quantum discord -- and show that it can be used as a criterion for the classicality of the correlations. We also show that quantum discord can be used for describing the selection of the preferred, effectively classical, pointer states.

Objective Properties from Subjective Quantum States: Environment as a Witness

We study the emergence of objective properties in open quantum systems. In our analysis, the environment is promoted from a passive role of a reservoir selectively destroying quantum coherence to an active role of amplifier selectively proliferating information about the system. We show that only preferred pointer states of the system can leave a redundant and therefore easily detectable imprint on the environment. Observers who-as is almost always the case-discover the state of the system indirectly (by probing a fraction of its environment) will find out only about the corresponding pointer observable. Many observers can act in this fashion independently and without perturbing the system. They will agree about its state. In this operational sense, preferred pointer states exist objectively.

Description of a quantum convolutional code.

We describe a quantum error correction scheme aimed at protecting a flow of quantum information over long distance communication. It is largely inspired by the theory of classical convolutional codes which are used in similar circumstances in classical communication. The particular example shown here uses the stabilizer formalism. We provide an explicit encoding circuit and its associated error estimation algorithm. The latter gives the most likely error over any memoryless quantum channel, with a complexity growing only linearly with the number of encoded qubits.

Quantum Serial Turbo Codes

In this paper, we present a theory of quantum serial turbo codes, describe their iterative decoding algorithm, and study their performances numerically on a depolarization channel. Our construction offers several advantages over quantum low-density parity-check (LDPC) codes. First, the Tanner graph used for decoding is free of 4-cycles that deteriorate the performances of iterative decoding. Second, the iterative decoder makes explicit use of the codes degeneracy. Finally, there is complete freedom in the code design in terms of length, rate, memory size, and interleaver choice. We define a quantum analogue of a state diagram that provides an efficient way to verify the properties of a quantum convolutional code, and in particular, its recursiveness and the presence of catastrophic error propagation. We prove that all recursive quantum convolutional encoders have catastrophic error propagation. In our constructions, the convolutional codes have thus been chosen to be noncatastrophic and nonrecursive. While the resulting families of turbo codes have bounded minimum distance, from a pragmatic point of view, the effective minimum distances of the codes that we have simulated are large enough not to degrade the iterative decoding performance up to reasonable word error rates and block sizes. With well-chosen constituent convolutional codes, we observe an important reduction of the word error rate as the code length increases.

A class of quantum LDPC codes: construction and performances under iterative decoding

A generic method for constructing quantum LDPC codes is presented. We first explain how to overcome the difficulty of finding a set of low weight generators for the stabilizer group of the code. Our approach is based on a graph representation of the generators of the stabilizer group and on a simple local rule to ensure commutativity. We provide several specific examples of quantum LDPC codes obtained by our method, together with numerical simulations over the depolarizing channel and the erasure channel.

Quantum serial turbo-codes

In this paper, we present a theory of quantum serial turbo codes, describe their iterative decoding algorithm, and study their performances numerically on a depolarization channel. Our construction offers several advantages over quantum low-density parity-check (LDPC) codes. First, the Tanner graph used for decoding is free of 4-cycles that deteriorate the performances of iterative decoding. Second, the iterative decoder makes explicit use of the codes degeneracy. Finally, there is complete freedom in the code design in terms of length, rate, memory size, and interleaver choice. We define a quantum analogue of a state diagram that provides an efficient way to verify the properties of a quantum convolutional code, and in particular, its recursiveness and the presence of catastrophic error propagation. We prove that all recursive quantum convolutional encoders have catastrophic error propagation. In our constructions, the convolutional codes have thus been chosen to be noncatastrophic and nonrecursive. While the resulting families of turbo codes have bounded minimum distance, from a pragmatic point of view, the effective minimum distances of the codes that we have simulated are large enough not to degrade the iterative decoding performance up to reasonable word error rates and block sizes. With well-chosen constituent convolutional codes, we observe an important reduction of the word error rate as the code length increases.

Exponential speedup with a single bit of quantum information: measuring the average fidelity decay.

We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation. Thus for those maps admitting an efficient gate decomposition, it provides an exponential speedup over known classical procedures. Fidelity decay is important in the study of complex dynamical systems, where it is conjectured to be a signature of eigenvector statistics. Our result also illustrates the role of chaos in the process of decoherence.

Universal quantum cloning in cavity QED

We propose an implementation of an universal quantum cloning machine [UQCM, V. Buzek and M. Hillery, Phys. Rev. A 54, 1844 (1996)] in a cavity quantum electrodynamics experiment. This UQCM acts on the electronic states of atoms that interact with the electromagnetic field of a high-

Self-testing of quantum circuits

Q

A direct approach to fault-tolerance in measurement-based quantum computation via teleportation

cavity. We discuss here the specific case of the