Skip to content

Author

Sheng-Gen Zheng

1 paper 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

Optimal Separations Between Randomized and Quantum Query Complexity under Permutation Symmetry

It is proved that every such function over an arbitrary finite alphabet $A$ satisfies R_\varepsilon(f)=O(Q_\varepsilon(f)^2)$, and bounds for graph and hypergraph properties are established, which are tight for permutation-invariant functions and nearly tight for graph and hypergraph properties.

Yun-Qi Huang, Lvzhou Li, Ze-Kun Ye et al. · 0 citations

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