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.     

A Distributed Architecture for Secure Delegated Quantum Computation

In this paper, we propose a distributed secure delegated quantum computation protocol, by which an almost classical client can delegate a (dk)-qubit quantum circuit to d quantum servers, where each server is equipped with a 2k-qubit register that is used to process only k qubits of the delegated quantum circuit. None of servers can learn any information about the input and output of the computation. The only requirement for the client is that he or she has ability to prepare four possible qubits in the state of (|0〉+eiθ|1〉)/2, where θ∈{0,π/2,π,3π/2}. The only requirement for servers is that each pair of them share some entangled states (|0〉|+〉+|1〉|−〉)/2 as ancillary qubits. Instead of assuming that all servers are interconnected directly by quantum channels, we introduce a third party in our protocol that is designed to distribute the entangled states between those servers. This would simplify the quantum network because the servers do not need to share a quantum channel. In the end, we show that our protocol can guarantee unconditional security of the computation under the situation where all servers, including the third party, are honest-but-curious and allowed to cooperate with each other.     

Stray light analysis of low-level-light optical system with LightTools software北大核心CSCD

为解决低照度微弱信号探测的微光光学系统杂散光问题,研究了杂散光的原理和特性。利用光学系统建模软件LightTools对微光光学系统进行仿真建模,并开展杂散光分析。为减少杂散光,在物镜筒的筒壁加工消光螺纹,并针对不同形式的消光螺纹,开展了能量仿真模拟。仿真结果表明,采用螺距0.35 mm的消光螺纹,能够将杂散光系数从7%降低到4%。仿真分析结果与实验结果一致,为其他微弱信号探测光学系统在设计阶段对杂散光进行消除提供了指导。     

A PARALLEL COMPUTATION SCHEME FOR IMPLICIT RUNGE-KUTTA METHODS AND THE ITERATIVELY B-CONVERGENCE OF ITS NEWTON ITERATIVE PROCESS

In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.     

Parallel computation of two-point boundary-value problems via particular solutions

Nonlinear two-point boundary-value problems (TPBVP) can be reduced to the iterative solution of a sequence of linear problems by means of quasilinearization techniques. Therefore, the efficient solution of linear problems is the key to the efficient solution of nonlinear problems.Among the techniques available for solving linear two-point boundary-value problems, the method of particular solutions (MPS) is particularly attractive in that it employs only one differential system, the original nonhomogeneous system, albeit with different initial conditions. This feature of MPS makes it ideally suitable for implementation on parallel computers in that the following requirements are met: the computational effort is subdivided into separate tasks (particular solutions) assigned to the different processors; the tasks have nearly the same size; there is little intercommunication between the tasks.For the TPBVP, the speedup achievable is ofO(n), wheren is the dimension of the state vector, hence relatively modest for the differential systems of interest in trajectory optimization and guidance. This being the case, we transform the TPBVP into a multi-point boundary-value problem (MPBVP) involvingm time subintervals, withm–1 continuity conditions imposed at the interface of contiguous subintervals. For the MPBVP, the speedup achievable is ofO(mn), hence substantially higher than that achievable for the TPBVP. It reduces toO(m) if the parallelism is implemented only in the time domain and not in the state domain.A drawback of the multi-point approach is that it requires the solution of a large linear algebraic system for the constants of the particular solutions. This drawback can be offset by exploiting the particular nature of the interface conditions: if the vector of constants for the first subinterval is known, the vector of constants for the subsequent subintervals can be obtained with linear transformations. Using decomposition techniques together with the discrete version of MPS, the size of the linear algebraic system for the multi-point case becomes the same as that for the two-point case.Numerical tests on the Intel iPSC/860 computer show that substantial speedup can be achieved via parallel algorithms vis-a-vis sequential algorithms. Therefore, the present technique has considerable interest for real-time trajectory optimization and guidance.Dedicated to the Memory of Professor Jan M. SkowronskiThis paper, based on Refs. 1–3, is a much condensed version of the material contained in these references.The technical assistance of the Research Center on Parallel Computation of Rice University, Houston, Texas is gratefully acknowledged.     

基于符号分析的极大联合熵延迟时间求取方法

本文通过符号分析法求取联合熵的极大值点, 进而得到相空间重构的最佳延迟时间, 通过对几个典型的混沌系统进行数值仿真试验, 结果表明, 该方法简化了计算, 提高了效率, 能够准确快速地获得最佳延迟时间, 从而有效地重构原系统的相空间, 为混沌信号识别提供一种快速有效的途径. 关键词： 相空间重构 延迟时间 联合熵 符号分析     

Crack growth on the basal plane in single crystal zinc: experiments and computations

Crack propagation on the basal planes in zinc was examined by means of in situ fracture testing of pre-cracked single crystals, with specific attention paid to the fracture mechanism. During quasistatic loading, crack propagation occurred in short bursts of dynamic crack extension followed by periods of arrests, the latter accompanied by plastic deformation and blunting of the crack-tip. In situ observations confirmed nucleation and propagation of microcracks on parallel basal planes and plastic deformation and failure of the linking ligaments. Pre-existing twins in the crack path serve as potent crack arrestors. The crystallographic orientation of the crack growth direction on the basal plane was found to influence both the fracture load as well as the deformation at the crack-tip, producing fracture surfaces of noticeably different appearances. Finite element analysis incorporating crystal plasticity was used to identify dominant slip systems and the stress distribution around the crack-tip in plane stress and plane strain. The computational results are helpful in rationalizing the experimental observations including the mechanism of crack propagation, the orientation dependence of crack-tip plasticity and the fracture surface morphology.     

数值计算与素质培养——理论力学教学改革取得突破性进展

把计算机数值计算方法引入理论力学教学，有利于提高学生素质，实现了使非线性力学成为课程新的基础知识的教学改革目标。     

基于无消相干子空间的量子避错码设计

针对量子系统的联合消相干模型,可以找到一些不受消相干错误影响的系统状态,这种状态被称为相干保持态,所有相干保持态构成的空间就称为无消相干子空间(decoherencefreesubspace,缩写为DFS).利用DFS的特性可以实现自动容错的量子避错码.首先提出一种DFS的定义,并且以定理的形式证明其他DFS的定义都是等价的.然后给出了DFS的存在性定理.最后利用群论的方法设计一种构造DFS的简单方法 关键词： 相干保持态 无消相干子空间 量子避错码 容错量子计算     

On nonoscillating integrals for computing inhomogeneous Airy functions

Integral representations are considered of solutions of the inhomogeneous Airy differential equation . The solutions of these equations are also known as Scorer functions. Certain functional relations for these functions are used to confine the discussion to one function and to a certain sector in the complex plane. By using steepest descent methods from asymptotics, the standard integral representations of the Scorer functions are modified in order to obtain nonoscillating integrals for complex values of . In this way stable representations for numerical evaluations of the functions are obtained. The methods are illustrated with numerical results.