Distribution dependent stochastic differential equations

Due to their intrinsic link with nonlinear Fokker-Planck equations and many other applications, distribution dependent stochastic differential equations (DDSDEs) have been intensively investigated. In this paper, we summarize some recent progresses in the study of DDSDEs, which include the correspondence of weak solutions and nonlinear Fokker-Planck equations, the well-posedness, regularity estimates, exponential ergodicity, long time large deviations, and comparison theorems.     

Generalized P(N)-graded Lie superalgebras

We generalize the P(N)-graded Lie superalgebras of Martinez-Zelmanov. This generalization is not so restrictive but suffcient enough so that we are able to have a classification for this generalized P(N)-graded Lie superalgebras. Our result is that the generalized P(N)-graded Lie super-algebra L is centrally isogenous to a matrix Lie superalgebra coordinated by an associative superalgebra with a super-involution. Moreover, L is P(N)-graded if and only if the coordinate algebra R is commutative and the super-involution is trivial. This recovers Martinez-Zelmanov's theorem for type P(N). We also obtain a generalization of Kac's coordinatization via Tits-Kantor-Koecher construction. Actually, the motivation of this generalization comes from the Fermionic-Bosonic module construction.     

Interaction induced non-reciprocal three-level quantum transport

Besides its fundamental importance, non-reciprocity has also found many potential applications in quantum technology. Recently, many quantum systems have been proposed to realize non-reciprocity, but stable non-reciprocal process is still experimentally difficult in general, due to the needed cyclical interactions in artificial systems or operational difficulties in solid state materials. Here, we propose a new kind of interaction induced non-reciprocal operation, based on the conventional stimulated-Raman-adiabatic-passage(STIRAP) setup, which removes the experimental difficulty of requiring cyclical interaction, and thus it is directly implementable in various quantum systems. Furthermore, we also illustrate our proposal on a chain of three coupled superconducting transmons, which can lead to a non-reciprocal circulator with high fidelity without a ring coupling configuration as in the previous schemes or implementations. Therefore, our protocol provides a promising way to explore fundamental non-reciprocal quantum physics as well as realize non-reciprocal quantum device.     

移动加热器法生长碲锌镉晶体的组分输运与界面形貌研究

移动加热器法(THM)生长碲锌镉晶体时,界面稳定性对晶体生长的质量有很大影响。本文基于多物理场有限元仿真软件Comsol建立了THM生长碲锌镉晶体的数值模拟模型,讨论了Te边界层与组分过冷区之间的关系,对不同生长阶段的物理场、Te边界层与组分过冷区进行仿真研究,最后讨论了微重力对物理场分布的影响,并对比了微重力与正常重力下的生长界面形貌。模拟结果表明,Te边界层与组分过冷区的分布趋势是一致的,在不同生长阶段,流场中次生涡旋的位置会发生移动,从而导致生长界面的形貌随着生长的进行发生变化,同时微重力条件下形成的生长界面形貌最有利于单晶生长。因此,在晶体生长的中前期,对次生涡旋位置的控制和对组分过冷的削弱,是THM生长高质量晶体的有效方案。     

Quantum algorithm for neighborhood preserving embedding

Neighborhood preserving embedding (NPE) is an important linear dimensionality reduction technique that aims at preserving the local manifold structure. NPE contains three steps, i.e., finding the nearest neighbors of each data point, constructing the weight matrix, and obtaining the transformation matrix. Liang et al. proposed a variational quantum algorithm (VQA) for NPE [Phys. Rev. A 101 032323 (2020)]. The algorithm consists of three quantum sub-algorithms, corresponding to the three steps of NPE, and was expected to have an exponential speedup on the dimensionality n. However, the algorithm has two disadvantages: (i) It is not known how to efficiently obtain the input of the third sub-algorithm from the output of the second one. (ii) Its complexity cannot be rigorously analyzed because the third sub-algorithm in it is a VQA. In this paper, we propose a complete quantum algorithm for NPE, in which we redesign the three sub-algorithms and give a rigorous complexity analysis. It is shown that our algorithm can achieve a polynomial speedup on the number of data points m and an exponential speedup on the dimensionality n under certain conditions over the classical NPE algorithm, and achieve a significant speedup compared to Liang et al.'s algorithm even without considering the complexity of the VQA.