11547 search results - page 16 / 2310 » Quantum computing and communication |
110
Voted
COCO
2004
Springer
15 years 7 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
135
click to vote
ENTCS
2006
15 years 1 months ago
2006
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
110
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
118
Voted
AIEDAM
2008
15 years 2 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
121
Voted
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...