In this paper, we study for the first time how well quantum algorithms perform on matroid properties. We show that quadratic quantum speedup is possible for the calculation problem of finding the girth or the number of circuits (bases, flats, hyperplanes) of a matroid, and the decision problem of deciding whether a matroid is uniform or Eulerian, by giving a uniform lower bound Ω((⌊n/2⌋n)) on the query complexity for all these problems. On the other hand, for the uniform matroid decision problem, we present an asymptotically optimal quantum algorithm which achieves the lower bound, and for the girth problem, we give an almost optimal quantum algorithm with query complexity O(logn(⌊n/2⌋n)). In addition, for the paving matroid decision problem, we prove a lower bound Ω((⌊n/2⌋n)/n) on the query complexity, and give an O((⌊n/2⌋n)) quantum algorithm.
This paper initiates the study of quantum algorithms for matroid property problems. It is shown that quadratic quantum speedup is possible for the calculation problem of finding the girth or the number of circuits (bases, flats, hyperplanes) of a matroid, and for the decision problem of deciding whether a matroid is uniform or Eulerian, by giving a uniform lower bound Ω((⌊n/2⌋n)) on the query complexity for all these problems. On the other hand, for the uniform matroid decision problem, an asymptotically optimal quantum algorithm is proposed which achieves the lower bound, and for the girth problem, an almost optimal quantum algorithm is given with query complexity O(logn(⌊n/2⌋n)). In addition, for the paving matroid decision problem, a lower bound Ω((⌊n/2⌋n)/n) on the query complexity is obtained, and an O((⌊n/2⌋n)) quantum algorithm is presented.
Span programs provide a general method for designing quantum query algorithms, and for Boolean coordinate queries their optimum cost agrees with the general adversary bound. We develop a matroidal organization of this optimization that separates dependence data determined by the query problem from the dependence structure chosen by a span program. The resulting source matroid records query dependence, target determination, and separation data, while a program matroid records dependencies among the target and response-labeled input elements of a candidate program.
When a query problem admits a source matroid, we use its structure to organize adversary upper and lower bounds. For separating binary query sets in this setting, the global matroid-span-program optimum equals AdvQ±(f). For a fixed regular program matroid, projective uniqueness reduces optimization over real representations to positive element weights. We express positive and negative costs as weighted basis ratios and derive exact 1-, 2-, and 3-sum reductions, giving a compositional evaluation of the fixed-weight objective along a Seymour decomposition.
For pointed R10 closure, exact certificates give 3.9087553<AdvQR±(fR)<3.9301. The natural R10 program has optimized cost 5, while another regular program has cost at most 87/5. Recursive self-composition yields a family on N input bits with randomized query complexity Ω(N0.7324867…), an explicit quantum algorithm using O(N0.6500178…) queries, and Q(F)=Θ(Nα) for 0.6204277…<α<0.6229063….
Let M be a bridgeless matroid on ground set {1,...,n} and fM:{0,1}n→{0,1} be the indicator function of its independent sets. A folklore fact is that fM is evasive, i.e., D(fM)=n where D(f) denotes the deterministic decision tree complexity of f. Here we prove query complexity lower bounds for fM in three stronger query models: (a) D⊕(fM)=Ω(n), where D ⊕ (f) denotes the parity decision tree complexity of f; (b) R(fM)=Ω(n/logn), where R(f) denotes the bounded error randomized decision tree complexity of f; and (c) Q(fM)=Ω(n), where Q(f) denotes the bounded error quantum query complexity of f.