The usual general-purpose computing automaton (e.g.. a Turing machine) is logically irreversibleits transition function lacks a single-valued inverse. Here i t is shown that such machines may he madeâ€¦ (More)

~ This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard and Robert [l] for a special scenario. The results have applicationsâ€¦ (More)

Some mathematical and natural objects (a random sequence, a sequence of zeros, a perfect crystal, a gas) are intuitively trivial, while others (e.g. the human body, the digits of Ï€) contain internalâ€¦ (More)

Recently a great deal of attention has focused on quantum computation following a sequence of results [4, 16, 15] suggesting that quantum computers are more powerful than classical probabilisticâ€¦ (More)

We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: (1) exchange a random quantumâ€¦ (More)

Near-optimal strategies are developed for estimating the free energy difference between two canonical ensembles, given a Metropolis-type Monte Carlo program for sampling each one. The estimationâ€¦ (More)

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 authenticity. Moreâ€¦ (More)

A reversible Turing machine is one whose transition function is 1, so that no instantaneous description (ID) has more than one predecessor. Using a pebbling argument, this paper shows that, for any eâ€¦ (More)