Quantum and classical query complexities for determining connectedness of matroids

by   Xiaowei Huang, et al.

Connectivity is a fundamental structural property of matroids, and has been studied algorithmically over 50 years. In 1974, Cunningham proposed a deterministic algorithm consuming O(n^2) queries to the independence oracle to determine whether a matroid is connected. Since then, no algorithm, not even a random one, has worked better. To the best of our knowledge, the classical query complexity lower bound and the quantum complexity for this problem have not been considered. Thus, in this paper we are devoted to addressing these issues, and our contributions are threefold as follows: (i) First, we prove that the randomized query complexity of determining whether a matroid is connected is Ω(n^2) and thus the algorithm proposed by Cunningham is optimal in classical computing. (ii) Second, we present a quantum algorithm with O(n^3/2) queries, which exhibits provable quantum speedups over classical ones. (iii) Third, we prove that any quantum algorithm requires Ω(n) queries, which indicates that quantum algorithms can achieve at most a quadratic speedup over classical ones. Therefore, we have a relatively comprehensive understanding of the potential of quantum computing in determining the connectedness of matroids.


page 1

page 2

page 3

page 4


On the exact quantum query complexity of MOD_m^n and EXACT_k,l^n

The query model has generated considerable interest in both classical an...

Quantum Algorithms for Escaping from Saddle Points

We initiate the study of quantum algorithms for escaping from saddle poi...

Almost tight bound on the query complexity of generalized Simon's problem

Simon's problem played an important role in the history of quantum algor...

Simon's problem for linear functions

Simon's problem asks the following: determine if a function f: {0,1}^n →...

Quantum-Classical Tradeoffs in the Random Oracle Model

We study tradeoffs between quantum and classical queries for hybrid algo...

k-Forrelation Optimally Separates Quantum and Classical Query Complexity

Aaronson and Ambainis (SICOMP `18) showed that any partial function on N...

Quantum Online Algorithms with Respect to Space Complexity

Online algorithm is a well-known computational model. We introduce quant...

Please sign up or login with your details

Forgot password? Click here to reset