Skip to content

Author

Xing-Yu Zhou

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

Breaking the quantum barriers for Graph Collision

In the graph collision problem, the task is to decide whether a known graph on $n$ vertices contains an edge with both endpoints marked, given query access to the input bits specifying the marked vertices. We first refute the conjectured $\Omega(n^{2/3})$ query lower bound with a bounded error quantum algorithm using $...

A. Cornelissen, Amin Shiraz Gilani, Shiva Kintali et al. · 0 citations
Preprint Sep 2026

Superlinear Quantum Query Lower Bounds for Subgraph Detection

This work proves the first unconditional superlinear lower bounds on the bounded-error quantum query complexity of subgraph detection, and proves an all-ones certificate from a known family when the input bits are sampled independently.

Amin Shiraz Gilani, Xing-Yu Zhou · 2 citations
Preprint Sep 2026

Improved Quantum Query Bounds for Boolean Matrix Product Verification

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 o...

Amin Shiraz Gilani, François Le Gall, Xing-Yu Zhou · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.