Searcharxiv⌕ Search

arXiv subjects

K. B. Whaley

Publications and source records attributed to K. B. Whaley.

41 records · Page 3Linked to original sources

Decoherence-Free Subspaces for Multiple-Qubit Errors: (II) Universal, Fault-Tolerant Quantum Computation

Decoherence-free subspaces (DFSs) shield quantum information from errors induced by the interaction with an uncontrollable environment. Here we study a model of correlated errors forming an Abelian subgroup (stabilizer) of the Pauli group (the group of tensor products of Pauli matrices). Unlike previous studies of DFSs, this type of errors does not involve any spatial symmetry assumptions on the system-environment interaction. We solve the problem of universal, fault-tolerant quantum computation on the associated class of DFSs.

quant-ph↗

Universal Fault-Tolerant Computation on Decoherence-Free Subspaces

A general scheme to perform universal quantum computation within decoherence-free subspaces (DFSs) of a system's Hilbert space is presented. This scheme leads to the first fault-tolerant realization of universal quantum computation on DFSs with the properties that (i) only one- and two-qubit interactions are required, and (ii) the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under "collective decoherence" (qubit-permutation-invariant system-bath coupling). Our results have immediate relevance to a number of solid-state quantum computer implementations, in particular those in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled GaAs quantum dot arrays and the Si:$^{31}$P nuclear spin arrays.

quant-ph↗

Robustness of Decoherence-Free Subspaces for Quantum Computation

It was shown recently [D.A. Lidar et al., Phys. Rev. Lett. 81, 2594 (1998)] that within the framework of the semigroup Markovian master equation, decoherence-free (DF) subspaces exist which are stable to first order in time to a perturbation. Here this result is extended to the non-Markovian regime and generalized. In particular, it is shown that within both the semigroup and the non-Markovian operator sum representation, DF subspaces are stable to all orders in time to a symmetry-breaking perturbation. DF subspaces are thus ideal for quantum memory applications. For quantum computation, however, the stability result does not extend beyond the first order. Thus, to perform robust quantum computation in DF subspaces, they must be supplemented with quantum error correcting codes.

quant-ph↗

Concatenating Decoherence Free Subspaces with Quantum Error Correcting Codes

An operator sum representation is derived for a decoherence-free subspace (DFS) and used to (i) show that DFSs are the class of quantum error correcting codes (QECCs) with fixed, unitary recovery operators, and (ii) find explicit representations for the Kraus operators of collective decoherence. We demonstrate how this can be used to construct a concatenated DFS-QECC code which protects against collective decoherence perturbed by independent decoherence. The code yields an error threshold which depends only on the perturbing independent decoherence rate.

quant-ph↗

Decoherence Free Subspaces for Quantum Computation

Decoherence in quantum computers is formulated within the Semigroup approach. The error generators are identified with the generators of a Lie algebra. This allows for a comprehensive description which includes as a special case the frequently assumed spin-boson model. A generic condition is presented for error-less quantum computation: decoherence-free subspaces are spanned by those states which are annihilated by all the generators. It is shown that these subspaces are stable to perturbations and moreover, that universal quantum computation is possible within them.

quant-ph↗