1677 search results - page 21 / 336 » On the Completeness of Quantum Computation Models |
LICS
2005
IEEE
15 years 7 months ago
2005
IEEE
117
click to vote
EUROCRYPT
1995
Springer
15 years 5 months ago
1995
Springer
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
HPCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We address computational issues relevant to the study of disordered quantum mechanical systems at very low temperatures. As an example we consider the disordered BoseHubbard model...
ECCC
2002
15 years 1 months ago
2002
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence sugge...
123
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...