Sciweavers

288 search results - page 6 / 58
» Recent progress in quantum algorithms
Sort
View
MJ
2006
58views more  MJ 2006»
13 years 8 months ago
Wavelength controlled InAs/InP quantum dots for telecom laser applications
This article reviews the recent progress in the growth and device applications of InAs/InP quantum dots (QDs) for telecom applications. Wavelength tuning of the metalorganic vapor...
S. Anantathanasarn, R. Nötzel, P. J. van Veld...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 3 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman

Book
321views
15 years 6 months ago
Algorithms
"This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of ...
S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani
COCO
2008
Springer
90views Algorithms» more  COCO 2008»
13 years 10 months ago
The Power of Unentanglement
r of Unentanglement (Extended Abstract) Scott Aaronson MIT Salman Beigi MIT Andrew Drucker MIT Bill Fefferman University of Chicago Peter Shor MIT The class QMA (k), introduced by...
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill...
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 9 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang