2479 search results - page 3 / 496 » Quantum complexity theory |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
COCO
2001
Springer
13 years 9 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
QCQC
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...