Quantum Speedup and Limitations on Matroid Property Problems
نویسندگان
چکیده
This paper initiates the study of quantum algorithms for matroid property problems. It is shown that quadratic speedup possible calculation problem finding girth or number circuits (bases, flats, hyperplanes) a matroid, and decision deciding whether uniform Eulerian, by giving lower bound $\Omega(\sqrt{\binom{n}{\lfloor n/2\rfloor}})$ on query complexity all these On other hand, problem, an asymptotically optimal algorithm proposed which achieves bound, almost given with $O(\log n\sqrt{\binom{n}{\lfloor n/2\rfloor}})$. In addition, paving n/2\rfloor}/n})$ obtained, $O(\sqrt{\binom{n}{\lfloor presented.
منابع مشابه
Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems
Siddharth Muthukrishnan, Tameem Albash, and Daniel A. Lidar Department of Physics and Astronomy, University of Southern California, Los Angeles, California 90089, USA Center for Quantum Information Science and Technology, University of Southern California, Los Angeles, California 90089, USA Information Sciences Institute, University of Southern California, Marina del Rey, Califirona 90292, USA ...
متن کاملThrombolysis in Stroke Patients; Problems and Limitations
Thrombolysis for stroke is being used in some developing countries. This study was designed to evaluate the problems of thrombolysis therapy in Iran. During January-July 2008, all patients with ischemic stroke admitted to Ghaem Hospital, Mashhad, northeast Iran, were enrolled in a prospective observational study. Ghaem Hospital is a tertiary care hospital that includes infrastructure for thromb...
متن کاملOn Matroid Representability and Minor Problems
In this paper we look at complexity aspects of the following problem (matroid representability) which seems to play an important role in structural matroid theory: Given a rational matrix representing the matroid M , the question is whether M can be represented also over another specific finite field. We prove this problem is hard, and so is the related problem of minor testing in rational matr...
متن کاملQuantum speedup by quantum annealing.
We study the glued-trees problem from A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (ACM, San Diego, CA, 2003), p. 59. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible. The Hamiltonians involve...
متن کاملSpeedup for Natural Problems
Informally, a language L has speedup if, for any Turing machine (TM) for L, there exists one that is better. Blum [1] showed that there are computable languages that have almost-everywhere speedup. These languages were unnatural in that they were constructed for the sole purpose of having such speedup. We identify an intuitive condition which, like several others in the literature, implies that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2022
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4135930