Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.40180

Improved Quantum Query Bounds for Boolean Matrix Product Verification

Amin Shiraz Gilani, François Le Gall, Xingyu Zhou

quant-phcs.DSSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations• Revised Oct 5, 2026 (v2)
v1 · Sep 30, 2026v2 · Oct 5, 2026
arXivHTMLPDF

Abstract

We prove the first non-trivial upper bound for the quantum query complexity of Boolean Matrix Product Verification ($\mathsf{BMPV}$), answering a longstanding open question in quantum query complexity. For $n\times n$ matrices, our upper bound is $\widetilde O(n^{17/12})$, improving on the standard $O(n^{3/2})$ bound obtained using Grover search by Buhrman and Špalek [SODA 2006]. We complement this result by showing an $Ω(n^{5/4})$ lower bound, which improves over the previous best known lower bound of $\widetildeΩ(n^{19/18})$ by Childs, Kimmel, and Kothari [ESA 2012]. Our approach centers on a connection with Orthogonal Vectors ($\mathsf{OV}$), which asks whether an indexed list of $n$ Boolean vectors of dimension $n$ contains two vectors with disjoint supports. In particular, we prove equivalences between $\mathsf{OV}$ and $\mathsf{BMPV}$ and establish the above bounds for $\mathsf{OV}$. We also prove a tight $\widetilde Θ(n^{3/2})$ bound for a variant of $\mathsf{BMPV}$ that asks whether the product contains a given row vector. Together, these results imply a polynomial separation between the quantum query complexities of deciding whether a graph has radius at most two and whether it has diameter at most two.

AI Summary

Boolean Matrix Product Verification asks whether three Boolean $n\times n$ matrices satisfy $A\circ B=C$, with multiplication over the Boolean semiring. The paper studies bounded-error quantum query complexity under entrywise oracle access. It gives an upper bound of $\widetilde O(n^{17/12})$, improving the previous $O(n^{3/2})$ Grover-search bound, and a lower bound of $\Omega(n^{5/4})$, improving $\widetilde\Omega(n^{19/18})$. The analysis establishes equivalences, up to constant-factor changes in instance size, between verification, finding an orthogonal pair among $n$ Boolean vectors of dimension $n$, and deciding whether an undirected graph has diameter at most two. Verification is split into two inequalities: one reduces to triangle detection, while the other reduces to Orthogonal Vectors. The upper bound combines sampled pivot vectors, a decomposition of coordinate-search work, variable-time quantum search, and Johnson-graph quantum walks. Tracking first common coordinates removes an intermediate promise on pairwise intersections. The lower bound encodes multiple independent surjectivity instances and uses adversary composition. For the related task of finding a product row equal to a specified vector, the bounds are $\Omega(n^{3/2}/\sqrt{\log n})$ and $O(n^{3/2})$. These also hold for deciding whether graph radius is at most two, giving a polynomial query separation from diameter at most two. The verification bounds remain nonmatching. The upper bound charges only queries, allowing unrestricted computation; comparable running time is left open. Other stated directions include unequal vector dimensions, rectangular products, and radius–diameter separations at larger fixed distance thresholds.

Little sign of AI-generated textAI use disclosed
OpenAI GPT 6 Astra and Anthropic Opus 5.5 were used for literature searches, manuscript drafting and revision, proof development and checking, and LaTeX preparation.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
38 pages

Related papers

Improved output-sensitive quantum algorithms for Boolean matrix multiplication

François Le Gall

We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our results show that the product of two n × n Boolean matrices can be computed on a quantum computer in time Õ(n 3/2 + nℓ 3/4), where ℓ is the number of non-zero entries in the product, improving over the output-sensitive quantum algorithm by Buhrman and ˇ Spalek that runs in Õ(n3/2√ℓ) time. This is done by constructing a quantum version of a recent algorithm by Lingas, using quantum techniques such as quantum counting to exploit the sparsity of the output matrix. As far as query complexity is concerned, our results improve over the quantum algorithm by Vassilevska Williams and Williams based on a reduction to the triangle finding problem. One of the main contributions leading to this improvement is the construction of a triangle finding quantum algorithm tailored especially for the tripartite graphs appearing in the reduction. 1

Symposium on Discrete Algorithms•Jan 17, 2012•17 citations

Superlinear Quantum Query Lower Bounds for Subgraph Detection

Amin Shiraz Gilani, Xingyu Zhou

Subgraph detection asks whether an $n$-vertex graph, accessed through queries to its adjacency matrix, contains a copy of a fixed graph $H$. We prove the first unconditional superlinear lower bounds on the bounded-error quantum query complexity of this problem, answering a longstanding open question. A copy of $H$ is a certificate of constant size, so the adversary method with nonnegative weights cannot prove superlinear lower bounds. For every fixed $r\ge 4$, detecting the clique $K_r$ requires $n^{λ_r-o(1)}$ queries, where $λ_4=19/18$, the exponents $λ_r$ increase strictly with $r$, and $λ_r\ge 2-4\sqrt{2/r}+O(1/r)$. More generally, we prove superlinear lower bounds for detecting every fixed connected graph $H$ with chromatic number $c\ge 4$. These bounds approach quadratic as $c$ grows: for sufficiently large $c$, detection requires $n^{2-O(\sqrt{\log\log c/c})-o(1)}$ queries. Chromatic number alone does not characterize the quantum query complexity of subgraph detection: we show that detecting the complete bipartite graph $K_{r,r}$ requires $n^{β_r-o(1)}$ queries, where $β_{10}=181/180$ and $β_r\ge 2-O(1/\sqrt{r})$. Our main technical result is a lower bound for finding an all-ones certificate from a known family when the input bits are sampled independently. Its proof combines Zhandry's compressed oracle [CRYPTO 2019] with conditioning on a randomly planted certificate, adapting an argument of Belovs [FOCS 2026]. Our hard instances are built from graphs containing many copies of the desired subgraph with limited overlap. For cliques, we use a construction of Gowers and Janzer [CPC 2021]; for complete bipartite graphs, we use a random construction.

quant-pharXiv:2609.40263•Oct 1, 2026•2 citations

Improved Output-Sensitive Quantum Algorithms for Boolean Matrix Multiplication

François Le Gall

We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our results show that the product of two n × n Boolean matrices can be computed on a quantum computer in time Õ (n3/2 + nℓ3/4), where ℓ is the number of non-zero entries in the product, improving over the output-sensitive quantum algorithm by Buhrman and Spalek that runs in Õ(n3/2 √ℓ) time. This is done by constructing a quantum version of a recent algorithm by Lingas, using quantum techniques such as quantum counting to exploit the sparsity of the output matrix. As far as query complexity is concerned, our results improve over the quantum algorithm by Vassilevska Williams and Williams based on a reduction to the triangle finding problem. One of the main contributions leading to this improvement is the construction of a triangle finding quantum algorithm tailored especially for the tripartite graphs appearing in the reduction.

ACM-SIAM Symposium on Discrete Algorithms (SODA)•Jan 17, 2012•17 citations

Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model

Chandrima Kayal, Sayantan Sen, Dániel Szabó

In this work, we study bipartiteness and expansion testing, two canonical problems in graph property testing in the bounded-degree model through the lens of quantum query complexity. In the classical setting, it is known that $\widetildeΘ(\sqrt{N})$ queries are necessary and sufficient for both these testing problems (Goldreich and Ron, 1999, 2000 & 2002), where $N$ denotes the number of vertices of the input graph. Due to their significance, (Ambainis, Childs, and Liu, 2011) initiated the study of these problems in the quantum setting and designed quantum algorithms for bipartiteness and expansion testing that perform $\widetilde{O}(N^{1/3})$ queries, showing a polynomial speedup. They also proved that $\widetildeΩ(N^{1/4})$ queries are necessary for expansion testing, but the possibility of an exponential quantum advantage for bipartiteness testing remained open. Despite significant effort, there has been no improvement in these results in the last decade and a half. In this work, we prove essentially tight $\widetildeΩ(N^{1/3})$ quantum query lower bounds for both bipartiteness and expansion testing, thereby completely characterizing the quantum query complexity of these problems up to polylogarithmic factors. While our proofs use the polynomial method similarly to Ambainis, Childs, and Liu, we use intermediate problems that we relate to the main problems via reductions, and perform a more precise analysis of the resulting polynomials, leading to the near-optimal lower bounds.

quant-pharXiv:2610.01752•Oct 2, 2026•0 citations

Quantum query complexity of graph connectivity

Christoph Dürr, Mehdi Mhalla, Yaohui Lei

Harry Buhrman et al gave an Omega(sqrt n) lower bound for monotone graph properties in the adjacency matrix query model. Their proof is based on the polynomial method. However for some properties stronger lower bounds exist. We give an Omega(n^{3/2}) bound for Graph Connectivity using Andris Ambainis' method, and an O(n^{3/2} log n) upper bound based on Grover's search algorithm. In addition we study the adjacency list query model, where we have almost matching lower and upper bounds for Strong Connectivity of directed graphs.

arXiv:quant-ph/0303169•Mar 27, 2003•8 citations

Quantum lower bounds for convex optimization and real matrix-vector query problems

Andrew M. Childs

We (the author and the AI systems that did the heavy lifting) show that the quantum query complexity of minimizing a convex function over a convex subset of $\mathbb{R}^n$ with evaluation and membership queries is $\tildeΩ(n)$, nearly matching the best known upper bound. In particular, we show this even for quadratic minimization, which is equivalent to inverting an $n \times n$ real matrix using matrix-vector queries. We also show linear or nearly linear lower bounds on the quantum query complexity of computing the trace, the sign of the determinant, and the magnitude of the determinant of a real matrix in the matrix-vector query model. We use a novel quantum lower bound technique, the determinantal witness method, based on identifying a witness whose Fourier transform vanishes on low-rank matrices and that correlates well with the function being computed.

quant-pharXiv:2609.05679•Sep 8, 2026•1 citation
We prove the first non-trivial upper bound for the quantum query complexity of Boolean Matrix Product Verification (BMPV\mathsf{BMPV}BMPV), answering a longstanding open question in quantum query complexity. For n×nn\times nn×n matrices, our upper bound is O~(n17/12)\widetilde O(n^{17/12})O(n17/12), improving on the standard O(n3/2)O(n^{3/2})O(n3/2) bound obtained using Grover search by Buhrman and Špalek [SODA 2006]. We complement this result by showing an Ω(n5/4)Ω(n^{5/4})Ω(n5/4) lower bound, which improves over the previous best known lower bound of Ω~(n19/18)\widetildeΩ(n^{19/18})Ω(n19/18) by Childs, Kimmel, and Kothari [ESA 2012]. Our approach centers on a connection with Orthogonal Vectors (OV\mathsf{OV}OV), which asks whether an indexed list of nnn Boolean vectors of dimension nnn contains two vectors with disjoint supports. In particular, we prove equivalences between OV\mathsf{OV}OV and BMPV\mathsf{BMPV}BMPV and establish the above bounds for OV\mathsf{OV}OV. We also prove a tight Θ~(n3/2)\widetilde Θ(n^{3/2})Θ(n3/2) bound for a variant of BMPV\mathsf{BMPV}BMPV that asks whether the product contains a given row vector. Together, these results imply a polynomial separation between the quantum query complexities of deciding whether a graph has radius at most two and whether it has diameter at most two.
Boolean Matrix Product Verification asks whether three Boolean n×nn\times nn×n matrices satisfy A∘B=CA\circ B=CA∘B=C, with multiplication over the Boolean semiring. The paper studies bounded-error quantum query complexity under entrywise oracle access. It gives an upper bound of O~(n17/12)\widetilde O(n^{17/12})O(n17/12), improving the previous O(n3/2)O(n^{3/2})O(n3/2) Grover-search bound, and a lower bound of Ω(n5/4)\Omega(n^{5/4})Ω(n5/4), improving Ω~(n19/18)\widetilde\Omega(n^{19/18})Ω(n19/18).
The analysis establishes equivalences, up to constant-factor changes in instance size, between verification, finding an orthogonal pair among nnn Boolean vectors of dimension nnn, and deciding whether an undirected graph has diameter at most two. Verification is split into two inequalities: one reduces to triangle detection, while the other reduces to Orthogonal Vectors. The upper bound combines sampled pivot vectors, a decomposition of coordinate-search work, variable-time quantum search, and Johnson-graph quantum walks. Tracking first common coordinates removes an intermediate promise on pairwise intersections. The lower bound encodes multiple independent surjectivity instances and uses adversary composition.
For the related task of finding a product row equal to a specified vector, the bounds are Ω(n3/2/log⁡n)\Omega(n^{3/2}/\sqrt{\log n})Ω(n3/2/logn​) and O(n3/2)O(n^{3/2})O(n3/2). These also hold for deciding whether graph radius is at most two, giving a polynomial query separation from diameter at most two.
The verification bounds remain nonmatching. The upper bound charges only queries, allowing unrestricted computation; comparable running time is left open. Other stated directions include unequal vector dimensions, rectangular products, and radius–diameter separations at larger fixed distance thresholds.
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our results show that the product of two n × n Boolean matrices can be computed on a quantum computer in time Õ(n 3/2 + nℓ 3/4), where ℓ is the number of non-zero entries in the product, improving over the output-sensitive quantum algorithm by Buhrman and ˇ Spalek that runs in Õ(n3/2√ℓ) time. This is done by constructing a quantum version of a recent algorithm by Lingas, using quantum techniques such as quantum counting to exploit the sparsity of the output matrix. As far as query complexity is concerned, our results improve over the quantum algorithm by Vassilevska Williams and Williams based on a reduction to the triangle finding problem. One of the main contributions leading to this improvement is the construction of a triangle finding quantum algorithm tailored especially for the tripartite graphs appearing in the reduction. 1
Subgraph detection asks whether an nnn-vertex graph, accessed through queries to its adjacency matrix, contains a copy of a fixed graph HHH. We prove the first unconditional superlinear lower bounds on the bounded-error quantum query complexity of this problem, answering a longstanding open question. A copy of HHH is a certificate of constant size, so the adversary method with nonnegative weights cannot prove superlinear lower bounds. For every fixed r≥4r\ge 4r≥4, detecting the clique KrK_rKr​ requires nλr−o(1)n^{λ_r-o(1)}nλr​−o(1) queries, where λ4=19/18λ_4=19/18λ4​=19/18, the exponents λrλ_rλr​ increase strictly with rrr, and λr≥2−42/r+O(1/r)λ_r\ge 2-4\sqrt{2/r}+O(1/r)λr​≥2−42/r​+O(1/r). More generally, we prove superlinear lower bounds for detecting every fixed connected graph HHH with chromatic number c≥4c\ge 4c≥4. These bounds approach quadratic as ccc grows: for sufficiently large ccc, detection requires n2−O(log⁡log⁡c/c)−o(1)n^{2-O(\sqrt{\log\log c/c})-o(1)}n2−O(loglogc/c​)−o(1) queries. Chromatic number alone does not characterize the quantum query complexity of subgraph detection: we show that detecting the complete bipartite graph Kr,rK_{r,r}Kr,r​ requires nβr−o(1)n^{β_r-o(1)}nβr​−o(1) queries, where β10=181/180β_{10}=181/180β10​=181/180 and βr≥2−O(1/r)β_r\ge 2-O(1/\sqrt{r})βr​≥2−O(1/r​). Our main technical result is a lower bound for finding an all-ones certificate from a known family when the input bits are sampled independently. Its proof combines Zhandry's compressed oracle [CRYPTO 2019] with conditioning on a randomly planted certificate, adapting an argument of Belovs [FOCS 2026]. Our hard instances are built from graphs containing many copies of the desired subgraph with limited overlap. For cliques, we use a construction of Gowers and Janzer [CPC 2021]; for complete bipartite graphs, we use a random construction.
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our results show that the product of two n × n Boolean matrices can be computed on a quantum computer in time Õ (n3/2 + nℓ3/4), where ℓ is the number of non-zero entries in the product, improving over the output-sensitive quantum algorithm by Buhrman and Spalek that runs in Õ(n3/2 √ℓ) time. This is done by constructing a quantum version of a recent algorithm by Lingas, using quantum techniques such as quantum counting to exploit the sparsity of the output matrix. As far as query complexity is concerned, our results improve over the quantum algorithm by Vassilevska Williams and Williams based on a reduction to the triangle finding problem. One of the main contributions leading to this improvement is the construction of a triangle finding quantum algorithm tailored especially for the tripartite graphs appearing in the reduction.
In this work, we study bipartiteness and expansion testing, two canonical problems in graph property testing in the bounded-degree model through the lens of quantum query complexity. In the classical setting, it is known that Θ~(N)\widetildeΘ(\sqrt{N})Θ(N​) queries are necessary and sufficient for both these testing problems (Goldreich and Ron, 1999, 2000 & 2002), where NNN denotes the number of vertices of the input graph. Due to their significance, (Ambainis, Childs, and Liu, 2011) initiated the study of these problems in the quantum setting and designed quantum algorithms for bipartiteness and expansion testing that perform O~(N1/3)\widetilde{O}(N^{1/3})O(N1/3) queries, showing a polynomial speedup. They also proved that Ω~(N1/4)\widetildeΩ(N^{1/4})Ω(N1/4) queries are necessary for expansion testing, but the possibility of an exponential quantum advantage for bipartiteness testing remained open. Despite significant effort, there has been no improvement in these results in the last decade and a half. In this work, we prove essentially tight Ω~(N1/3)\widetildeΩ(N^{1/3})Ω(N1/3) quantum query lower bounds for both bipartiteness and expansion testing, thereby completely characterizing the quantum query complexity of these problems up to polylogarithmic factors. While our proofs use the polynomial method similarly to Ambainis, Childs, and Liu, we use intermediate problems that we relate to the main problems via reductions, and perform a more precise analysis of the resulting polynomials, leading to the near-optimal lower bounds.
Harry Buhrman et al gave an Omega(sqrt n) lower bound for monotone graph properties in the adjacency matrix query model. Their proof is based on the polynomial method. However for some properties stronger lower bounds exist. We give an Omega(n^{3/2}) bound for Graph Connectivity using Andris Ambainis' method, and an O(n^{3/2} log n) upper bound based on Grover's search algorithm. In addition we study the adjacency list query model, where we have almost matching lower and upper bounds for Strong Connectivity of directed graphs.
We (the author and the AI systems that did the heavy lifting) show that the quantum query complexity of minimizing a convex function over a convex subset of Rn\mathbb{R}^nRn with evaluation and membership queries is Ω~(n)\tildeΩ(n)Ω~(n), nearly matching the best known upper bound. In particular, we show this even for quadratic minimization, which is equivalent to inverting an n×nn \times nn×n real matrix using matrix-vector queries. We also show linear or nearly linear lower bounds on the quantum query complexity of computing the trace, the sign of the determinant, and the magnitude of the determinant of a real matrix in the matrix-vector query model. We use a novel quantum lower bound technique, the determinantal witness method, based on identifying a witness whose Fourier transform vanishes on low-rank matrices and that correlates well with the function being computed.