587 search results - page 37 / 118 » Quantum computation and quantum information |
115
click to vote
FOSSACS
2011
Springer
14 years 3 months ago
2011
Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
110
click to vote
STOC
2003
ACM
16 years 2 days ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
PPL
2010
14 years 10 months ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
EUROCRYPT
1990
Springer
15 years 3 months ago
1990
Springer
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 ran...
ECIR
2011
Springer
14 years 3 months ago
2011
Springer
The cognitively motivated principle of polyrepresentation still lacks a theoretical foundation in IR. In this work, we discuss two competing polyrepresentation frameworks that are ...