Approximate quantum error correction can lead to better codes

We present relaxed criteria for quantum error correction which are useful when the specific dominant noise process is known. These criteria have no classical analogue. As an example, we provide a four-bit code which corrects for a single amplitude damping error. This code violates the usual Hamming bound calculated for a Pauli description of the error process, and does not fit into the GF(4) classification.Comment: 7 pages, 2 figures, submitted to Phys. Rev.

Where are the Hedgehogs in Nematics?

In experiments which take a liquid crystal rapidly from the isotropic to the nematic phase, a dense tangle of defects is formed. In nematics, there are in principle both line and point defects (``hedgehogs''), but no point defects are observed until the defect network has coarsened appreciably. In this letter the expected density of point defects is shown to be extremely low, approximately $10^{-8}$ per initially correlated domain, as result of the topology (specifically, the homology) of the order parameter space.Comment: 6 pages, latex, 1 figure (self-unpacking PostScript)

Effective Pure States for Bulk Quantum Computation

In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) and Cory et al. (spatial averaging) for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla qubits and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high temperature and low temperature bulk quantum computing and analyze the signal to noise behavior of each.Comment: 24 pages in LaTex, 14 figures, the paper is also avalaible at http://qso.lanl.gov/qc

Two Qubits in the Dirac Representation

A general two qubit system expressed in terms of the complete set of unit and fifteen traceless, Hermitian Dirac matrices, is shown to exhibit novel features of this system. The well-known physical interpretations associated with the relativistic Dirac equation involving the symmetry operations of time-reversal T, charge conjugation C, parity P, and their products are reinterpreted here by examining their action on the basic Bell states. The transformation properties of the Bell basis states under these symmetry operations also reveal that C is the only operator that does not mix the Bell states whereas all others do. In a similar fashion, expressing the various logic gates introduced in the subject of quantum computers in terms of the Dirac matrices shows for example, that the NOT gate is related to the product of time-reversal and parity operators.Comment: 11 page

Lossless quantum data compression and variable-length coding

In order to compress quantum messages without loss of information it is necessary to allow the length of the encoded messages to vary. We develop a general framework for variable-length quantum messages in close analogy to the classical case and show that lossless compression is only possible if the message to be compressed is known to the sender. The lossless compression of an ensemble of messages is bounded from below by its von-Neumann entropy. We show that it is possible to reduce the number of qbits passing through a quantum channel even below the von-Neumann entropy by adding a classical side-channel. We give an explicit communication protocol that realizes lossless and instantaneous quantum data compression and apply it to a simple example. This protocol can be used for both online quantum communication and storage of quantum data.Comment: 16 pages, 5 figure

Relativistic Doppler effect in quantum communication

When an electromagnetic signal propagates in vacuo, a polarization detector cannot be rigorously perpendicular to the wave vector because of diffraction effects. The vacuum behaves as a noisy channel, even if the detectors are perfect. The ``noise'' can however be reduced and nearly cancelled by a relative motion of the observer toward the source. The standard definition of a reduced density matrix fails for photon polarization, because the transversality condition behaves like a superselection rule. We can however define an effective reduced density matrix which corresponds to a restricted class of positive operator-valued measures. There are no pure photon qubits, and no exactly orthogonal qubit states.Comment: 10 pages LaTe

Perturbative expansions for the fidelities and spatially correlated dissipation of quantum bits

We construct generally applicable short-time perturbative expansions for some fidelities, such as the input-output fidelity, the entanglement fidelity, and the average fidelity. Successive terms of these expansions yield characteristic times for the damping of the fidelities involving successive powers of the Hamiltonian. The second-order results, which represent the damping rates of the fidelities, are extensively discussed. As an interesting application of these expansions, we use them to study the spatially-correlated dissipation of quantum bits. Spatial correlations in the dissipation are described by a correlation function. Explicit conditions are derived for independent decoherence and for collective decoherence.Comment: Minor changes in discussion

Graph states in phase space

The phase space for a system of $n$ qubits is a discrete grid of $2^{n} \times 2^{n}$ points, whose axes are labeled in terms of the elements of the finite field \Gal{2^n} to endow it with proper geometrical properties. We analyze the representation of graph states in that phase space, showing that these states can be identified with a class of non-singular curves. We provide an algebraic representation of the most relevant quantum operations acting on these states and discuss the advantages of this approach.Comment: 14 pages. 2 figures. Published in Journal of Physics

Noise in Grover's Quantum Search Algorithm

Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude in Grover's algorithm. We study the algorithm's intrinsic robustness when no quantum correction codes are used, and evaluate how much noise the algorithm can bear with, in terms of the size of the phone book and a desired probability of finding the correct result. The algorithm loses efficiency when noise is added, but does not slow down. We also study the maximal noise under which the iterated quantum algorithm is just as slow as the classical algorithm. In all cases, the width of the allowed noise scales with the size of the phone book as N^-2/3.Comment: 17 pages, 2 eps figures. Revised version. To be published in PRA, December 199