11547 search results - page 39 / 2310 » Quantum computing and communication |
139
click to vote
TCC
2004
Springer
15 years 9 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
105
click to vote
PPL
2010
15 years 2 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...
126
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
139
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...