Photonic band structure of ZnO photonic crystal slab laser

We recently reported on the first realization of ultraviolet photonic crystal laser based on zinc oxide [Appl. Phys. Lett. {\bf 85}, 3657 (2004)]. Here we present the details of structural design and its optimization. We develop a computational super-cell technique, that allows a straightforward calculation of the photonic band structure of ZnO photonic crystal slab on sapphire substrate. We find that despite of small index contrast between the substrate and the photonic layer, the low order eigenmodes have predominantly transverse-electric (TE) or transverse-magnetic (TM) polarization. Because emission from ZnO thin film shows strong TE preference, we are able to limit our consideration to TE bands, spectrum of which can possess a complete photonic band gap with an appropriate choice of structure parameters. We demonstrate that the geometry of the system may be optimized so that a sizable band gap is achieved.Comment: 8 pages, 7 figure

Submerged discontent and institutions: doctors’ pay in Chinese hospitals.

The paper evaluates doctors’ widespread pay-related discontent, and doctors’ response through formal and informal action. In a context of authoritarian management and compliant trade unions, Chinese doctors can only have individual, subtle and informal confrontation. Meanwhile the doctors’ professional society is expanding its influence, showing a desire to develop doctors’ group identity and protect members’ interests more effectively. The research findings have wider implications for the conceptualization of skilled workers’ professional organizations, which may develop as important new actors in the Chinese industrial relations system

Double-Edge Factor Graphs: Definition, Properties, and Examples

Some of the most interesting quantities associated with a factor graph are its marginals and its partition sum. For factor graphs \emph{without cycles} and moderate message update complexities, the sum-product algorithm (SPA) can be used to efficiently compute these quantities exactly. Moreover, for various classes of factor graphs \emph{with cycles}, the SPA has been successfully applied to efficiently compute good approximations to these quantities. Note that in the case of factor graphs with cycles, the local functions are usually non-negative real-valued functions. In this paper we introduce a class of factor graphs, called double-edge factor graphs (DE-FGs), which allow local functions to be complex-valued and only require them, in some suitable sense, to be positive semi-definite. We discuss various properties of the SPA when running it on DE-FGs and we show promising numerical results for various example DE-FGs, some of which have connections to quantum information processing.Comment: Submitte

Bounding and Estimating the Classical Information Rate of Quantum Channels with Memory

We consider the scenario of classical communication over a finite-dimensional quantum channel with memory using a separable-state input ensemble and local output measurements. We propose algorithms for estimating the information rate of such communication setups, along with algorithms for bounding the information rate based on so-called auxiliary channels. Some of the algorithms are extensions of their counterparts for (classical) finite-state-machine channels. Notably, we discuss suitable graphical models for doing the relevant computations. Moreover, the auxiliary channels are learned in a data-driven approach; i.e., only input/output sequences of the true channel are needed, but not the channel model of the true channel.Comment: This work has been submitted to the IEEE Transactions on Information Theory for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

Estimating the Information Rate of a Channel with Classical Input and Output and a Quantum State (Extended Version)

We consider the problem of transmitting classical information over a time-invariant channel with memory. A popular class of time-invariant channels with memory are finite-state-machine channels, where a \emph{classical} state evolves over time and governs the relationship between the classical input and the classical output of the channel. For such channels, various techniques have been developed for estimating and bounding the information rate. In this paper we consider a class of time-invariant channels where a \emph{quantum} state evolves over time and governs the relationship between the classical input and the classical output of the channel. We propose algorithms for estimating and bounding the information rate of such channels. In particular, we discuss suitable graphical models for doing the relevant computations.Comment: This is an extended version of a paper that appears in Proc. 2017 IEEE International Symposium on Information Theory, Aachen, Germany, June 201