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.     

ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH

1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv…     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

Aggregate error locator and error value computation in AG codes

The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code.     

天文斑点成像技术中的噪声影响分析

为进一步说明天文像复原新方法-迭代位移叠加法的性质，对探测器的附加噪声在斑点干涉术、斑点掩模法和迭代位移叠加法中的影响分别进行了分析。结果表明：在斑点掩模法中，复杂的噪声高阶矩统计被引入了重谱的噪声偏差，因此对噪声极为敏感，使数据处理更加复杂化；与斑点掩模法相比，迭代位移叠加法仅涉及对噪声的一阶矩统计平均，所以此新方法的特点是对噪声不敏感，具有图像复原处理过程简单快捷的优越性。     

Banach空间中强增生型变分包含解的具误差的Ishikawa迭代逼近

该文研究Ｂａｎａｃｈ空间中一类强增生型变分包含解的存在性及其具误差的Ｉｓｈｉｋａｗａ迭代程序的收敛性问题．该文结果是几位作者早期与最近的相应结果的改进和推广．     

Approximate Inverse Preconditioners for Some Large Dense Random Electrostatic Interaction Matrices

A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners of otherwise similar construction, and especially so when the preconditioners are very sparse. AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30     

The semi‐iterative method applied to the hyper‐power iteration

The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd.     

ITERATIVE APPROXIMATION OF FIXED POINTS OF NON-LIPSCHITZIAN ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS

The purpose of this paper is to investigate the problem of approximating fixed points of non-Lipschitizian asymptotically pseudocontractive mappings in an arbitrary real Banach space by the modified Ishikawa iterative sequences with errors.     

On General Mixed Quasivariational Inequalities

In this paper, we suggest and analyze several iterative methods for solving general mixed quasivariational inequalities by using the technique of updating the solution and the auxiliary principle. It is shown that the convergence of these methods requires either the pseudomonotonicity or the partially relaxed strong monotonicity of the operator. Proofs of convergence is very simple. Our new methods differ from the existing methods for solving various classes of variational inequalities and related optimization problems. Various special cases are also discussed.