7486 search results - page 143 / 1498 » The Limits of Quantum Computers |
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
159
click to vote
CORR
2007
Springer
15 years 6 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...
124
click to vote
JCC
2008
15 years 6 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...
150
click to vote
GLVLSI
2007
IEEE
16 years 9 days 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...
155
click to vote
COCO
2004
Springer
15 years 11 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...