493 search results - page 13 / 99 » Quantum Query Complexity of Some Graph Problems |
131
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
114
click to vote
COCOON
2008
Springer
15 years 3 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
107
click to vote
ECCC
2008
15 years 1 months ago
2008
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
105
Voted
AAAI
1990
15 years 2 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
100
Voted
COCO
2008
Springer
15 years 3 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...