Searcharxiv⌕ Search

arXiv subjects

L. -A. Wu

Publications and source records attributed to L. -A. Wu.

14 recordsLinked to original sources
arXiv2007

Linking entanglement and quantum phase transitions via density functional theory

Density functional theory (DFT) is shown to provide a novel conceptual and computational framework for entanglement in interacting many-body quantum systems. DFT can, in particular, shed light on the intriguing relationship between quantum phase transitions and entanglement. We use DFT concepts to express entanglement measures in terms of the first or second derivative of the ground state energy. We illustrate the versatility of the DFT approach via a variety of analytically solvable models. As a further application we discuss entanglement and quantum phase transitions in the case of mean field approximations for realistic models of many-body systems.

quant-ph↗
arXiv2005

Entanglement Observables and Witnesses for Interacting Quantum Spin Systems

We discuss the detection of entanglement in interacting quantum spin systems. First, thermodynamic Hamiltonian-based witnesses are computed for a general class of one-dimensional spin-1/2 models. Second, we introduce optimal bipartite entanglement observables. We show that a bipartite entanglement measure can generally be associated to a set of independent two-body spin observables whose expectation values can be used to witness entanglement. The number of necessary observables is ruled by the symmetries of the model. Illustrative examples are presented.

quant-ph↗
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

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↗
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↗
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↗
arXiv2002

Efficient Universal Leakage Elimination for Physical and Encoded Qubits

Decoherence-induced leakage errors can couple a physical or encoded qubit to other levels, thus potentially damaging the qubit. They can therefore be very detrimental in quantum computation and require special attention. Here we present a general method for removing such errors by using simple decoupling and recoupling pulse sequences. The proposed gates are experimentally accessible in a variety of promising quantum computing proposals.

quant-ph↗
arXiv2001

Reducing Constraints on Quantum Computer Design by Encoded Selective Recoupling

The requirement of performing both single-qubit and two-qubit operations in the implementation of universal quantum logic often leads to very demanding constraints on quantum computer design. We show here how to eliminate the need for single-qubit operations in a large subset of quantum computer proposals: those governed by isotropic and XXZ,XY-type anisotropic exchange interactions. Our method employs an encoding of one logical qubit into two physical qubits, while logic operations are performed using an analogue of the NMR selective recoupling method.

quant-ph↗
arXiv2001

Power of Anisotropic Exchange Interactions: Universality and Efficient Codes for Quantum Computing

We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum computer proposals, e.g., quantum dots and donor atom spins with anisotropic exchange coupling, quantum Hall systems, and electrons floating on helium.We show how to make the corresponding Hamiltonians universal by encoding one qubit into two physical qubits, and by controlling nearest neighbor interactions.

quant-ph↗