Searcharxiv⌕ Search

arXiv subjects

D. A. Lidar

Publications and source records attributed to D. A. Lidar.

At least 55 records · Page 3Linked to original sources
arXiv2005

Holonomic quantum computation in decoherence-free subspaces

We show how to realize, by means of non-abelian quantum holonomies, a set of universal quantum gates acting on decoherence-free subspaces and subsystems. In this manner we bring together the quantum coherence stabilization virtues of decoherence-free subspaces and the fault-tolerance of all-geometric holonomic control. We discuss the implementation of this scheme in the context of quantum information processing using trapped ions and quantum dots.

quant-ph↗
arXiv2005

Quantum Computing in the Presence of Detected Spontaneous Emission

A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into only $n+1$ physical qubits. Universal fault-tolerant quantum computation is shown to be possible in this scheme using Hamiltonians relevant to a range of promising proposals for the physical implementation of quantum computers.

quant-ph↗
arXiv2005

Theory of Initialization-Free Decoherence-Free Subspaces and Subsystems

We introduce a generalized theory of decoherence-free subspaces and subsystems (DFSs), which do not require accurate initialization. We derive a new set of conditions for the existence of DFSs within this generalized framework. By relaxing the initialization requirement we show that a DFS can tolerate arbitrarily large preparation errors. This has potentially significant implications for experiments involving DFSs, in particular for the experimental implementation, over DFSs, of the large class of quantum algorithms which can function with arbitrary input states.

quant-ph↗
arXiv2005

Conditions for strictly purity-decreasing quantum Markovian dynamics

The purity, Tr(rho^2), measures how pure or mixed a quantum state rho is. It is well known that quantum dynamical semigroups that preserve the identity operator (which we refer to as unital) are strictly purity-decreasing transformations. Here we provide an almost complete characterization of the class of strictly purity-decreasing quantum dynamical semigroups. We show that in the case of finite-dimensional Hilbert spaces a dynamical semigroup is strictly purity-decreasing if and only if it is unital, while in the infinite dimensional case, unitality is only sufficient.

quant-ph↗
arXiv2005

Consistency of the Adiabatic Theorem

We review the quantum adiabatic approximation for closed systems, and its recently introduced generalization to open systems (M.S. Sarandy and D.A. Lidar, e-print quant-ph/0404147). We also critically examine a recent argument claiming that there is an inconsistency in the adiabatic theorem for closed quantum systems [K.P. Marzlin and B.C. Sanders, Phys. Rev. Lett. 93, 160408 (2004)] and point out how an incorrect manipulation of the adiabatic theorem may lead one to obtain such an inconsistent result.

quant-ph↗
arXiv2005

Adiabatic approximation in open quantum systems

We generalize the standard quantum adiabatic approximation to the case of open quantum systems. We define the adiabatic limit of an open quantum system as the regime in which its dynamical superoperator can be decomposed in terms of independently evolving Jordan blocks. We then establish validity and invalidity conditions for this approximation and discuss their applicability to superoperators changing slowly in time. As an example, the adiabatic evolution of a two-level open system is analysed.

quant-ph↗
arXiv2004

Fault-Tolerant Quantum Computation via Exchange interactions

Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and controlling a single effective exchange interaction and possibly a global magnetic field. This "encoded universality" paradigm offers potential simplifications in quantum computer design since it does away with the need to perform single-qubit rotations. Here we show that encoded universality schemes can be combined with quantum error correction. In particular, we show explicitly how to perform fault-tolerant leakage correction, thus overcoming the main obstacle to fault-tolerant encoded universality.

quant-ph↗
arXiv2004

Control of decoherence: analysis and comparison of three different strategies

We analyze and compare three different strategies, all aimed at controlling and eventually halting decoherence. The first strategy hinges upon the quantum Zeno effect, the second makes use of frequent unitary interruptions ("bang-bang" pulses and their generalization, quantum dynamical decoupling), and the third of a strong, continuous coupling. Decoherence is shown to be suppressed only if the frequency N of the measurements/pulses is large enough or if the coupling K is sufficiently strong. Otherwise, if N or K are large, but not extremely large, all these control procedures accelerate decoherence. We investigate the problem in a general setting and then consider some practical examples, relevant for quantum computation.

quant-ph↗
arXiv2004

Unification of Dynamical Decoupling and the Quantum Zeno Effect

We unify the quantum Zeno effect (QZE) and the "bang-bang" (BB) decoupling method for suppressing decoherence in open quantum systems: in both cases strong coupling to an external system or apparatus induces a dynamical superselection rule that partitions the open system's Hilbert space into quantum Zeno subspaces. Our unification makes use of von Neumann's ergodic theorem and avoids making any of the symmetry assumptions usually made in discussions of BB. Thus we are able to generalize BB to arbitrary fast and strong pulse sequences, requiring no symmetry, and to show the existence of two alternatives to pulsed BB: continuous decoupling, and pulsed measurements. Our unified treatment enables us to derive limits on the efficacy of the BB method: we explicitly show that the inverse QZE implies that BB can in some cases accelerate, rather than inhibit, decoherence.

quant-ph↗
arXiv2003

Dressed Qubits

Inherent gate errors can arise in quantum computation when the actual system Hamiltonian or Hilbert space deviates from the desired one. Two important examples we address are spin-coupled quantum dots in the presence of spin-orbit perturbations to the Heisenberg exchange interaction, and off-resonant transitions of a qubit embedded in a multilevel Hilbert space. We propose a ``dressed qubit'' transformation for dealing with such inherent errors. Unlike quantum error correction, the dressed qubits method does not require additional operations or encoding redundancy, is insenstitive to error magnitude, and imposes no new experimental constraints.

quant-ph↗
arXiv2003

Dynamical Decoupling Using Slow Pulses: Efficient Suppression of 1/f Noise

The application of dynamical decoupling pulses to a single qubit interacting with a linear harmonic oscillator bath with $1/f$ spectral density is studied, and compared to the Ohmic case. Decoupling pulses that are slower than the fastest bath time-scale are shown to drastically reduce the decoherence rate in the $1/f$ case. Contrary to conclusions drawn from previous studies, this shows that dynamical decoupling pulses do not always have to be ultra-fast. Our results explain a recent experiment in which dephasing due to $1/f$ charge noise affecting a charge qubit in a small superconducting electrode was successfully suppressed using spin-echo-type gate-voltage pulses.

quant-ph↗
arXiv2002

Encoded Recoupling and Decoupling: An Alternative to Quantum Error Correcting Codes, Applied to Trapped Ion Quantum Computation

A recently developed theory for eliminating decoherence and design constraints in quantum computers, ``encoded recoupling and decoupling'', is shown to be fully compatible with a promising proposal for an architecture enabling scalable ion-trap quantum computation [D. Kielpinski et al., Nature 417, 709 (2002)]. Logical qubits are encoded into pairs of ions. Logic gates are implemented using the Sorensen-Molmer (SM) scheme applied to pairs of ions at a time. The encoding offers continuous protection against collective dephasing. Decoupling pulses, that are also implemented using the SM scheme directly to the encoded qubits, are capable of further reducing various other sources of qubit decoherence, such as due to differential dephasing and due to decohered vibrational modes. The feasibility of using the relatively slow SM pulses in a decoupling scheme quenching the latter source of decoherence follows from the observed 1/f spectrum of the vibrational bath.

quant-ph↗
arXiv2002

Universal Quantum Logic from Zeeman and Anisotropic Exchange Interactions

Some of the most promising proposals for scalable solid-state quantum computing, e.g., those using electron spins in quantum dots or donor electron or nuclear spins in Si, rely on a two-qubit quantum gate that is ideally generated by an isotropic exchange interaction. However, an anisotropic perturbation arising from spin-orbit coupling is inevitably present. Previous studies focused on removing the anisotropy. Here we introduce a new universal set of quantum logic gates that takes advantage of the anisotropic perturbation. The price is a constant but modest factor in additional pulses. The gain is a scheme that is compatible with the naturally available interactions in spin-based solid-state quantum computers.

quant-ph↗
arXiv2002

Universal Quantum Computation using Exchange Interactions and Teleportation of Single-Qubit Operations

We show how to construct a universal set of quantum logic gates using control over exchange interactions and single- and two-spin measurements only. Single-spin unitary operations are teleported instead of being executed directly, thus eliminating a major difficulty in the construction of several of the most promising proposals for solid-state quantum computation, such as spin-coupled quantum dots, donor-atom nuclear spins in silicon, and electrons on helium. Contrary to previous proposals dealing with this difficulty, our scheme requires no encoding redundancy. We also discuss an application to superconducting phase qubits.

quant-ph↗
arXiv2002

Polynomial-Time Simulation of Pairing Models on a Quantum Computer

We propose a polynomial-time algorithm for simulation of the class of pairing Hamiltonians, e.g., the BCS Hamiltonian, on an NMR quantum computer. The algorithm adiabatically finds the low-lying spectrum in the vicinity of the gap between ground and first excited states, and provides a test of the applicability of the BCS Hamiltonian to mesoscopic superconducting systems, such as ultra-small metallic grains.

quant-ph↗
arXiv2002

Qubits as Parafermions

Qubits are neither fermions nor bosons. A Fock space description of qubits leads to a mapping from qubits to parafermions: particles with a hybrid boson-fermion quantum statistics. We study this mapping in detail, and use it to provide a classification of the algebras of operators acting on qubits. These algebras in turn classify the universality of different classes of physically relevant qubit-qubit interaction Hamiltonians. The mapping is further used to elucidate the connections between qubits, bosons, and fermions. These connections allow us to share universality results between the different particle types. Finally, we use the mapping to study the quantum computational power of certain anisotropic exchange Hamiltonians. In particular, we prove that the XY model with nearest-neighbor interactions only is not computationally universal. We also generalize previous results about universal quantum computation with encoded qubits to codes with higher rates.

quant-ph↗
arXiv2002

Creating Decoherence-Free Subspaces with Strong and Fast Pulses

A decoherence-free subspace (DFS) isolates quantum information from deleterious environmental interactions. We give explicit sequences of strong and fast (``bang-bang'', BB) pulses that create the conditions allowing for the existence of DFSs that support scalable, universal quantum computation. One such example is the creation of the conditions for collective decoherence, wherein all system particles are coupled in an identical manner to their environment. The BB pulses needed for this are generated using only the Heisenberg exchange interaction. In conjunction with previous results, this shows that Heisenberg exchange is all by itself an enabler of universal fault tolerant quantum computation on DFSs.

quant-ph↗