Information capacity of energy harvesting sensor nodes

Sensor nodes with energy harvesting sources are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting `green communication'. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over an AWGN channel and show that the capacity achieving energy management policies are related to the throughput optimal policies. We also obtain the capacity when energy conserving sleep-wake modes are supported and an achievable rate for the system with inefficiencies in energy storage.

Quantum simulation using fidelity-profile optimization

Experimental quantum simulation of a Hamiltonian H requires unitary operator decomposition (UOD) of its evolution unitary U = exp(-iHt) in terms of native unitary operators of the experimental system. Here, using a genetic algorithm, we numerically evaluate the most generic UOD (valid over a continuous range of Hamiltonian parameters) of the unitary operator U, termed fidelity-profile optimization. The optimization is obtained by systematically evaluating the functional dependence of experimental unitary operators (such as single-qubit rotations and time-evolution unitaries of the system interactions) to the Hamiltonian (H) parameters. Using this technique, we have solved the experimental unitary decomposition of a controlled-phase gate (for any phase value), the evolution unitary of the Heisenberg XY interaction, and simulation of the Dzyaloshinskii-Moriya (DM) interaction in the presence of the Heisenberg XY interaction. Using these decompositions, we studied the entanglement dynamics of a Bell state in the DM interaction and experimentally verified the entanglement preservation procedure of Hou et al. Ann. Phys. (N.Y.) 327, 292 (2012)] in a nuclear magnetic resonance quantum information processor.

A matrix model for QCD

Gribov's observation that global gauge fixing is impossible has led to suggestions that there may be a deep connection between gauge fixing and confinement. We find an unexpected relation between the topological nontriviality of the gauge bundle and colored states in SU(N) Yang-Mills theory, and show that such states are necessarily impure. We approximate QCD by a rectangular matrix model that captures the essential topological features of the gauge bundle, and demonstrate the impure nature of colored states explicitly. Our matrix model also allows the inclusion of the QCD theta-term, as well as to perform explicit computations of low-lying glueball masses. This mass spectrum is gapped. Since an impure state cannot evolve to a pure one by a unitary transformation, our result shows that the solution to the confinement problem in pure QCD is fundamentally quantum information-theoretic.

Universal Hashing for Information-Theoretic Security

The information-theoretic approach to security entails harnessing the correlated randomness available in nature to establish security. It uses tools from information theory and coding and yields provable security, even against an adversary with unbounded computational power. However, the feasibility of this approach in practice depends on the development of efficiently implementable schemes. In this paper, we review a special class of practical schemes for information-theoretic security that are based on 2-universal hash families. Specific cases of secret key agreement and wiretap coding are considered, and general themes are identified. The scheme presented for wiretap coding is modular and can be implemented easily by including an extra preprocessing layer over the existing transmission codes.

A quantitative witness for Greenberger-Horne-Zeilinger entanglement

Along with the vast progress in experimental quantum technologies there is an increasing demand for the quantification of entanglement between three or more quantum systems. Theory still does not provide adequate tools for this purpose. The objective is, besides the quest for exact results, to develop operational methods that allow for efficient entanglement quantification. Here we put forward an analytical approach that serves both these goals. We provide a simple procedure to quantify Greenberger-Horne-Zeilinger-type multipartite entanglement in arbitrary three-qubit states. For two qubits this method is equivalent to Wootters' seminal result for the concurrence. It establishes a close link between entanglement quantification and entanglement detection by witnesses, and can be generalised both to higher dimensions and to more than three parties.

Lattice quantum codes and exotic topological phases of matter

This thesis addresses whether it is possible to build a robust memory device for quantum information. Many schemes for fault-tolerant quantum information processing have been developed so far, one of which, called topological quantum computation, makes use of degrees of freedom that are inherently insensitive to local errors. However, this scheme is not so reliable against thermal errors. Other fault-tolerant schemes achieve better reliability through active error correction, but incur a substantial overhead cost. Thus, it is of practical importance and theoretical interest to design and assess fault-tolerant schemes that work well at finite temperature without active error correction.

In this thesis, a three-dimensional gapped lattice spin model is found which demonstrates for the first time that a reliable quantum memory at finite temperature is possible, at least to some extent. When quantum information is encoded into a highly entangled ground state of this model and subjected to thermal errors, the errors remain easily correctable for a long time without any active intervention, because a macroscopic energy barrier keeps the errors well localized. As a result, stored quantum information can be retrieved faithfully for a memory time which grows exponentially with the square of the inverse temperature. In contrast, for previously known types of topological quantum storage in three or fewer spatial dimensions the memory time scales exponentially with the inverse temperature, rather than its square.

This spin model exhibits a previously unexpected topological quantum order, in which ground states are locally indistinguishable, pointlike excitations are immobile, and the immobility is not affected by small perturbations of the Hamiltonian. The degeneracy of the ground state, though also insensitive to perturbations, is a complicated number-theoretic function of the system size, and the system bifurcates into multiple noninteracting copies of itself under real-space renormalization group transformations. The degeneracy, the excitations, and the renormalization group flow can be analyzed using a framework that exploits the spin model's symmetry and some associated free resolutions of modules over polynomial algebras.

Coding for information storage

Storage systems are widely used and have played a crucial rule in both consumer and industrial products, for example, personal computers, data centers, and embedded systems. However, such system suffers from issues of cost, restricted-lifetime, and reliability with the emergence of new systems and devices, such as distributed storage and flash memory, respectively. Information theory, on the other hand, provides fundamental bounds and solutions to fully utilize resources such as data density, information I/O and network bandwidth. This thesis bridges these two topics, and proposes to solve challenges in data storage using a variety of coding techniques, so that storage becomes faster, more affordable, and more reliable.

We consider the system level and study the integration of RAID schemes and distributed storage. Erasure-correcting codes are the basis of the ubiquitous RAID schemes for storage systems, where disks correspond to symbols in the code and are located in a (distributed) network. Specifically, RAID schemes are based on MDS (maximum distance separable) array codes that enable optimal storage and efficient encoding and decoding algorithms. With r redundancy symbols an MDS code can sustain r erasures. For example, consider an MDS code that can correct two erasures. It is clear that when two symbols are erased, one needs to access and transmit all the remaining information to rebuild the erasures. However, an interesting and practical question is: What is the smallest fraction of information that one needs to access and transmit in order to correct a single erasure? In Part I we will show that the lower bound of 1/2 is achievable and that the result can be generalized to codes with arbitrary number of parities and optimal rebuilding.

We consider the device level and study coding and modulation techniques for emerging non-volatile memories such as flash memory. In particular, rank modulation is a novel data representation scheme proposed by Jiang et al. for multi-level flash memory cells, in which a set of n cells stores information in the permutation induced by the different charge levels of the individual cells. It eliminates the need for discrete cell levels, as well as overshoot errors, when programming cells. In order to decrease the decoding complexity, we propose two variations of this scheme in Part II: bounded rank modulation where only small sliding windows of cells are sorted to generated permutations, and partial rank modulation where only part of the n cells are used to represent data. We study limits on the capacity of bounded rank modulation and propose encoding and decoding algorithms. We show that overlaps between windows will increase capacity. We present Gray codes spanning all possible partial-rank states and using only ``push-to-the-top'' operations. These Gray codes turn out to solve an open combinatorial problem called universal cycle, which is a sequence of integers generating all possible partial permutations.

Quantum optomechanics with silicon nanostructures

Mechanical resonators are the most basic and ubiquitous physical systems known. In on-chip form, they are used to process high frequency signals in every cell phone, television, and laptop. They have also been in the last few decades in different shapes and forms, a critical part of progress in quantum information sciences with kilogram-scale mirrors for gravitational wave detection measuring motion at its quantum limits, and the motion of single ions being used to link qubits for quantum computation.

Optomechanics is a field primarily concerned with coupling light to the motion of mechanical structures. This thesis contains descriptions of recent work with mechanical systems in the megahertz to gigahertz frequency range, formed by nanofabricating novel photonic/phononic structures on a silicon chip. These structures are designed to have both optical and mechanical resonances, and laser light is used to address and manipulate their motional degrees of freedom through radiation pressure forces. We laser cool these mechanical resonators to their ground states, and observe for the first time the quantum zero-point motion of a nanomechanical resonator. Conversely, we show that engineered mechanical resonances drastically modify the optical response of our structures, creating large effective optical nonlinearities not present in bulk silicon. We experimentally demonstrate aspects of these nonlinearities by proposing and observing ``electromagnetically induced transparency'' and light slowed down to 6 m/s, as well as wavelength conversion, and generation of nonclassical optical radiation. Finally, the application of optomechanics to longstanding problems in quantum and classical communications are proposed and investigated.

Quantifying synergistic information

Within the microcosm of information theory, I explore what it means for a system to be functionally irreducible. This is operationalized as quantifying the extent to which cooperative or “synergistic” effects enable random variables X₁, ... , X_n to predict (have mutual information about) a single target random variable Y . In Chapter 1, we introduce the problem with some emblematic examples. In Chapter 2, we show how six different measures from the existing literature fail to quantify this notion of synergistic mutual information. In Chapter 3 we take a step towards a measure of synergy which yields the first nontrivial lowerbound on synergistic mutual information. In Chapter 4, we find that synergy is but the weakest notion of a broader concept of irreducibility. In Chapter 5, we apply our results from Chapters 3 and 4 towards grounding Giulio Tononi’s ambitious φ measure which attempts to quantify the magnitude of consciousness experience.

Quantum computation based on a quantum switch in cavity QED

A feasible scheme for constructing quantum logic gates is proposed on the basis of quantum switches in cavity QED. It is shown that the light field which is fed into the cavity due to the passage of an atom in a certain state can be used to manipulate the conditioned quantum logical gate. In our scheme, the quantum information is encoded in the states of Rydberg atoms and the cavity mode is not used as logical qubits or as a communicating "bus"; thus, the effect of atomic spontaneous emission can be neglected and the strict requirements for the cavity can be relaxed.

基于统计光学的无透镜鬼成像数值模拟与实验验证

作为量子信息领域分支的鬼成像,由于物体的像将出现在不包含物体的光路上的特点,使得这一领域的研究引人入胜。一度认为,只有基于纠缠态双光子的纠缠光源,才能实现鬼成像;但近年来的研究表明,经典热光场也能实现这一过程。从经典统计光学入手,建立了热光场的数值模型,模拟符合热光特性的光场变化、光场传播、以及物体透射函数对热光场的调制,进而从光强度起伏的关联函数中,分别重现振幅型物体和纯相位型物体的傅里叶变换图像;通过与真实实验结果的对比,表明基于统计光学原理的该数值模型所预测的实验结果,与真实的实验结果完全一致。

相位恢复算法在量子关联衍射成像中的应用研究

随着研究工作的逐步深入,目前已经利用经典热光源实现了关联衍射成像,使得该技术有望在X射线以及中子衍射成像等方面得到广泛应用。在实验利用非相干光得到物体无透镜傅里叶变换频谱的基础上,采用误差消除与输入输出恢复算法,并结合过采样理论,实现了实验所用物体透射率函数的恢复。分别得到了纯振幅物体的振幅分布函数与纯相位物体的相位分布函数。此外,还讨论了实验所得傅里叶变换频谱的噪声等因素对图像恢复结果的影响。

Information-theoretic Studies and Capacity Bounds: Group Network Codes and Energy Harvesting Communication Systems

Network information theory and channels with memory are two important but difficult frontiers of information theory. In this two-parted dissertation, we study these two areas, each comprising one part. For the first area we study the so-called entropy vectors via finite group theory, and the network codes constructed from finite groups. In particular, we identify the smallest finite group that violates the Ingleton inequality, an inequality respected by all linear network codes, but not satisfied by all entropy vectors. Based on the analysis of this group we generalize it to several families of Ingleton-violating groups, which may be used to design good network codes. Regarding that aspect, we study the network codes constructed with finite groups, and especially show that linear network codes are embedded in the group network codes constructed with these Ingleton-violating families. Furthermore, such codes are strictly more powerful than linear network codes, as they are able to violate the Ingleton inequality while linear network codes cannot. For the second area, we study the impact of memory to the channel capacity through a novel communication system: the energy harvesting channel. Different from traditional communication systems, the transmitter of an energy harvesting channel is powered by an exogenous energy harvesting device and a finite-sized battery. As a consequence, each time the system can only transmit a symbol whose energy consumption is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is random, instantaneous, and has memory. Furthermore, naturally, the energy harvesting process is observed causally at the transmitter, but no such information is provided to the receiver. Both of these features pose great challenges for the analysis of the channel capacity. In this work we use techniques from channels with side information, and finite state channels, to obtain lower and upper bounds of the energy harvesting channel. In particular, we study the stationarity and ergodicity conditions of a surrogate channel to compute and optimize the achievable rates for the original channel. In addition, for practical code design of the system we study the pairwise error probabilities of the input sequences.

Embedding quantum simulators

79 p.