Demo Data from SIGIR 2026 / reviewers in the wild / expert
Guanzhong Li
dblp:29/7607
· DBLP profile ↗
9ranked-venue papers
7as first author
8since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 6 first-author · 6 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
4 papers |
Quantum computing and quantum information · 53% Computational complexity · 37% Graph algorithms and graph theory · 10% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information
quantum algorithms |
1.6 | 2 | 2025 | Derandomization of quantum algorithm for triangle finding · Inf. Comput. 2025 Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem · SODA 2024 |
Computational complexity
derandomization |
0.9 | 1 | 2025 | Derandomization of quantum algorithm for triangle finding · Inf. Comput. 2025 |
Quantum computing and quantum information › quantum complexity theory
quantum-classical separation |
0.9 | 1 | 2025 | Unbounded quantum-classical separation in sample complexity for sphere center finding · Inf. Comput. 2025 |
Computational complexity › learning theory
sample complexity |
0.9 | 1 | 2025 | Unbounded quantum-classical separation in sample complexity for sphere center finding · Inf. Comput. 2025 |
Graph algorithms and graph theory › subgraph counting
triangle finding |
0.9 | 1 | 2025 | Derandomization of quantum algorithm for triangle finding · Inf. Comput. 2025 |
Computational complexity › structural complexity › complexity class separation
exponential separation |
0.8 | 1 | 2024 | Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem · SODA 2024 |
Computational complexity › query complexity
quantum query complexity |
0.8 | 1 | 2024 | Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem · SODA 2024 |
Quantum computing and quantum information › quantum algorithms
quantum walk |
0.8 | 1 | 2024 | Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem · SODA 2024 |
Quantum computing and quantum information › quantum algorithms
quantum algorithm design |
0.7 | 1 | 2023 | Deterministic quantum search with adjustable parameters: Implementations and applications · Inf. Comput. 2023 |
Quantum computing and quantum information › quantum algorithms
quantum search |
0.7 | 1 | 2023 | Deterministic quantum search with adjustable parameters: Implementations and applications · Inf. Comput. 2023 |
Methods — techniques the papers use, named apart from their topics
sphere center finding · 0.9quantum walk · 0.9quantum query complexity · 0.9derandomization · 0.9coined quantum walks · 0.8classical simulation of predetermined time · 0.8quantum amplitude amplification · 0.7deterministic quantum search · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Revisiting fixed-point quantum search: proof of the quasi-Chebyshev lemma
Guanzhong Li, Shiguang Feng, Lvzhou Li |
Frontiers Comput. Sci. | 1 |
| 2025 | Derandomization of quantum algorithm for triangle finding
Guanzhong Li, Lvzhou Li |
Inf. Comput. | 1 |
| 2025 | Unbounded quantum-classical separation in sample complexity for sphere center finding
Guanzhong Li, Lvzhou Li |
Inf. Comput. | 1 |
| 2024 | Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problemabstractThis work revisits quantum algorithms for the well-known welded tree problem, proposing a very succinct quantum algorithm based on the simplest coined quantum walks. It simply iterates the naturally defined coined quantum walk operator for a predetermined time and finally measure, where the predetermined time can be efficiently computed on classical computers. Then, the algorithm returns the correct answer deterministically, and achieves exponential speedups over any classical algorithm. The significance of the results may be seen as follows. (i) Our algorithm is rather simple compared with the one in (Jeffery and Zur, STOC’2023), which not only breaks the stereotype that coined quantum walks can only achieve quadratic speedups over classical algorithms, but also demonstrates the power of the simplest quantum walk model. (ii) Our algorithm theoretically achieves certainty of success, which is not possible with existing methods. Thus, it becomes one of the few examples that exhibit exponential separation between deterministic (exact) quantum and randomized query complexities, which may also change people's perception that since quantum mechanics is inherently probabilistic, it impossible to have a deterministic quantum algorithm with exponential speedups for the welded tree problem. Guanzhong Li, Lvzhou Li, Jingquan Luo |
SODA | 1 |
| 2024 | Recovering the Original Simplicity: Succinct and Exact Quantum Algorithm for the Welded Tree Problem
Guanzhong Li, Lvzhou Li, Jingquan Luo |
Algorithmica | 1 |
| 2024 | Optimal deterministic quantum algorithm for the promised element distinctness problem
Guanzhong Li, Lvzhou Li |
Theor. Comput. Sci. | 1 |
| 2024 | A Self-Supervised Spaceborne Multispectral and Hyperspectral Image Fusion Unrolling NetworkabstractDeep learning has emerged as the predominant approach for multispectral and hyperspectral image fusion. However, most fusion networks are typically trained and validated on hyperspectral and multispectral image pairs generated from the same hyperspectral images, with degradation simulations inconsistent with real situations and relatively limited volumes of images. When transferring a pretrained multispectral and hyperspectral image fusion model from ground or airborne images to spaceborne images, it encounters a larger dataset and more complex spatial-spectral degradation, leading to spectral distortions and spatial artifacts in the fused images. In this article, the challenges associated with the transfer are addressed through the introduction of a self-supervised multispectral and hyperspectral image fusion unrolling network for spaceborne imagery, termed as MH-FUNet. MH-FUNet adopts a self-supervised paradigm to learn a robust mapping from spaceborne data. It utilizes a deep unrolling network to iteratively refine fusion results from coarse to fine. To account for spatial scale differences between the self-supervised training and test datasets, a multiscale fusion strategy is introduced. This strategy is combined with spectral and spatial attention mechanisms to restore spatial and spectral details. Additionally, a gradient constraint unit is proposed to maintain spatial consistency when up-scaling low-resolution hyperspectral imagery. Performance evaluation of the proposed method is conducted against state-of-the-art fusion techniques on both simulated Chikusei dataset and the proposed real WHU-MHF dataset, which consists of simultaneously observed hyperspectral and multispectral image pairs. MH-FUNet outperforms existing methods across all datasets, demonstrating superior performance in spaceborne multispectral and hyperspectral image fusion experiments. Zengliang Zhu, Xinyu Wang 0003, Guanzhong Li, Yanfei Zhong |
IEEE Trans. Geosci. Remote. Sens. | 3 |
| 2023 | Deterministic quantum search with adjustable parameters: Implementations and applications
Guanzhong Li, Lvzhou Li |
Inf. Comput. | 1 |
| 2009 | Training of recurrent Internal Symmetry Networks by backpropagationabstractInternal symmetry networks are a recently developed class of cellular neural network inspired by the phenomenon of internal symmetry in quantum physics. Their hidden unit activations are acted on non-trivially by the dihedral group of symmetries of the square. Here, we extend Internal symmetry networks to include recurrent connections, and train them by backpropagation to perform two simple image processing tasks. Alan Blair 0001, Guanzhong Li |
IJCNN | 2 |