A coding method for a sequent calculus of propositional logic

The paper deals with a coding method for a sequent calculus of the propositional logic. The method is based on the sequent calculus. It allows us to determine if a formula is derivable in the calculus without constructing a derivation tree. The main advantage of the coding method is its compactness in comparison with derivation trees of the sequent calculus. The coding method can be used as a decision procedure for the propositional logic.     

Quantum Superdense Coding Based on Coherent States in Cavity QED

A physical scheme for the implementation of quantum superdense coding has been proposed in Cavity QED. The detuned interaction between Λ-type three-level atoms and coherent fields constitute the main superdense coding process. The quantum superdense coding can be realized in an easier way, and the atoms are not excited during the whole process, so the effect of atomic decay is eliminated naturally.     

Multi-Class Cost-Constrained Random Coding for Correlated Sources over the Multiple-Access Channel

This paper studies a generalized version of multi-class cost-constrained random-coding ensemble with multiple auxiliary costs for the transmission of N correlated sources over an N-user multiple-access channel. For each user, the set of messages is partitioned into classes and codebooks are generated according to a distribution depending on the class index of the source message and under the constraint that the codewords satisfy a set of cost functions. Proper choices of the cost functions recover different coding schemes including message-dependent and message-independent versions of independent and identically distributed, independent conditionally distributed, constant-composition and conditional constant composition ensembles. The transmissibility region of the scheme is related to the Cover-El Gamal-Salehi region. A related family of correlated-source Gallager source exponent functions is also studied. The achievable exponents are compared for correlated and independent sources, both numerically and analytically.     

基于五离子最大纠缠态的优化隐形传态和超密集编码

我们提出了一个制备五离子最大纠缠态的方案,并利用该纠缠态实现任意两量子比特的隐形传送和超密集编码。超密集编码的信息容量满足Holevo bound,这意味着通过发送三个量子比特可以传送五个经典比特的信息。     

Classification of quantum phases and topology of logical operators in an exactly solved model of quantum codes

Searches for possible new quantum phases and classifications of quantum phases have been central problems in physics. Yet, they are indeed challenging problems due to the computational difficulties in analyzing quantum many-body systems and the lack of a general framework for classifications. While frustration-free Hamiltonians, which appear as fixed point Hamiltonians of renormalization group transformations, may serve as representatives of quantum phases, it is still difficult to analyze and classify quantum phases of arbitrary frustration-free Hamiltonians exhaustively. Here, we address these problems by sharpening our considerations to a certain subclass of frustration-free Hamiltonians, called stabilizer Hamiltonians, which have been actively studied in quantum information science. We propose a model of frustration-free Hamiltonians which covers a large class of physically realistic stabilizer Hamiltonians, constrained to only three physical conditions; the locality of interaction terms, translation symmetries and scale symmetries, meaning that the number of ground states does not grow with the system size. We show that quantum phases arising in two-dimensional models can be classified exactly through certain quantum coding theoretical operators, called logical operators, by proving that two models with topologically distinct shapes of logical operators are always separated by quantum phase transitions.     

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个优化算法,测试结果验证了极坐标编码方法的有效性和可行性.     

第四讲语音信号处理的现状和展望

文章简要介绍了“语音信号处理”这一分支学科形成和发展的历史过程．指出了它在现代信息科学技术中的地位和作用．介绍了语音信号处理在应用领域的一些重要课题，如语音的低速率编码，语音的规则合成和文一语转换系统，语音识别和人一机语音对话等，这些仍然是当前研究的热点．文章最后展望了语音信号处理的发展前景，指出在这个领域还有很多难题等待人们去研究探索．     

一种基于预测分类的小波图像编码

对于小波较像编码，如何有效地组织小波域系数是提高图像压缩效果的关键。本文在研究小波域系数统计特性的基础上，提出一种用于图像压缩的预测分类模式，与基于零树结构的编码不同的是它充分利用了小波域中“重要”系数的各种相关性，并通过结合提出的种子膨胀算法实现系数的分类输出，实验结果表明该方法所取得的压缩效果要优于基于零树结构的图像编码，同时又具有较强的鲁棒性。