The quantum dynamic capacity formula of a quantum channel

The dynamic capacity theorem characterizes the reliable communication rates of a quantum channel when combined with the noiseless resources of classical communication, quantum communication, and entanglement. In prior work, we proved the converse part of this theorem by making contact with many previous results in the quantum Shannon theory literature. In this work, we prove the theorem with an ??ab initio?? approach, using only the most basic tools in the quantum information theorist??s toolkit: the Alicki-Fannes?? inequality, the chain rule for quantum mutual information, elementary properties of quantum entropy, and the quantum data processing inequality. The result is a simplified proof of the theorem that should be more accessible to those unfamiliar with the quantum Shannon theory literature. We also demonstrate that the ??quantum dynamic capacity formula?? characterizes the Pareto optimal trade-off surface for the full dynamic capacity region. Additivity of this formula reduces the computation of the trade-off surface to a tractable, textbook problem in Pareto trade-off analysis, and we prove that its additivity holds for the quantum Hadamard channels and the quantum erasure channel. We then determine exact expressions for and plot the dynamic capacity region of the quantum dephasing channel, an example from the Hadamard class, and the quantum erasure channel.     

Entanglement-Assisted Capacity of Quantum Multiple-Access Channels

We find a regularized formula for the entanglement-assisted (EA) capacity region for quantum multiple-access channels (QMAC). We illustrate the capacity region calculation with the example of the collective phase-flip channel which admits a single-letter characterization. On the way, we provide a first-principles proof of the EA coding theorem based on a packing argument. We observe that the Holevo-Schumacher-Westmoreland theorem may be obtained from a modification of our EA protocol. We remark on the existence of a family hierarchy of protocols for multiparty scenarios with a single receiver, in analogy to the two-party case. In this way, we relate several previous results regarding QMACs.     

Fault tolerance for home agents in mobile IP

In the conventional IP protocol, whenever a mobile device moves to a different network, it must change its IP address to communicate with other nodes in the Internet. Mobile IP protocol keeps mobile nodes online without changing their IP addresses while changing the attachment points. The packets destined to mobile nodes (MN) are relayed by their home agents (HA). However, once the only one HA fails, all MNs managed by the HA will not receive packets normally. In the paper, we propose a novel protocol with multiple mobile agents (MA) where only double mobility bindings are maintained in the whole system. When an HA is failed, its backup HA can take over it in a short time without fetching the bindings from other places. Besides, we also consider the load balancing between these HAs during HA takeover and recovery. Through the simulation and analyses, we found that our method has less registration overheads, better MN-scalability, less sensitivity on MN mobility, more fault-tolerance robustness, and less takeover time than others.     

Reengineering of Construction Management Process

Applying the business process engineering philosophy, this study focuses on developing a construction management process reengineering (CMPR) method to improve the efficiency of construction management. The CMPR method includes four phases, namely, process representation, process transformation, process evaluation, and reengineering activity. Using CMPR, inefficient operations within a construction company working process can not only be identified, but a new rational operation process can also be developed to improve management efficiency. In this way, the competitive ability of a construction company is also increased. This study argues for the need of a new research agenda in construction management in general. This is illustrated by information technology within construction—in particular, by examining the potential application of the reengineering philosophy. The research possibilities are identified and tested based on the implementation of the CMPR method. To some extent, this study establishes a new agenda of process reengineering for future research.     

Erratum to: The quantum dynamic capacity formula of a quantum channel; Public and private resource trade-offs for a quantum channel

Quantum Information Processing -     

Public and private resource trade-offs for a quantum channel

Collins and Popescu realized a powerful analogy between several resources in classical and quantum information theory. The Collins?CPopescu analogy states that public classical communication, private classical communication, and secret key interact with one another somewhat similarly to the way that classical communication, quantum communication, and entanglement interact. This paper discusses the information-theoretic treatment of this analogy for the case of noisy quantum channels. We determine a capacity region for a quantum channel interacting with the noiseless resources of public classical communication, private classical communication, and secret key. We then compare this region with the classical-quantum-entanglement region from our prior efforts and explicitly observe the information-theoretic consequences of the strong correlations in entanglement and the lack of a super-dense coding protocol in the public-private-secret-key setting. The region simplifies for several realistic, physically-motivated channels such as entanglement-breaking channels, Hadamard channels, and quantum erasure channels, and we are able to compute and plot the region for several examples of these channels.