Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where K. B. Whaley is active.

Publication


Featured researches published by K. B. Whaley.


Physical Review Letters | 1998

Decoherence free subspaces for quantum computation

Daniel A. Lidar; Isaac L. Chuang; K. B. Whaley

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 errorless 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.


Nature | 2000

Universal quantum computation with the exchange interaction

Dave Bacon; Julia Kempe; Guido Burkard; K. B. Whaley

Various physical implementations of quantum computers are being investigated, although the requirements that must be met to make such devices a reality in the laboratory at present involve capabilities well beyond the state of the art. Recent solid-state approaches have used quantum dots, donor-atom nuclear spins or electron spins; in these architectures, the basic two-qubit quantum gate is generated by a tunable exchange interaction between spins (a Heisenberg interaction), whereas the one-qubit gates require control over a local magnetic field. Compared to the Heisenberg operation, the one-qubit operations are significantly slower, requiring substantially greater materials and device complexity—potentially contributing to a detrimental increase in the decoherence rate. Here we introduced an explicit scheme in which the Heisenberg interaction alone suffices to implement exactly any quantum computer circuit. This capability comes at a price of a factor of three in additional qubits, and about a factor of ten in additional two-qubit operations. Even at this cost, the ability to eliminate the complexity of one-qubit operations should accelerate progress towards solid-state implementations of quantum computation.


Physical Review A | 2001

Theory of decoherence-free fault-tolerant universal quantum computation

Julia Kempe; Dave Bacon; Daniel A. Lidar; K. B. Whaley

Universal quantum computation on decoherence-free subspaces and subsystems ~DFSs! is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free ~noiseless! subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS ~natural fault-tolerant computation! can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one- or two-body interactions must leave the code space during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus asymptotically universal.


Physical Review Letters | 2000

Universal Fault-Tolerant Quantum Computation on Decoherence-Free Subspaces

Dave Bacon; Julia Kempe; Daniel A. Lidar; K. B. Whaley

A general scheme to perform universal, fault-tolerant quantum computation within decoherence-free subspaces (DFSs) is presented. At most two-qubit interactions are required, and 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 spatially symmetric (collective) decoherence. Our results have immediate relevance to quantum computer implementations in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled quantum dot arrays and donor-atom arrays.


Physical Review Letters | 1999

Concatenating Decoherence-Free Subspaces with Quantum Error Correcting Codes

Daniel A. Lidar; Dave Bacon; K. B. Whaley

An operator sum representation is derived for a decoherence-free subspace (DFS) and used to (i) show that DFS’s are the class of quantum error correcting codes (QECC’s) 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. [S0031-9007(99)09301-1]


Physical Review A | 1999

Robustness of Decoherence-Free Subspaces for Quantum Computation

Dave Bacon; Daniel A. Lidar; K. B. Whaley

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.


Physical Review A | 2001

Decoherence-free subspaces for multiple-qubit errors. I. Characterization

Daniel A. Lidar; Dave Bacon; Julia Kempe; K. B. Whaley

Coherence in an open quantum system is degraded through its interaction with a bath. This decoherence can be avoided by restricting the dynamics of the system to special decoherence-free subspaces. These subspaces are usually constructed under the assumption of spatially symmetric system-bath coupling. Here we show that decoherence-free subspaces may appear without spatial symmetry. Instead, we consider a model of system-bath interactions in which to first order only multiple-qubit coupling to the bath is present, with single-qubit system-bath coupling absent. We derive necessary and sufficient conditions for the appearance of decoherence-free states in this model, and give a number of examples. In a sequel paper we show how to perform universal and fault tolerant quantum computation on the decoherence-free subspaces considered in this paper.


Physical Review A | 2002

Exact gate sequences for universal quantum computation using the XY interaction alone

Julia Kempe; K. B. Whaley

In a previous publication [J. Kempe et al., Quantum Computation and Information (Rinton Press, Princeton, NJ, 2001), Vol. 1, special issue, p. 33] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the computation into a larger Hilbert space. This proof is nonconstructive, however, and did not explicitly give the trade-offs in time that are required to implement encoded single-qubit operations and encoded two-qubit gates. Here we explicitly give the gate sequences needed to simulate these operations on encoded qubits and qutrits (three-level systems) and analyze the trade-offs involved. We also propose a possible layout for the qubits in a triangular arrangement.


Physical Review A | 2001

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

Daniel A. Lidar; Dave Bacon; Julia Kempe; K. B. Whaley

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.


Physical Review A | 2003

Deterministic optical Fock-state generation

Kenneth R. Brown; K. M. Dani; Dan M. Stamper-Kurn; K. B. Whaley

We present a scheme for the deterministic generation of N-photon Fock states from N three-level atoms in a high-finesse optical cavity. The method applies an external laser pulse that generates an N-photon output state while adiabatically keeping the atom-cavity system within a subspace of optically dark states. We present analytical estimates of the error due to amplitude leakage from these dark states for general N, and compare it with explicit results of numerical simulations for N{<=}5. The method is shown to provide a robust source of N-photon states under a variety of experimental conditions and is suitable for experimental implementation using a cloud of cold atoms magnetically trapped in a cavity. The resulting N-photon states have potential applications in fundamental studies of nonclassical states and in quantum information processing.

Collaboration


Dive into the K. B. Whaley's collaboration.

Top Co-Authors

Avatar

Daniel A. Lidar

University of Southern California

View shared research outputs
Top Co-Authors

Avatar

Dave Bacon

University of Washington

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

David S. Weiss

Pennsylvania State University

View shared research outputs
Top Co-Authors

Avatar

S. Myrgren

University of California

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Kenneth R. Brown

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge