OnQ-order andR-order of convergence

We give sufficient conditions for a sequence to have theQ-order and/or theR-order of convergence greater than one. If an additional condition is satisfied, then the sequence has an exactQ-order of convergence. We show that our results are sharp and we compare them with older results.This work was supported in part by the National Science Foundation under Grant No. DMS-85-03365. The author wishes to thank J. E. Dennis and R. A. Tapia for helpful comments, and the referee for pointing out a number of typographical and mathematical errors in the original version of this paper.     

Discrete symmetry groups of vertex models in statistical mechanics

We analyze discrete symmetry groups of vertex models in lattice statistical mechanics represented as groups of birational transformations. They can be seen as generated by involutions corresponding respectively to two kinds of transformations onq×q matrices: the inversion of theq×q matrix and an (involutive) permutation of the entries of the matrix. We show that the analysis of the factorizations of the iterations of these transformations is a precious tool in the study of lattice models in statistical mechanics. This approach enables one to analyze two-dimensionalq ⁴-state vertex models as simply as three-dimensional vertex models, or higher-dimensional vertex models. Various examples of birational symmetries of vertex models are analyzed. A particular emphasis is devoted to a three-dimensional vertex model, the 64-state cubic vertex model, which exhibits a polynomial growth of the complexity of the calculations. A subcase of this general model is seen to yield integrable recursion relations. We also concentrate on a specific two-dimensional vertex model to see how the generic exponential growth of the calculations reduces to a polynomial growth when the model becomes Yang-Baxter integrable. It is also underlined that a polynomial growth of the complexity of these iterations can occur even for transformations yielding algebraic surfaces, or higher-dimensional algebraic varieties.     

Global linear convergence of a path-following algorithm for some monotone variational inequality problems

We consider a primal-scaling path-following algorithm for solving a certain class of monotone variational inequality problems. Included in this class are the convex separable programs considered by Monteiro and Adler and the monotone linear complementarity problem. This algorithm can start from any interior solution and attain a global linear rate of convergence with a convergence ratio of 1 ?c/√m, wherem denotes the dimension of the problem andc is a certain constant. One can also introduce a line search strategy to accelerate the convergence of this algorithm.     

PARALLEL DYNAMIC ITERATION METHODS FOR SOLVING NONLINEAR TIME—PERIODIC DIFFERENTIAL—ALGEBRAIC EQUATIONS

In this paper we presented a convergence condition of paralle dynamic iteration meth-ods for a nonlinear system of differential-algebraic equations with a periodic constraint.The convergence criterion is decided by the spectral expressjon of a linear operator derived form system partitions.Numerical experiments given here confirm the theoretical work of the paper.     

Quantum Pattern Recognition with Probability of 100%

In recent years there has been an increasing focus on the quantum pattern recognition, especially quantum multi-pattern recognition in computer science. This paper presents a new quantum multi-pattern recognition method based on the improved Grover’s algorithm. This method not only details the process of quantum multi-pattern recognition using several unitary operators, but also introduces a new design scheme of initializing quantum state and quantum encoding on the pattern set. If the rate of the number of the recognized pattern on the total patterns is over 1/3, this new method can recognize multi-pattern simultaneously with the probability of 100%. Mathematic calculations and simulation results on the case show that the proposed method can accomplish multi-pattern recognition with the probability of 100%. However, the recognition probability of other pattern recognition methods is impossible to reach 1.     

Quantum secret sharing protocol with four state Grover algorithm and its proof-of-principle experimental demonstration

In this article, we propose a three-party quantum secret sharing protocol with four-state Grover algorithm. The protocol has several advantages. It uses only four initial states which simplifies its experimental implementation. It has a higher encoding capacity, each two-qubit state provides two bits of information. We have experimentally demonstrated the protocol in a nuclear magnetic resonance quantum information processor successfully.     

Quantum search via superconducting quantum interference devices in a cavity

We propose a scheme for implementing the Grover search algorithm with two superconducting quantum interference devices (SQUIDs) in a cavity. Our scheme only requires single resonant interaction of the SQUID-cavity system and the required interaction time is very short. The simplicity of the process and the reduction of the interaction time are important for restraining decoherence.     

量子计算算法介绍

量子计算机利用量子力学原理进行计算,具有量子并行计算的优势,能够超越经典计算1990年中期,量子算法取得突破,舒尔(Shor)构造了大数质因子的量子算法,葛洛沃(Grover)构造了无序数据库的量子搜索算法,引起了人们对量子计算的重视,极大地推动了量子计算的研究.文章简单介绍了几个典型的量子算法以及量子算法研究的一些新进展.     

Fixed-Point Iterations for Asymptotically Nonexpansive Mappings in Banach Spaces

In this paper, we suggest and analyze a three-step iterative scheme for asymptotically nonexpansive mappings in Banach spaces. The new iterative scheme includes Ishikawa-type and Mann-type interations as special cases. The results obtained in this paper represent an extension as well as refinement of previous known results.