Adversary lower bounds for nonadaptive quantum algorithms
نویسندگان
چکیده
منابع مشابه
Adversary Lower Bounds for Nonadaptive Quantum Algorithms
We present general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Our results are based on the adversary method of Ambainis.
متن کاملOptimal Quantum Adversary Lower Bounds for Ordered Search
The goal of the ordered search problem is to find a particular item in an ordered list of n items. Using the adversary method, Høyer, Neerbek, and Shi proved a quantum lower bound for this problem of 1 π lnn + Θ(1). Here, we find the exact value of the best possible quantum adversary lower bound for a symmetrized version of ordered search (whose query complexity differs from that of the origina...
متن کاملAn Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract)
This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target keyword in an ordered list of the ith block. Apart from much studied polynomial and adversary methods for quantum query complexity lower bounds, our argumen...
متن کاملLower Bounds for Heuristic Algorithms
The constraint satisfaction problem, the Boolean satisfiability problem and the graph isomorphism problem do not have efficient algorithms. In order to solve these problems, one utilizes heuristic algorithms of polynomial running time. The present thesis studies three classical heuristics for the above-mentioned decision problems and answers the question whether they can be implemented more eff...
متن کاملLower Bounds for Online Algorithms
What is an oline problem Unlike the offline problems that we get the whole input at the beginning, in an online problem we just have some part of the input in advance. The rest of the input are queries that arrive one by one. Upon the arrival of each request, we need to process as it is received. In analyzing online algorithms, we usually, do not really care about the ruing time. The source of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2010
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2009.10.007