arXiv subjects
Publications and source records attributed to Daniel A. Lidar.
A method is introduced whereby two non-interacting quantum subsystems, that each interact with a third subsystem, are entangled via repeated projective measurements of the state of the third subsystem. A variety of physical examples are presented. The method can be used to establish long range entanglement between distant parties in one parallel measurement step, thus obviating the need for entanglement swapping.
Quantum error prevention strategies will be required to produce a scalable quantum computing device and are of central importance in this regard. Progress in this area has been quite rapid in the past few years. In order to provide an overview of the achievements in this area, we discuss the three major classes of error prevention strategies, the abilities of these methods and the shortcomings. We then discuss the combinations of these strategies which have recently been proposed in the literature. Finally we present recent results in reducing errors on encoded subspaces using decoupling controls. We show how to generally remove mixing of an encoded subspace with external states (termed leakage errors) using decoupling controls. Such controls are known as ``leakage elimination operations'' or ``LEOs.''
An infinite array of parallel current-carrying wires is known, from the field of neutral particle optics, to produce an exponentially localized magnetic field when the current direction is antiparallel in adjacent wires. We show that a finite array of several tens of superconducting Nb nanowires can produce a peak magnetic field of 10mT that decays by a factor of 10^4 over a length scale of 500nm. Such an array is readily manufacturable with current technology, and is compatible with both semiconductor and superconducting quantum computer architectures. A series of such arrays can be used to individually address single single-spin or flux qubits spaced as little as 100nm apart, and can lead to quantum logic gate times of 5ns.
Several prominent proposals have suggested that spins of localized electrons could serve as quantum computer qubits. The exchange interaction has been invoked as a means of implementing two qubit gates. In this paper, we analyze the strength and form of the exchange interaction under relevant conditions. We find that, when several spins are engaged in mutual interactions, the quantitative strengths or even qualitative forms of the interactions can change. It is shown that the changes can be dramatic within a Heitler-London model. Hund-Mulliken calculations are also presented, and support the qualititative conclusions from the Heitler-London model. The effects need to be considered in spin-based quantum computer designs, either as a source of gate error to be overcome or a new interaction to be exploited.
In the effort to design and to construct a quantum computer, several leading proposals make use of spin-based qubits. These designs generally assume that spins undergo pairwise interactions. We point out that, when several spins are engaged mutually in pairwise interactions, the quantitative strengths of the interactions can change and qualitatively new terms can arise in the Hamiltonian, including four-body interactions. In parameter regimes of experimental interest, these coherent effects are large enough to interfere with computation, and may require new error correction or avoidance techniques.
We report the realization, using nuclear magnetic resonance techniques, of the first quantum computer that reliably executes an algorithm in the presence of strong decoherence. The computer is based on a quantum error avoidance code that protects against a class of multiple-qubit errors. The code stores two decoherence-free logical qubits in four noisy physical qubits. The computer successfully executes Grover's search algorithm in the presence of arbitrarily strong engineered decoherence. A control computer with no decoherence protection consistently fails under the same conditions.
A Comment on the paper "Quantum waveguide array generator for performing Fourier transforms: Alternate route to quantum computing" by R. Akis and D.K. Ferry, Appl. Phys. Lett. 79, 2823 (2001). The authors reply in Appl. Phys. Lett. 80, 2420 (2002).
A Comment on the paper "Conservative Quantum Computing" by M. Ozawa, Phys. Rev. Lett. 89, 057902 (2002). The author replies in Phys. Rev. Lett. 91, 089802 (2003).
Decoherence is the main obstacle to the realization of quantum computers. Until recently it was thought that quantum error correcting codes are the only complete solution to the decoherence problem. Here we present an alternative that is based on a combination of a decoherence-free subspace encoding and the application of strong and fast pulses: ``encoded recoupling and decoupling'' (ERD). This alternative has the advantage of lower encoding overhead (as few as two physical qubits per logical qubit suffice), and direct application to a number of promising proposals for the experimental realization of quantum computers.
Decoherence is the phenomenon of non-unitary dynamics that arises as a consequence of coupling between a system and its environment. It has important harmful implications for quantum information processing, and various solutions to the problem have been proposed. Here we provide a detailed a review of the theory of decoherence-free subspaces and subsystems, focusing on their usefulness for preservation of quantum information.
A universal and fault tolerant scheme for quantum computation is proposed which utilizes a class of error correcting codes that is based on the detection of spontaneous emission (of, e.g., photons, phonons, and ripplons). The scheme is compatible with a number of promising solid-state and quantum-optical proposals for quantum computer implementations, such as quantum dots in cavities, electrons on helium, and trapped ions.
Proposals for quantum computing devices are many and varied. They each have unique noise processes that make none of them fully reliable at this time. There are several error correction/avoidance techniques which are valuable for reducing or eliminating errors, but not one, alone, will serve as a panacea. One must therefore take advantage of the strength of each of these techniques so that we may extend the coherence times of the quantum systems and create more reliable computing devices. To this end we give a general strategy for using dynamical decoupling operations on encoded subspaces. These encodings may be of any form; of particular importance are decoherence-free subspaces and quantum error correction codes. We then give means for empirically determining an appropriate set of dynamical decoupling operations for a given experiment. Using these techniques, we then propose a comprehensive encoding solution to many of the problems of quantum computing proposals which use exchange-type interactions. This uses a decoherence-free subspace and an efficient set of dynamical decoupling operations. It also addresses the problems of controllability in solid state quantum dot devices.
We introduce simple qubit-encodings and logic gates which eliminate the need for certain difficult single-qubit operations in superconducting phase-qubits, while preserving universality. The simplest encoding uses two physical qubits per logical qubit. Two architectures for its implementation are proposed: one employing N physical qubits out of which N/2 are ancillas fixed in the |1> state, the other employing N/2+1 physical qubits, one of which is a bus qubit connected to all others. Details of a minimal set of universal encoded logic operations are given, together with recoupling schemes, that require nanosecond pulses. A generalization to codes with higher ratio of number of logical qubits per physical qubits is presented. Compatible decoherence and noise suppression strategies are also discussed.
Time-Frequency Resolved Coherent Anti-Stokes Raman Scattering (TFRCARS) was recently proposed as a means to implement quantum logic using the molecular ro-vibrational manifold as a quantum register [R. Zadoyan et al., Chem. Phys. 266, 323 (2001)]. We give a concrete example of how this can be accomplished through an illustrative algorithm that solves the Deutsch-Jozsa problem. We use realistic molecular parameters to recognize that, as the problem size expands, shaped pulses must be tailored to maintain fidelity of the algorithm.
Proposals for scalable quantum computing devices suffer not only from decoherence due to the interaction with their environment, but also from severe engineering constraints. Here we introduce a practical solution to these major concerns, addressing solid state proposals in particular. Decoherence is first reduced by encoding a logical qubit into two qubits, then completely eliminated by an efficient set of decoupling pulse sequences. The same encoding removes the need for single-qubit operations, that pose a difficult design constraint. We further show how the dominant decoherence processes can be identified empirically, in order to optimize the decoupling pulses.
Strong and fast "bang-bang" (BB) pulses have been recently proposed as a means for reducing decoherence in a quantum system. So far theoretical analysis of the BB technique relied on model Hamiltonians. Here we introduce a method for empirically determining the set of required BB pulses, that relies on quantum process tomography. In this manner an experimenter may tailor his or her BB pulses to the quantum system at hand, without having to assume a model Hamiltonian.
Strong, fast pulses, called ``bang-bang'' controls can be used to eliminate the effects of system-environment interactions. This method for preventing errors in quantum information processors is treated here in a geometric setting which leads to an intuitive perspective. Using this geometric description, we clarify the notion of group symmetrization as an averaging technique, and provide a geometric picture for evaluating errors due to imperfect bang-bang controls. This will provide additional support for the usefulness of such controls as a means for providing more reliable quantum information processing.
A central problem in the theory of the dynamics of open quantum systems is the derivation of a rigorous and computationally tractable master equation for the reduced system density matrix. Most generally, the evolution of an open quantum system is described by a completely positive linear map. We show how to derive a completely positive Markovian master equation (the Lindblad equation) from such a map by a coarse graining procedure. We provide a novel and explicit recipe for calculating the coefficients of the master equation, using perturbation theory in the weak-coupling limit. The only parameter external to our theory is the coarse-graining time-scale. We illustrate the method by explicitly deriving the master equation for the spin-boson model. The results are evaluated for the exactly solvable case of pure dephasing, and an excellent agreement is found within the timescale where the Markovian approximation is expected to be valid. The method can be extended in principle to include non-Markovian effects.