#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1973

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Stephen Wiesner
- SIGA
- 1983

restrictions on measurement related to the uncertainty principal. Two concrete examples and some general results are given. The uncertainty principle imposes restrictions on the capacity of certain types of communication channels. This paper will show that in compensation for this "quantum noise", quantum mechanics allows us novel forms of coding without… (More)

- Charles H. Bennett, Gilles Brassard, Seth Breidbart, Stephen Wiesner
- CRYPTO
- 1982

- Stephen Wiesner
- 1996

We suggest that quantum computers can solve quantum many-body problems that are impracticable to solve on a classical computer. The classical many-body problem has been largely solved by the classical computer. For example the position of the planets in the solar system can now be predicted with an accuracy as great as the accuracy of the observations. On… (More)

Recently, Peter Shor [1] obtained a surprising and even seemingly paradoxical result: an unknown quantum state can be kept unchanged in a noisy environment. His procedure was optimized by others [2{5], all trying to solve the problem of decoherence in quantum computers. However, at the present stage these results have more theoretical than practical… (More)

Quantum cryptography is a field which combines quantum theory with information theory. The goal of this field is to use the laws of physics to provide secure information exchange, in contrast to classical methods based on (unproven) complexity assumptions. In particular, quantum key distribution protocols [1] became especially important due to technological… (More)

- Stephen Wiesner
- SIGO
- 1988

This paper describes the design and operation of Two-&amp;-Two, a program for finding pairs of documents which form a bridge between two inputs. Two-&amp;-Two is built on top of Finder, a retrieval system based on relevance feedback that operates on the massively parallel Connection Machine System.

From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 Algebraic Methods in Computational Complexity was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as… (More)

- William O Donnelly, David G. Hitlin, Mario Schwartz, J. D. Walecka, Stephen Wiesner
- 1973

AHSTRACT The use of neutrino excitation of nuclear levels to study weak neutral currents is examined.

This work surveys the recent results in the theory of cryptography in a quantum computing model. Under the assumption that a quantum computer is built, we consider such notions as encryption and authentication of quantum data, and compare them with their classical counterparts. Many surprizes are unraveled. Once again, these results show how strikingly… (More)

- ‹
- 1
- ›