130 search results - page 9 / 26 » The Quantum Communication Complexity of Sampling |
ETT
2002
14 years 9 months ago
2002
A method of rare event simulation, termed here quantum simulation, and known also (with some variations) as population Monte Carlo, and Sequential Markov Chain simulation, is appli...
96
Voted
COCO
2004
Springer
15 years 2 months ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
69
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
ISCAS
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper explores subband processing of complex (I/Q) signals which finds various important applications especially in communications signal processing. Instead of using tradit...