Ion-trap quantum information processing:experimental status

Atomic ions trapped in ultra-high vacuum form an especially well-understood and useful physical system for quantum information processing. They provide excellent shielding of quantum information from environmental noise, while strong, well-controlled laser interactions readily provide quantum logic gates. A number of basic quantum information protocols have been demonstrated with trapped ions. Much current work aims at the construction of large-scale ion-trap quantum computers using complex microfabricated trap arrays. Several groups are also actively pursuing quantum interfacing of trapped ions with photons.      

Computing Complex Airy Functions by Numerical Quadrature

Integral representations are considered of solutions of the Airy differential equation w –zw=0 for computing Airy functions for complex values of z. In a first method contour integral representations of the Airy functions are written as non-oscillating integrals for obtaining stable representations, which are evaluated by the trapezoidal rule. In a second method an integral representation is evaluated by using generalized Gauss–Laguerre quadrature; this approach provides a fast method for computing Airy functions to a predetermined accuracy. Comparisons are made with well-known algorithms of Amos, designed for computing Bessel functions of complex argument. Several discrepancies with Amos' code are detected, and it is pointed out for which regions of the complex plane Amos' code is less accurate than the quadrature algorithms. Hints are given in order to build reliable software for complex Airy functions.     

Eigenstates of an operating quantum computer: hypersensitivity to static imperfections

We study the properties of eigenstates of an operating quantum computer which simulates the dynamical evolution in the regime of quantum chaos. Even if the quantum algorithm is polynomial in number of qubits n_q, it is shown that the ideal eigenstates become mixed and strongly modified by static imperfections above a certain threshold which drops exponentially with n_q. Above this threshold the quantum eigenstate entropy grows linearly with n_q but the computation remains reliable during a time scale which is polynomial in the imperfection strength and in n_q. Received 7 March 2002/ Received in final form 3 May 2002 Published online 19 July 2002     

Almost-Sure Results for a Class of Dependent Random Variables

The aim of this note is to establish almost-sure Marcinkiewicz-Zygmund type results for a class of random variables indexed by _d ⁺ —the positive d-dimensional lattice points—and having maximal coefficient of correlation strictly smaller than 1. The class of applications include filters of certain Gaussian sequences and Markov processes.     

一种A da95分布计算的实现模型

在研究 Ａｄａ９５ 分布计算语义的基础上,提出了一个支持 Ａｄａ９５ 的分布计算的实现模型 并讨论了在该环境下实现 Ａｄａ９５ 分布计算所存在的问题和解决方法,以及如何实现非 Ａｄａ９５ 分布计算语义的 Ａｄａ 程序的分布并行计算的问题对于后者,着重讨论了远程会合的实现问题     

软件复用技术实现策略研究

首先分析和提出了一种基于ＯＷＥ（ＯｂｊｅｃｔＷｉｔｈ Ｅｖｅｎｔ）的软构件描述方法,然后深入探讨了如何利用面向对象方法实现软件复用的策略,最后着重分析了继承机制对软件复用的支持以及在分布处理环境中的改进方案．     

NEW EXACT TRAVELLING WAVE SOLUTIONS TO THREE NONLINEAR EVOLUTION EQUATIONS

Based on the computerized symbolic computation, some new exact travelling wave solutions to three nonlinear evolution equations are explicitly obtained by replacing the tanhξ in tanh-function method with the solutions of a new auxiliary ordinary differential equation.     

Numerical algorithms for uniform Airy-type asymptotic expansions

Airy-type asymptotic representations of a class of special functions are considered from a numerical point of view. It is well known that the evaluation of the coefficients of the asymptotic series near the transition point is a difficult problem. We discuss two methods for computing the asymptotic series. One method is based on expanding the coefficients of the asymptotic series in Maclaurin series. In the second method we consider auxiliary functions that can be computed more efficiently than the coefficients in the first method, and we do not need the tabulation of many coefficients. The methods are quite general, but the paper concentrates on Bessel functions, in particular on the differential equation of the Bessel functions, which has a turning point character when order and argument of the Bessel functions are equal.     

Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic

We investigate the definability in monadic ∑₁¹ and monadic Π₁¹ of the problems REG_k, of whether there is a regular subgraph of degree k in some given graph, and XREG_k, of whether, for a given rooted graph, there is a regular subgraph of degree k in which the root has degree k, and their restrictions to graphs in which every vertex has degree at most k, namely REG_k^k and XREG_k^k, respectively, for k ≥ 2 (all our graphs are undirected). Our motivation partly stems from the fact (which we prove here) that REG_k^k and XREG_k^k are logspace equivalent to CONN and REACH, respectively, for k ≥ 3, where CONN is the problem of whether a given graph is connected and REACH is the problem of whether a given graph has a path joining two given vertices. We use monadic first - order reductions, monadic ∑₁¹ games and a recent technique due to Fagin, Stockmeyer and Vardi to almost completely classify whether these problems are definable in monadic ∑₁¹ and monadic Π₁¹, and we compare the definability of these problems (in monadic ∑₁¹ and monadic Π₁¹ with their computational complexity (which varies from solvable using logspace to NP - complete).     

Computation of complex fluid flows using an adaptive grid method

Recently the concept of adaptive grid computation has received much attention in the computational fluid dynamics research community. This paper continues the previous efforts of multiple one-dimensional procedures in developing and asessing the ideas of adaptive grid computation. The focus points here are the issue of numerical stability induced by the grid distribution and the accuracy comparison with previously reported work. Two two-dimensional problems with complicated characteristics—namely, flow in a channel with a sudden expansion and natural convection in an enclosed square cavity—are used to demonstrate some salient features of the adaptive grid method. For the channel flow, by appropriate distribution of the grid points the numerical algorithm can more effectively dampen out the instabilities, especially those related to artificial boundary treatments, and hence can converge to a steady-state solution more rapidly. For a more accurate finite difference operator, which contains less undesirable numerical diffusion, the present adaptive grid method can yield a steady-state and convergent solution, while uniform grids produce non-convergent and numerically oscillating solutions. Furthermore, the grid distribution resulting from the adaptive procedure is very responsive to the different characteristics of laminar and turbulent flows. For the problem of natural convection, a combination of a multiple one-dimensional adaptive procedure and a variational formulation is found very useful. Comparisons of the solutions on uniform and adaptive grids with the reported benchmark calculations demonstrate the important role that the adaptive grid computation can play in resolving complicated flow characteristics.