• Publications
  • Influence
Elementary gates for quantum computation.
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x,y) to (x,x ⊕y)) is universal in the sense that all unitaryExpand
  • 2,741
  • 162
  • PDF
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.
An unknown quantum state \ensuremath{\Vert}\ensuremath{\varphi}〉 can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical Einstein-Podolsky-RosenExpand
  • 8,807
  • 148
  • PDF
Mixed-state entanglement and quantum error correction.
Entanglement purification protocols (EPPs) and quantum error-correcting codes (QECCs) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectlyExpand
  • 3,340
  • 136
  • PDF
Quantum cryptography using any two nonorthogonal states.
  • Bennett
  • Computer Science, Medicine
  • Physical review letters
  • 25 May 1992
TLDR
We show that in principle any two nonorthogonal quantum states suffice, and describe a practical interferometric realization using low-intensity coherent light pulses. Expand
  • 2,184
  • 87
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states.
  • Bennett, Wiesner
  • Physics, Medicine
  • Physical review letters
  • 16 November 1992
As is well known, operations on one particle of an Einstein-Podolsky-Rosen (EPR) pair cannot influence the marginal statistics of measurements on the other particle. We characterize the set of statesExpand
  • 3,643
  • 57
  • PDF
Purification of noisy entanglement and faithful teleportation via noisy channels.
Two separated observers, by applying local operations to a supply of not-too-impure entangled states ({\em e.g.} singlets shared through a noisy channel), can prepare a smaller number of entangledExpand
  • 1,787
  • 46
  • PDF
Quantum cryptography without Bell's theorem.
Ekert has described a cryptographic scheme in which Einstein-Podolsky-Rosen (EPR) pairs of particles are used to generate identical random numbers in remote places, while Bell’s theorem certifiesExpand
  • 1,576
  • 37
Concentrating partial entanglement by local operations.
If two separated observers are supplied with entanglement, in the form of n pairs of particles in identical partly entangled pure states, one member of each pair being given to each observer, theyExpand
  • 2,014
  • 36
  • PDF
Parity bit in quantum cryptography.
  • Bennett, Mor, Smolin
  • Physics, Medicine
  • Physical review. A, Atomic, molecular, and…
  • 30 April 1996
An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $\rho_0^{(n)}$ and $\rho_1^{(n)}$, bothExpand
  • 42
  • PDF
On a coin tossing problem by G .
Tverberg, H., On a coin tossing problem by G. Bennett, Discrete Mathematics 115 (1993) 293-294. For a certain class of games, Bennett proved that player B never has a smaller chance of winning thanExpand
  • 1
  • PDF