• Publications
  • Influence
Quantum computation with quantum dots
We propose an implementation of a universal set of one- and two-quantum-bit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are
The Physical Implementation of Quantum Computation
After a brief introduction to the principles and promise of quantum information processing, the requirements for the physical implementation of quantum computation are discussed. These five
Quantum nonlocality without entanglement
We exhibit an orthogonal set of product states of two three-state particles that nevertheless cannot be reliably distinguished by a pair of separated observers ignorant of which of the states has
Quantum information and computation
In information processing, as in physics, the classical world view provides an incomplete approximation to an underlying quantum reality that can be harnessed to break codes, create unbreakable codes, and speed up otherwise intractable computations.
Unextendible product bases and bound entanglement
An unextendible product basis( UPB) for a multipartite quantum system is an incomplete orthogonal product basis whose complementary subspace contains no product state. We give examples of UPBs, and
Classical simulation of noninteracting-fermion quantum circuits
It is shown that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteracting fermions in one dimension.
Coupled quantum dots as quantum gates
We consider a quantum-gate mechanism based on electron spins in coupled semiconductor quantum dots. Such gates provide a general source of spin entanglement and can be used for quantum computers. We
Quantum information processing using quantum dot spins and cavity QED
The electronic spin degrees of freedom in semiconductors typically have decoherence times that are several orders of magnitude longer than other relevant time scales. A solid-state quantum computer
We present a family of additive quantum error-correcting codes whose capacities exceed those of quantum random coding (hashing) for very noisy channels. These codes provide nonzero capacity in a