11547 search results - page 29 / 2310 » Quantum computing and communication |
126
click to vote
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
115
click to vote
MSCS
2006
15 years 3 months ago
2006
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
129
Voted
STOC
1997
ACM
15 years 8 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
150
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
104
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...