Sciweavers

700 search results - page 61 / 140
» An Introduction to Quantum Computing
Sort
View
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 8 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
AC
1998
Springer
14 years 22 hour ago
The Search for the Holy Grail in Quantum Cryptography
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
Louis Salvail
DIS
2001
Springer
14 years 8 days ago
An Integrated Framework for Extended Discovery in Particle Physics
In this paper we describe BR-4, a computational model of scienti c discovery in particle physics. The system incorporates operators for determining quantum values of known particle...
Sakir Kocabas, Pat Langley

Publication
145views
15 years 6 months ago
A Precompetitive Consortium on Wide-Band All-Optical Networks
This paper represents the technical core of a pre-competitive consortium formed by AT&T, DEC and MIT to study the technology, architecture and applications of wide-band all-opt...
Alexander, S.B., Bondurant, R.S., Byrne, D.C., Cha...

Publication
214views
15 years 5 months ago
Analysis and Modeling of Traffic in Modern Data Communication Networks
In performance analysis and design of communication netword modeling data traffic is important. With introduction of new applications, the characteristics of the data traffic chang...
G. Babic, B. Vandalore, and R. Jain