2479 search results - page 5 / 496 » Quantum complexity theory |
ENTCS
2007
13 years 5 months ago
2007
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
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...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
FCT
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...