11547 search results - page 36 / 2310 » Quantum computing and communication |
129
Voted
SODA
2003
ACM
15 years 5 months ago
2003
ACM
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
118
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
122
click to vote
ENTCS
2007
15 years 3 months ago
2007
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
TIT
1998
15 years 3 months ago
1998
We explore some basic properties of coding theory of a general quantum communication channel and its operational capacity, including (1) adaptive measurement with feedback code, (...
128
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...