1391 search results - page 15 / 279 » Complexity Limitations on Quantum Computation |
117
Voted
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
110
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
125
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...
116
Voted
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
130
Voted
RIVF
2007
15 years 5 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...