508 search results - page 83 / 102 » Poly-locality in quantum computing |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
JCC
2008
13 years 7 months ago
2008
: In accounting for the magnetic properties of discrete and extended compounds with unpaired spins, it is crucial to know the nature of their ground and low-lying excited states. I...
GLVLSI
2007
IEEE
14 years 1 months ago
2007
IEEE
Compact realizations of reversible logic functions are of interest in the design of quantum computers. Such reversible functions are realized as a cascade of Toffoli gates. In th...
COCO
2004
Springer
14 years 27 days 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...
ICALP
2003
Springer
14 years 21 days 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...