Zhiyang He

Xinjiang University — China

Mathematics · Physical Sciences

7h-index219citations38works3.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Limits and Structures in Graph Theory(8), Topic Modeling(7), Natural Language Processing Techniques(7), Quantum Computing Algorithms and Architecture(7), Speech Recognition and Synthesis(6)

Publications38 total

Quantum Codes with Addressable and Transversal Non-Clifford Gates
arXiv (Cornell University)·2025Open Access
Effect of Photoionization Mechanism on Numerical Simulation of Transformer Oil Streamer Discharge
Lecture notes in electrical engineering·2025
E3D-GPT: Enhanced 3D Visual Foundation for Medical Vision-Language Model
arXiv (Cornell University)·2024· 1 citedOpen Access
Quantum Locally Testable Code with Constant Soundness
Quantum·2024· 1 citedOpen Access
Permutation gates in the third level of the Clifford hierarchy
arXiv (Cornell University)·2024· 1 citedOpen Access
Improved QLDPC Surgery: Logical Measurements and Bridging Codes
arXiv (Cornell University)·2024· 1 citedOpen Access
Single-Shot Decoding of Good Quantum LDPC Codes
Communications in Mathematical Physics·2024· 17 citedOpen Access
ECAMP: Entity-centered Context-aware Medical Vision Language Pre-training
arXiv (Cornell University)·2023· 3 citedOpen Access
Single-shot decoding of good quantum LDPC codes
arXiv (Cornell University)·2023Open Access
NLTS Hamiltonians from classical LTCs
arXiv (Cornell University)·2022Open Access
Quantum Locally Testable Code with Constant Soundness
arXiv (Cornell University)·2022· 1 citedOpen Access
Breaking the <i> n <sup>k</sup> </i> barrier for minimum <i>k</i> -cut on simple graphs
2022Open Access
Breaking the $n^k$ Barrier for Minimum $k$-cut on Simple Graphs
arXiv (Cornell University)·2021Open Access
A New Upper Bound on Extremal Number of Even Cycles
The Electronic Journal of Combinatorics·2021· 5 citedOpen Access
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 1 citedOpen Access
Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs.
arXiv (Cornell University)·2020Open Access
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs
arXiv (Cornell University)·2020Open Access
New Upper Bound on Extremal Number of Even Cycles
arXiv (Cornell University)·2020· 2 citedOpen Access
3D Scene Graph: A Structure for Unified Semantics, 3D Space, and Camera
2019· 26 citedOpen Access
Hypergraphs with Few Berge Paths of Fixed Length between Vertices
SIAM Journal on Discrete Mathematics·2019· 10 cited
page 1 of 2Next →

Frequent Co-authors

Ji Wu(13), Ping Lv(6), Jason Li(5), Xien Liu(3), Andrew W. Cross(3), Amir Zamir(2), Jitendra Malik(2), Silvio Savarese(2), Xiao Zhang(2), Ying Su(2), Shouzhen Gu(2), Eugene Tang(2), Libor Caha(2), Shin Ho Choe(2), Aleksander Kubica(2), Michael Tait(2), Rongsheng Wang(2), Qingsong Yao(2), Haoran Lai(2), Xiaodong Tao(2)