Zimu Li

Zimu Li

Auto-generated profile, based on publicly available information

Zimu Li

Yau Mathematical Sciences Center, Tsinghua University, Beijing, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 May 2023 in PRX Quantum
Verified
Journal Article
Open access
PDF file
HZHan Zheng
Han Zheng
ZLZimu Li
Zimu Li
JLJunyu Liu
Junyu Liu
SSSergii Strelchuk
Sergii Strelchuk
RKRisi Kondor
Risi Kondor
We develop a theoretical framework for Sn-equivariant convolutional quantum circuits with SU(d) symmetry, building on and significantly generalizing Jordan’s permutational quantum computing formalism based on Schur-Weyl duality connecting both SU(d) and Sn actions on qudits. In particular, we utilize the Okounkov-Vershik approach to prove Harrow’s statement on the equivalence between SU(d) and Sn irrep bases and to establish the Sn-equivariant convolutional quantum alternating ansätze (Sn-CQA) using Young-Jucys-Murphy elements. We prove that Sn-CQA is able to generate any unitary in any given Sn irrep sector, which may serve as a universal model for a wide array of quantum machine-learning problems with the presence of SU(d) symmetry. Our method provides another way to prove the universality of the quantum approximate optimization algorithm and verifies that four-local SU(d)-symmetric unitaries are sufficient to build generic SU(d)-symmetric quantum circuits up to relative phase factors. We present numerical simulations to showcase the effectiveness of the ansätze to find the ground-state energy of the J1-J2 antiferromagnetic Heisenberg model on the rectangular and kagome lattices. Our work provides the first application of the celebrated Okounkov-Vershik Sn representation theory to quantum physics and machine learning, from which to propose quantum variational ansätze that strongly suggests to be classically intractable tailored towards a specific optimization problem.

1 December 2022 in Machine Learning: Science and Technology
Verified
Journal Article
Open access
JLJunyu Liu
Junyu Liu
ZLZimu Li
Zimu Li
HZHan Zheng
Han Zheng
XYXiao Yuan
Xiao Yuan
JSJinzhao Sun
Jinzhao Sun
Rapid developments of quantum information technology show promising opportunities for simulating quantum field theory in near-term quantum devices. In this work, we formulate the theory of (time-dependent) variational quantum simulation of the 1 + 1 dimensional λ ϕ 4 quantum field theory including encoding, state preparation, and time evolution, with several numerical simulation results. These algorithms could be understood as near-term variational quantum circuit (quantum neural network) analogs of the Jordan–Lee–Preskill algorithm, the basic algorithm for simulating quantum field theory using universal quantum devices. Besides, we highlight the advantages of encoding with harmonic oscillator basis based on the Lehmann—Symanzik—Zimmermann reduction formula and several computational efficiency such as when implementing a bosonic version of the unitary coupled cluster ansatz to prepare initial states. We also discuss how to circumvent the ‘spectral crowding’ problem in the quantum field theory simulation and appraise our algorithm by both state and subspace fidelities.

26 December 2024 in PRX Quantum
Verified
Journal Article
Open access
ZLZimu Li
Zimu Li
HZHan Zheng
Han Zheng
JLJunyu Liu
Junyu Liu
LJLiang Jiang
Liang Jiang
ZLZi-Wen Liu
Zi-Wen Liu
The generation of k -designs (pseudorandom distributions that emulate the Haar measure up to k moments) with local quantum circuit ensembles is a problem of fundamental importance in quantum information and physics. Despite the extensive understanding of this problem for ordinary random circuits, the crucial situations in which symmetries or conservation laws are in play are known to pose fundamental challenges and remain little understood. Here, we construct explicit local unitary ensembles that can achieve high-order unitary k -designs under transversal continuous symmetry, in the particularly important SU ( d ) case. Specifically, we define the convolutional quantum alternating (CQA) group generated by 4-local SU ( d ) -symmetric Hamiltonians as well as associated 4-local SU ( d ) -symmetric random unitary circuit ensembles and prove that they form and converge to SU ( d ) -symmetric k -designs, respectively, for all k < n ( n − 3 ) / 2 , with n being the number of qudits. A key technique that we employ to obtain the results is the Okounkov-Vershik approach to S n representation theory. To study the convergence time of the CQA ensemble, we develop a numerical method using the Young orthogonal form and the S n branching rule. We provide strong evidence for a subconstant spectral gap and certain convergence time scales of various important circuit architectures, which contrast with the symmetry-free case. We also provide comprehensive explanations of the difficulties and limitations in rigorously analyzing the convergence time using methods that have been effective for cases without symmetries, including Knabe’s local gap threshold and Nachtergaele’s martingale methods. This suggests that a novel approach is likely necessary for understanding the convergence time of SU ( d ) -symmetric local random circuits. Published by the American Physical Society 2024

8 October 2025 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
ZLZimu Li
Zimu Li
HZHan Zheng
Han Zheng
YWYunfei Wang
Yunfei Wang
LJLiang Jiang
Liang Jiang
ZLZi-Wen Liu
Zi-Wen Liu
JLJunyu Liu
Junyu Liu
Quantum information processing in the presence of continuous symmetry is of wide importance and exhibits many novel physical and mathematical phenomena. SU(d) is a continuous symmetry group of particular interest since it represents a fundamental type of non-Abelian symmetry and also plays a vital role in quantum computation. Here, we explicate three particularly interesting applications of SU(d)-symmetric random unitaries in diverse contexts ranging from physics to quantum computing: information scrambling with non-Abelian conserved quantities, covariant quantum error correcting random codes, and geometric quantum machine learning. First, we show that, in the presence of SU(d) symmetry, the local conserved quantities would exhibit residual values even at t → ∞ which decays as Ω(1/n3/2) under local Pauli basis for qubits and \(\Omega (1/{n}^{{(d+2)}^{2}/2})\) under local symmetric basis for general qudits with respect to the system size, in contrast to O(1/n) decay for U(1) case and the exponential decay for no-symmetry case in the sense of out-of-time ordered correlator (OTOC). Second, we show that SU(d)-symmetric unitaries can be used to construct asymptotically optimal (in the sense of saturating the fundamental limits on the code error, or the approximate Eastin–Knill theorems) SU(d)-covariant codes (codes with universal transversal gates) that encode any constant number of logical qudits, extending [Kong & Liu; PRXQ 3, 020314 (2022)]. Finally, we derive an overpartameterization threshold via the quantum neural tangent kernel (QNTK) required for exponential convergence guarantee of generic ansatz for geometric quantum machine learning, which reveals that the number of parameters required scales only with the dimension of desired subspaces rather than that of the entire Hilbert space. Our work invites further research on quantum information with continuous symmetries, where the mathematical tools developed in this work are expected to be useful.

4 August 2023 in Proceedings of the Acm Sigkdd Conference on Knowledge Discovery and Data Mining
Verified
Conference Paper
Open access
XKXuan Kan
Xuan Kan
ZLZimu Li
Zimu Li
HCHejie Cui
Hejie Cui
YYYue Yu
Yue Yu
RXRan Xu
Ran Xu
CYCarl Yang
Carl Yang
Biological networks are commonly used in biomedical and healthcare domains to effectively model the structure of complex biological systems with interactions linking biological entities. However, due to their characteristics of high dimensionality and low sample size, directly applying deep learning models on biological networks usually faces severe overfitting. In this work, we propose R-MIXUP, a Mixup-based data augmentation technique that suits the symmetric positive definite (SPD) property of adjacency matrices from biological networks with optimized training efficiency. The interpolation process in R-MIXUP leverages the log-Euclidean distance metrics from the Riemannian manifold, effectively addressing the swelling effect and arbitrarily incorrect label issues of vanilla Mixup. We demonstrate the effectiveness of R-MIXUP with five real-world biological network datasets on both regression and classification tasks. Besides, we derive a commonly ignored necessary condition for identifying the SPD matrices of biological networks and empirically study its influence on the model performance. The code implementation can be found in Appendix D.

21 May 2024 in Machine Learning: Science and Technology
Verified
Journal Article
Open access
ZLZimu Li
Zimu Li
ZPZihan Pengmei
Zihan Pengmei
HZHan Zheng
Han Zheng
ETErik Thiede
Erik Thiede
JLJunyu Liu
Junyu Liu
RKRisi Kondor
Risi Kondor
Many learning tasks, including learning potential energy surfaces from ab initio calculations, involve global spatial symmetries and permutational symmetry between atoms or general particles. Equivariant graph neural networks are a standard approach to such problems, with one of the most successful methods employing tensor products between various tensors that transform under the spatial group. However, as the number of different tensors and the complexity of relationships between them increase, maintaining parsimony and equivariance becomes increasingly challenging. In this paper, we propose using fusion diagrams, a technique widely employed in simulating SU(2)-symmetric quantum many-body problems, to design new spatial equivariant components for neural networks. This results in a diagrammatic approach to constructing novel neural network architectures. When applied to particles within a given local neighborhood, the resulting components, which we term ‘fusion blocks,’ serve as universal approximators of any continuous equivariant function defined on the neighborhood. We incorporate a fusion block into pre-existing equivariant architectures (Cormorant and MACE), leading to improved performance with fewer parameters on a range of challenging chemical problems. Furthermore, we apply group-equivariant neural networks to study non-adiabatic molecular dynamics of stilbene cis-trans isomerization. Our approach, which combines tensor networks with equivariant neural networks, suggests a potentially fruitful direction for designing more expressive equivariant neural networks.