零误差计算

研究采用有误差的数值计算来获得无误差的准确值具有重要的理论价值和应用价值.这种通过近似的数值方法获得准确结果的计算被称为零误差计算.本文首先指出,只有一致离散集合中的数才能够开展零误差计算,即有非零隔离界的数集,这也是"数"可以进行零误差计算的一个充要条件.以此为基本出发点,本文分析代数数零误差计算的最低理论精度,该精度对应于恢复近似代数数的准确值时必要的误差控制条件,但由于所采用恢复算法的局限性,这一理论精度往往不能保证成功恢复出代数数的准确值.为此,本文给出采用PSLQ (partial-sum-LQ-decomposition)算法进行代数数零误差计算所需的精度控制条件,与基于LLL (Lenstra-Lenstra-Lovász)算法相比,该精度控制条件关于代数数次数的依赖程度由二次降为拟线性,从而可降低相应算法的复杂度.最后探讨零误差计算未来的发展趋势.     

Implementing a Two-Photon Three-Degrees-of-Freedom Hyper-Parallel Controlled Phase Flip Gate Through Cavity-Assisted Interactions

Hyper-parallel quantum information processing is a promising and beneficial research field. Herein, a method to implement a hyper-parallel controlled-phase-flip (hyper-CPF) gate for frequency-, spatial-, and time-bin-encoded qubits by coupling flying photons to trapped nitrogen vacancy (NV) defect centers is presented. The scheme, which differs from their conventional parallel counterparts, is specifically advantageous in decreasing against the dissipate noise, increasing the quantum channel capacity, and reducing the quantum resource overhead. The gate qubits with frequency, spatial, and time-bin degrees of freedom (DOF) are immune to quantum decoherence in optical fibers, whereas the polarization photons are easily disturbed by the ambient noise.     

电子结构计算的数值方法与理论

第一原理电子结构计算已成为探索与研究物质机理、理解与预测材料性质的重要手段和工具.虽然第一原理电子结构计算取得了巨大的成功，但是如何利用高性能计算机又快又好地计算大规模体系，如何从数学角度理解电子结构模型的合理性与计算的可靠性和有效性，依然充满各种挑战.基于密度泛函理论的第一原理电子结构计算的核心数学模型为Kohn-Sham方程或相应的Kohn-Sham能量泛函极小问题.近年来，人们分别从非线性算子特征值问题的高效离散及Kohn-Sham能量泛函极小问题的最优化方法设计两个方面对电子结构计算的高效算法设计及分析展开了诸多研究.本文重点介绍我们小组在电子结构计算的方法与理论方面的一些进展，同时简单介绍该领域存在的困难与挑战.     

复合材料失效判据有效性验证方法研究

为系统地验证复合材料失效判据计算精度和有效性范围,给出了4种材料体系、6种铺层形式的层合板在单轴、双轴载荷下的失效试验数据,用以评估复合材料失效判据在单向层合板失效包线、多向层合板初始失效包线、多向层合板最终失效包线、层合板变形及层合板的破坏特性等五个方面的预测能力。并根据验证方法和有效性评估策略对失效判据计算精度进行量化考核,给出了失效判据在五个层面上的计算精度。     

Calculating nuclear magnetic resonance chemical shifts in solvated systems

The nuclear magnetic resonance (NMR) chemical shift is extremely sensitive to molecular geometry, hydrogen bonding, solvent, temperature, pH, and concentration. Calculated magnetic shielding constants, converted to chemical shifts, can be valuable aids in NMR peak assignment and can also give detailed information about molecular geometry and intermolecular effects. Calculating chemical shifts in solution is complicated by the need to include solvent effects and conformational averaging. Here, we review the current state of NMR chemical shift calculations in solution, beginning with an introduction to the theory of calculating magnetic shielding in general, then covering methods for inclusion of solvent effects and conformational averaging, and finally discussing examples of applications using calculated chemical shifts to gain detailed structural information.     

A survey on HHL algorithm: From theory to application in quantum machine learning

The Harrow-Hassidim-Lloyd (HHL) algorithm is a method to solve the quantum linear system of equations that may be found at the core of various scientific applications and quantum machine learning models including the linear regression, support vector machines and recommender systems etc. After reviewing the necessary background on elementary quantum algorithms, we provide detailed account of how HHL is exploited in different quantum machine learning (QML) models, and how it provides the desired quantum speedup in all these models. At the end, we briefly discuss some of the remaining challenges ahead for HHL-based QML models and related methods.     

水平悬链线中点集中力作用下的非线性分析及计算

首先，对均布力作用下悬链线理论进行了深入分析研究，推导出求解水平张力单参数和双参数形式的隐含超越方程，在算法上验证了两种方程的等价性。对于悬链线固有的广义倾角、曲率半径、约束反力和水平张力的嵌入关系等给出了具有新意的表达公式。然后，建立了水平悬链线在对称集中力作用下的平衡方程，对于不同垂向集中力作用下水平张力的变化情况和最大垂直距离差所在水平位置随集中力的变化等进行了非线性计算。本文在理论构建和分析方面具有创新性，在理论探索和工程应用上具有重要意义。     

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.     

The maximum number of columns in supersaturated designs with

Cheng and Tang [Biometrika, 88 (2001), pp. 1169–1174] derived an upper bound on the maximum number of columns that can be accommodated in a two‐symbol supersaturated design (SSD) for a given number of rows () and a maximum in absolute value correlation between any two columns (). In particular, they proved that for (mod ) and . However, the only known SSD satisfying this upper bound is when . By utilizing a computer search, we prove that for , and . These results are obtained by proving the nonexistence of certain resolvable incomplete blocks designs. The combinatorial properties of the RIBDs are used to reduce the search space. Our results improve the lower bound for SSDs with rows and columns, for , and . Finally, we show that a skew‐type Hadamard matrix of order can be used to construct an SSD with rows and columns that proves . Hence, we establish for and for all (mod ) such that . Our result also implies that when is a prime power and (mod ). We conjecture that for all and (mod ), where is the maximum number of equiangular lines in with pairwise angle .