Deterministic quantum dense coding with cluster state in optical systems

We propose two optical schemes for implementing the deterministic single-particle and two-particle quantum dense coding using four-qubit cluster states. In the protocols, the photon is neuter particle, so it has longer decoherence time with the environment than other particles. It is easy to implement single-bit gate using the linear optical elements under certain conditions, so the transformations performed on the photons by Alice can be easily achieved. Here the cluster states can be exactly discriminated using the parity detector, PBS and FS-PBS. In addition, the success probabilities of the dense coding are both equal to 1.     

一种基于极坐标编码的果蝇优化算法

针对果蝇优化算法易陷入早熟收敛、收敛速度慢、寻优精度低的缺点,提出一种基于极坐标编码的果蝇优化算法.为提高果蝇优化算法的寻优精度,采用极坐标编码的形式,以增加单个母体寻优空间表示方法的多样性,并使种群中的个体,在围绕个体的整个超球体内随机搜索,使个体的搜索范围更加广泛.在迭代寻优过程中,根据适应度值和概率调整极角,逐渐降低观测结果的不确定性.通过9个基准测试函数,对基于极坐标编码的果蝇优化算法进行仿真实验,结果表明了算法在收敛性和稳定性方面,优于其它5个优化算法,测试结果验证了极坐标编码方法的有效性和可行性.     

CARTscans: A Tool for Visualizing Complex Models

We present CARTscans, a graphical tool that displays predicted values across a fourdimensional subspace. We show how these plots are useful for understanding the structure and relationships between variables in a wide variety of models, including (but not limited to) regression trees, ensembles of trees, and linear regressions with varying degrees of interactions. In addition, the common visualization framework allows diverse complex models to be visually compared in a way that illuminates the similarities and differences in the underlying methods, facilitates the choice of a particular model structure, and provides a useful check for implausible predictions of future observations in regions with little or no data.     

波前编码系统成像特性的空间域分析

波前编码技术在大幅度地增加光学系统景深的同时,可以抑制各种离焦类型的像差。目前波前编码系统的成像特性分析大多是基于空间频率域的分析,在应用稳定相法导出三次型相位板波前编码系统的点扩展函数近似解析式的基础之上,描述了点扩展函数的边界、带宽与振荡等特性,分析了波前编码系统对离焦、像散、彗差等常见像差的敏感性,从空间域进一步分析了波前编码系统的成像特性。     

A quantum dense coding implementation in an ion trap

This paper reports that a quantum dense coding can be implemented with ions confined in a linear trap and interacting with laser beams. The scheme is insensitive to the interaction between the quantum channel and the environment. The Bell-state measurement is not involved and the probability of success in our scheme is $1.0$.     

Scheme for Implementing Quantum Dense Coding and Teleportation with Tripartite Entangled State in Cavity QED

In this paper, we present a peculiar tripartite entangled state that is inequivalent to both the GHZ state and the W state, and then propose to implement efficient quantum information processing such as quantum dense coding and teleportation with this entangled state in cavity QED. In this scheme the atoms interact with a highly detuned cavity field with the assistance of a strong classical driven field. It does not require the transfer of quantum information between the atomic system and the cavity, and then our scheme is insensitive to both the cavity decay and the thermal field.     

Statistical thermodynamic formalism in the solution of information theory problems

This is the first of several papers dealing with the application of statistical thermodynamic methodology to the solution of coding and communication theory problems. Emphasis is placed on the various ensemble techniques of statistical mechanics, the words or samples of a message taking the place of molecules in the prototype physical system. Analogs of temperature, internal energy, pressure, chemical potential, volume, entropy, etc., are developed. The isomorphism with thermodynamics is complete and these quantities transform (for example, by partial differentiation) in exactly the same way as the prototype physical quantities. The methods are nicely applicable to coding cases involving sources with memory, in which case, correlation can be discussed in terms of analog coupling energies between signals or words so that the store of many-body-problem techniques can be used. In addition, the manipulative freedom stemming from the possibility of choosing from a multiplicity of ensembles constrained by intensive parameters proves a distinct advantage. A concrete example dealing with the choice of a compact code for a nonextended source with memory is presented. The compact code is derived, and some discussion is given concerning the breadth of its power spectrum. In a following paper, its autocorrelation function within the framework of pulse code modulation is derived and transformed by Wiener theory so that the power spectrum is directly exhibited (along with the spectra for several other cases).Research supported under AFOSR Grant No. 70-1877. The present work is contribution No. 2643 of the Department of Chemistry, University of California-Los Angeles.     

Fast vectorized algorithm for the Monte Carlo simulation of the random field Ising model

An algorithm for the simulation of the 3-dimensional random field Ising model with a binary distribution of the random fields is presented. It uses multi-spin coding and simulates 64 physically different systems simultaneously. On one processor of a Cray YMP it reaches a speed of 184 million spin updates per second. For smaller field strength we present a version of the algorithm that can perform 242 million spin updates per second on the same machine.     

Joint impact of nodes-mobility and channel estimation error on the performance of two-way relay systems

This paper presents the performance analysis of a two-way relay system with nodes-mobility (NM) and channel estimation errors (CEE) under time-varying Rayleigh fading. Herein, analog network coding protocol is employed at the relay node. All the participating nodes are half-duplex and equipped with single-antenna devices. Specifically, we utilize first-order Markovian model to characterize the impact of NM in the channel. Along with the NM, we also consider that the CEE may exist in practical scenarios, where nodes require to estimate the channel state information. By incorporating these factors, we first derive the instantaneous end-to-end (e2e) signal-to-noise ratios (SNRs) at two source nodes. Then, we obtain the exact closed-form expressions for distribution and density functions of the two e2e SNRs. After that, we derive the accurate expressions of various performance metrics, viz., sum-bit error rate, overall outage probability, and ergodic sum-rate. Further, to attain more insights into the considered system, we deduce the asymptotic behavior of these performance metrics. Finally, numerical and Monte-Carlo simulation results are provided to validate our theoretical analysis and to illustrate the impact of NM and CEE on the performance measures of the considered system.