Kavli Affiliate: Zheng Zhu | First 5 Authors: Kai Wang, Bo Zhao, Xiangyu Peng, Zheng Zhu, Shuo Yang | Summary: Dataset condensation aims at reducing the network training effort through condensing a cumbersome training set into a compact synthetic one. State-of-the-art approaches largely rely on learning the synthetic data by matching the gradients between the […]
Kavli Affiliate: Zheng Zhu | First 5 Authors: Mingjie Zhang, Xuan Zhao, Kenji Watanabe, Takashi Taniguchi, Zheng Zhu | Summary: Many sought-after exotic states of matter are known to emerge close to quantum phase transitions, such as quantum spin liquids (QSL) and unconventional superconductivity. It is thus desirable to experimentally explore systems that can be […]
Kavli Affiliate: Zheng Zhu | First 5 Authors: Mingjie Zhang, Xuan Zhao, Kenji Watanabe, Takashi Taniguchi, Zheng Zhu | Summary: Many sought-after exotic states of matter are known to emerge close to quantum phase transitions, such as quantum spin liquids (QSL) and unconventional superconductivity. It is thus desirable to experimentally explore systems that can be […]
Kavli Affiliate: Zheng Zhu | First 5 Authors: Meng Zeng, Zheng Zhu, Juven Wang, Yi-Zhuang You, | Summary: Lattice regularization of chiral fermions has been a long-standing problem in physics. In this work, we present the density matrix renormalization group (DMRG) simulation of the 3-4-5-0 model of (1+1)D chiral fermions with an anomaly-free chiral U(1) […]
Kavli Affiliate: Yi Zhou | First 5 Authors: Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu, | Summary: The Steiner tree problem, which asks for a minimum weighted tree spanning a given set of terminal vertices in a given graph, is a classic problem arising in numerous practical applications. Many algorithms about this problem emerged […]
Kavli Affiliate: Yi Zhou | First 5 Authors: Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu, | Summary: The Steiner tree problem, which asks for a minimum weighted tree spanning a given set of terminal vertices in a given graph, is a classic problem arising in numerous practical applications. Many algorithms about this problem emerged […]
Kavli Affiliate: Yi Zhou | First 5 Authors: Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu, | Summary: The Steiner tree problem, which asks for a minimum weighted tree spanning a given set of terminal vertices in a given graph, is a classic problem arising in numerous practical applications. Many algorithms about this problem emerged […]
Kavli Affiliate: Leon Balents | First 5 Authors: Léo Mangeolle, Leon Balents, Lucile Savary, , | Summary: We study the intrinsic scattering of phonons by a general quantum degree of freedom, i.e. a fluctuating "field" $Q$, which may have completely general correlations, restricted only by unitarity and translational invariance. From the induced scattering rates, we […]
Kavli Affiliate: Yi Zhou | First 5 Authors: Yi Zhou, Mark van Hoeij, , , | Summary: Linear recurrence operators in characteristic $p$ are classified by their $p$-curvature. For a recurrence operator $L$, denote by $chi(L)$ the characteristic polynomial of its $p$-curvature. We can obtain information about the factorization of $L$ by factoring $chi(L)$. The […]
Kavli Affiliate: Yi Zhou | First 5 Authors: Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov, | Summary: Listing dense subgraphs in large graphs plays a key task in varieties of network analysis applications like community detection. Clique, as the densest model, has been widely investigated. However, in practice, communities rarely form as cliques for […]