11547 search results - page 11 / 2310 » Quantum computing and communication |
110
click to vote
NIPS
2003
15 years 3 months ago
2003
Most proposals for quantum neural networks have skipped over the problem of how to train the networks. The mechanics of quantum computing are different enough from classical compu...
115
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
157
Voted
COCO
2000
Springer
15 years 6 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
89
Voted
FUIN
2008
15 years 1 months ago
2008
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
139
Voted
AC
1998
Springer
15 years 6 months ago
1998
Springer
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...