Nonequilibrium Quantum Landauer Principle

Using the operational framework of completely positive, trace preserving operations and thermodynamic fluctuation relations, we derive a lower bound for the heat exchange in a Landauer erasure process on a quantum system. Our bound comes from a nonphenomenological derivation of the Landauer principle which holds for generic nonequilibrium dynamics. Furthermore, the bound depends on the nonunitality of dynamics, giving it a physical significance that differs from other derivations. We apply our framework to the model of a spin-1/2 system coupled to an interacting spin chain at finite temperature.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. In particular, the seemingly obvious lower bounds of Ω(m) messages, where m is the number of edges in the network, and Ω(D) time, where D is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even Ω(n), where n is the number of nodes in the network, is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms, except for the restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that D and n were not known. We establish these fundamental lower bounds in this article for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (namely, algorithms that work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an Ω(m) message lower bound for randomized broadcast algorithms. 

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. The answer is known to be negative in the deterministic setting. We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that tradeoff messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

On Infinite Time Performance of Nonlinear Model Predictive Controllers

This paper addresses the problem of infinite time performance of model predictive controllers applied to constrained nonlinear systems. The total performance is compared with a finite horizon optimal cost to reveal performance limits of closed-loop model predictive control systems. Based on the Principle of Optimality, an upper and a lower bound of the ratio between the total performance and the finite horizon optimal cost are obtained explicitly expressed by the optimization horizon. The results also illustrate, from viewpoint of performance, how model predictive controllers approaches to infinite optimal controllers as the optimization horizon increases.

Dual-Hop Cognitive Amplify-and-Forward Relaying Networks over η− μ Fading Channels

This paper presents a thorough performance analysis of dual-hop cognitive amplify-and-forward (AF) relaying networks under spectrum-sharing mechanism over independent non-identically distributed (i.n.i.d.) 􀀀 fading channels. In order to guarantee the quality-of-service (QoS) of primary networks, both maximum tolerable peak interference power Q at the primary users (PUs) and maximum allowable transmit power P at secondary users (SUs) are considered to constrain transmit power at the cognitive transmitters. For integer-valued fading parameters, a closed-form lower bound for the outage probability (OP) of the considered networks is obtained. Moreover, assuming arbitrary-valued fading parameters, the lower bound in integral form for the OP is derived. In order to obtain further insights on the OP performance, asymptotic expressions for the OP at high SNRs are derived, from which the diversity/coding gains and the diversity-multiplexing gain tradeoff (DMT) of the secondary network can be readily deduced. It is shown that the diversity gain and also the DMT are solely determined by the fading parameters of the secondary network whereas the primary network only affects the coding gain. The derived results include several others available in previously published works as special cases, such as those for Nakagami-m fading channels. In addition, performance evaluation results have been obtained by Monte Carlo computer simulations which have verified the accuracy of the theoretical analysis.

A Tractable Approach to Uplink Spectral Efficiency of Two-Tier Massive MIMO Cellular HetNets

This letter investigates the uplink spectral efficiency (SE) of a two-tier cellular network, where massive multiple-input multiple-output macro base stations are overlaid with dense small cells. Macro user equipments (MUEs) and small cells with single user equipment uniformly scattered are modeled as two independent homogeneous Poisson point processes. By applying stochastic geometry, we analyze the SE of the multiuser uplink at a macro base station that employs a zero-forcing detector and we obtain a novel lower bound as well as its approximation. According to the simple and near-exact analytical expression, we observe that the ideal way to improve the SE is by increasing the MUE density and the base station antennas synchronously rather than increasing them individually. Furthermore, a large value of path loss exponent has a positive effect on the SE due to the reduced aggregated interference.

Cell Coverage Optimization for the Multicell Massive MIMO Uplink

We investigate the cell coverage optimization problem for the massive multiple-input multiple-output (MIMO) uplink. By deploying tilt-adjustable antenna arrays at the base stations, cell coverage optimization can become a promising technique which is able to strike a compromise between covering cell-edge users and pilot contamination suppression. We formulate a detailed description of this optimization problem by maximizing the cell throughput, which is shown to be mainly determined by the user distribution within several key geometrical regions. Then, the formulated problem is applied to different example scenarios: for a network with hexagonal shaped cells and uniformly distributed users, we derive an analytical lower bound of the ergodic throughput in the objective cell, based on which, it is shown that the optimal choice for the cell coverage should ensure that the coverage of different cells does not overlap; for a more generic network with sectoral shaped cells and non-uniformly distributed users, we propose an analytical approximation of the ergodic throughput. After that, a practical coverage optimization algorithm is proposed, where the optimal solution can be easily obtained through a simple one-dimensional line searching within a confined searching region. Our numerical results show that the proposed coverage optimization method is able to greatly increase the system throughput in macrocells for the massive MIMO uplink transmission, compared with the traditional schemes where the cell coverage is fixed.

Exploiting Direct Links for Physical Layer Security in Multi-User Multi-Relay Networks

We present two physical layer secure transmission schemes for multi-user multi-relay networks, where the communication from M users to the base station is assisted by direct links and by N decode-and-forward relays. In this network, we consider that a passive eavesdropper exists to overhear the transmitted information, which entails exploiting the advantages of both direct and relay links for physical layer security enhancement. To fulfill this requirement, we investigate two criteria for user and relay selection and examine the achievable secrecy performance. Criterion I performs a joint user and relay selection, while Criterion II performs separate user and relay selections, with a lower implementation complexity. We derive a tight lower bound on the secrecy outage probability for Criterion I and an accurate analytical expression for the secrecy outage probability for Criterion II. We further derive the asymptotic secrecy outage probabilities at high transmit signal-to-noise ratios and high main-to-eavesdropper ratios for both criteria. We demonstrate that the secrecy diversity order is min (MN, M + N) for Criterion I, and N for Criterion II. Finally, we present numerical and simulation results to validate the proposed analysis, and show the occurrence condition of the secrecy outage probability floor

Secrecy Capacity Analysis Over κ–μ Fading Channels: Theory and Applications

In this paper, we consider the transmission of confidential information over a κ-μ fading channel in the presence of an eavesdropper who also experiences κ-μ fading. In particular, we obtain novel analytical solutions for the probability of strictly positive secrecy capacity (SPSC) and a lower bound of secure outage probability (SOPL) for independent and non-identically distributed channel coefficients without parameter constraints. We also provide a closed-form expression for the probability of SPSC when the μ parameter is assumed to take positive integer values. Monte-Carlo simulations are performed to verify the derived results. The versatility of the κ-μ fading model means that the results presented in this paper can be used to determine the probability of SPSC and SOPL for a large number of other fading scenarios, such as Rayleigh, Rice (Nakagamin), Nakagami-m, One-Sided Gaussian, and mixtures of these common fading models. In addition, due to the duality of the analysis of secrecy capacity and co-channel interference (CCI), the results presented here will have immediate applicability in the analysis of outage probability in wireless systems affected by CCI and background noise (BN). To demonstrate the efficacy of the novel formulations proposed here, we use the derived equations to provide a useful insight into the probability of SPSC and SOPL for a range of emerging wireless applications, such as cellular device-to-device, peer-to-peer, vehicle-to-vehicle, and body centric communications using data obtained from real channel measurements.

Achievable sum-rate of multiuser massive MIMO downlink in ricean fading channels

We investigate the achievable ergodic sum-rate of multi-user multiple-input multiple-output systems in Ricean fading channels. We first derive a lower bound on the average signal-to-leakage-and-noise ratio by utilizing the Mullen's inequality, which is then used to analyze the effect of channel mean information on the achievable sum-rate. With these results, a novel statistical-eigenmode space-division multipleaccess downlink transmission scheme is proposed. For this scheme, we derive an exact closed-form expression for the achievable ergodic sum-rate. Our results show that the achievable ergodic sum-rate converges to a saturation value in the high signal-to-noise ratio (SNR) region and reaches to a lower limit value in the lower Ricean K-factor range. In addition, we present tractable upper and lower bounds, which are shown to be tight for any SNR and Ricean K-factor value. Finally, the theoretical analysis is validated via numerical simulations.

Energy efficiency analysis of rank-1 Ricean fading MIMO channels

This paper studies the energy efficiency (EE) of a point-to-point rank-1 Ricean fading multiple-input-multiple-output (MIMO) channel. In particular, a tight lower bound and an asymptotic approximation for the EE of the considered MIMO system are presented, under the assumption that the channel is unknown at the transmitter and perfectly known at the receiver. Moreover, the effects of different system parameters, namely, transmit power, spectral efficiency (SE), and number of transmit and receive antennas, on the EE are analytically investigated. An important observation is that, in the high signal-to-noise ratio regime and with the other system parameters fixed, the optimal transmit power that maximizes the EE increases as the Ricean-K factor increases. On the contrary, the optimal SE and the optimal number of transmit antennas decrease as K increases.

Secure Multiple Amplify-and-Forward Relaying with Co-Channel Interference

We investigate the impact of co-channel interference on the security performance of multiple amplify-and-forward (AF) relaying networks, where N intermediate AF relays assist the data transmission from the source to the destination. The relays are corrupted by multiple co-channel interferers, and the information transmitted from the relays to destination can be overheard by the eavesdropper. In order to deal with the interference and wiretap, the best out of N relays is selected for security enhancement. To this end, we derive a novel lower bound on the secrecy outage probability (SOP), which is then utilized to present two best relay selection criteria, based on the instantaneous and statistical channel information of the interfering links. For these criteria and the conventional maxmin criterion, we quantify the impact of co-channel interference and relay selection by deriving the lower bound on the SOP. Furthermore, we derive the asymptotic SOP for each criterion, to explicitly reveal the impact of transmit power allocation among interferers on the secrecy performance, which offers valuable insights into practical design. We demonstrate that all selection criteria achieve full secrecy diversity order N, while the proposed in this paper two criteria outperform the conventional max-min scheme. 

Estimating quantum chromatic numbers

We develop further the new versions of quantum chromatic numbers of graphs introduced by the first and fourth authors. We prove that the problem of computation of the commuting quantum chromatic number of a graph is solvable by an SDP algorithm and describe an hierarchy of variants of the commuting quantum chromatic number which converge to it. We introduce the tracial rank of a graph, a parameter that gives a lower bound for the commuting quantum chromatic number and parallels the projective rank, and prove that it is multiplicative. We describe the tracial rank, the projective rank and the fractional chromatic numbers in a unified manner that clarifies their connection with the commuting quantum chromatic number, the quantum chromatic number and the classical chromatic number, respectively. Finally, we present a new SDP algorithm that yields a parameter larger than the Lovász number and is yet a lower bound for the tracial rank of the graph. We determine the precise value of the tracial rank of an odd cycle.

Solid-bound, proton-driven, fluorescent ‘off–on–off’ switches based on PET (photoinduced electron transfer)

Anthracene-based, H+-driven, ‘off–on–off’ fluorescent PET (photoinduced electron transfer) switches are immobilized on organic and inorganic polymeric solids in the form of Tentagel® and silica, respectively. The environment of the organic bead displaces apparent switching thresholds towards lower pH values whereas the Si–O- groups of silica electrostatically cause the opposite effect. These switches are ternary logic gate tags, one of which can be particularly useful in strengthening molecular computational identification (MCID) of small solid objects.

The superluminous supernova PS1-11ap: bridging the gap between low and high redshift

We present optical photometric and spectroscopic coverage of the superluminous supernova (SLSN) PS1-11ap, discovered with the Pan-STARRS1 Medium Deep Survey at z = 0.524. This intrinsically blue transient rose slowly to reach a peak magnitude of Mu = −21.4 mag and bolometric luminosity of 8 × 1043 erg s−1 before settling on to a relatively shallow gradient of decline. The observed decline is significantly slower than those of the SLSNe-Ic which have been the focus of much recent attention. Spectroscopic similarities with the lower redshift SN2007bi and a decline rate similar to 56Co decay time-scale initially indicated that this transient could be a candidate for a pair instability supernova (PISN) explosion. Overall the transient appears quite similar to SN2007bi and the lower redshift object PTF12dam. The extensive data set, from 30 d before peak to 230 d after, allows a detailed and quantitative comparison with published models of PISN explosions. We find that the PS1-11ap data do not match these model explosion parameters well, supporting the recent claim that these SNe are not pair instability explosions. We show that PS1-11ap has many features in common with the faster declining SLSNe-Ic, and the light-curve evolution can also be quantitatively explained by the magnetar spin-down model. At a redshift of z = 0.524, the observer-frame optical coverage provides comprehensive rest-frame UV data and allows us to compare it with the SLSNe recently found at high redshifts between z = 2 and 4. While these high-z explosions are still plausible PISN candidates, they match the photometric evolution of PS1-11ap and hence could be counterparts to this lower redshift transient.

Calcium-rich gap transients: Tidal detonations of white dwarfs?

We hypothesize that at least some of the recently discovered class of calcium-rich gap transients are tidal detonation events of white dwarfs (WDs) by black holes (BHs) or possibly neutron stars. We show that the properties of the calcium-rich gap transients agree well with the predictions of the tidal detonation model. Under the predictions of this model, we use a follow-up X-ray observation of one of these transients, SN 2012hn, to place weak upper limits on the detonator mass of this system that include all intermediate-mass BHs (IMBHs). As these transients are preferentially in the stellar haloes of galaxies, we discuss the possibility that these transients are tidal detonations of WDs caused by random flyby encounters with IMBHs in dwarf galaxies or globular clusters. This possibility has been already suggested in the literature but without connection to the calcium-rich gap transients. In order for the random flyby cross-section to be high enough, these events would have to be occurring inside these dense stellar associations. However, there is a lack of evidence for IMBHs in these systems, and recent observations have ruled out all but the very faintest dwarf galaxies and globular clusters for a few of these transients. Another possibility is that these are tidal detonations caused by three-body interactions, where a WD is perturbed towards the detonator in isolated multiple star systems. We highlight a number of ways this could occur, even in lower mass systems with stellar-mass BHs or neutron stars. Finally, we outline several new observational tests of this scenario, which are feasible with current instrumentation.