Charles H. Bennett

Strengths and Weaknesses of Quantum Computing

Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabil...

Strengths and Weaknesses of Quantum Computing

Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabil...

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 Ei...

Quantum cryptography using any two nonorthogonal states

Quantum techniques for key distribution---the classically impossible task of distributing secret information over an insecure channel whose transmissions are subject to inspecti...

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...

Experimental quantum cryptography

Privacy Amplification by Public Discussion

In this paper, we investigate how the use of a channel with perfect authenticity but no privacy can be used to repair the defects of a channel with imperfect privacy but no auth...

Quantum Cryptography

Mixed-state entanglement and quantum error correction

Entanglement purification protocols (EPP) and quantum error-correcting codes (QECC) provide two ways of protecting quantum states from interaction with the environment. In an EP...

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 ...

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 (e.g., singlets shared through a noisy channel), can prepare a smaller numbe...