22 search results - page 2 / 5 » Bounds on the Quantum Satisfiability Threshold |
IPL
2006
13 years 10 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
COCOON
2005
Springer
14 years 4 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
ADHOCNOW
2003
Springer
14 years 4 months ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...