BCS-BEC crossover induced by a synthetic non-Abelian gauge field

We investigate the ground state of interacting spin-1/2 fermions in three dimensions at a finite density (rho similar to k(F)(3)) in the presence of a uniform non-Abelian gauge field. The gauge-field configuration (GFC) described by a vector lambda equivalent to (lambda(x),lambda(y),lambda(z)), whose magnitude lambda determines the gauge coupling strength, generates a generalized Rashba spin-orbit interaction. For a weak attractive interaction in the singlet channel described by a small negative scattering length (k(F)vertical bar a(s)vertical bar less than or similar to 1), the ground state in the absence of the gauge field (lambda = 0) is a BCS (Bardeen-Cooper-Schrieffer) superfluid with large overlapping pairs. With increasing gauge-coupling strength, a non-Abelian gauge field engenders a crossover of this BCS ground state to a BEC (Bose-Einstein condensate) of bosons even with a weak attractive interaction that fails to produce a two-body bound state in free vacuum (lambda = 0). For large gauge couplings (lambda/k(F) >> 1), the BEC attained is a condensate of bosons whose properties are solely determined by the Rashba gauge field (and not by the scattering length so long as it is nonzero)-we call these bosons ``rashbons.'' In the absence of interactions (a(s) = 0(-)), the shape of the Fermi surface of the system undergoes a topological transition at a critical gauge coupling lambda(T). For high-symmetry GFCs we show that the crossover from the BCS superfluid to the rashbon BEC occurs in the regime of lambda near lambda(T). In the context of cold atomic systems, these results make an interesting suggestion of obtaining BCS-BEC crossover through a route other than tuning the interaction between the fermions.

On synthesis of easily testable (k, K) circuits

A (k-, K) circuit is one which can be decomposed into nonintersecting blocks of gates where each block has no more than K external inputs, such that the graph formed by letting each block be a node and inserting edges between blocks if they share a signal line, is a partial k-tree. (k, K) circuits are special in that they have been shown to be testable in time polynomial in the number of gates in the circuit, and are useful if the constants k and K are small. We demonstrate a procedure to synthesise (k, K) circuits from a special class of Boolean expressions.

Comparative Analysis of Pilot-Assisted Distributed Cophasing Approaches in Wireless Sensor Networks

This paper compares and analyzes the performance of distributed cophasing techniques for uplink transmission over wireless sensor networks. We focus on a time-division duplexing approach, and exploit the channel reciprocity to reduce the channel feedback requirement. We consider periodic broadcast of known pilot symbols by the fusion center (FC), and maximum likelihood estimation of the channel by the sensor nodes for the subsequent uplink cophasing transmission. We assume carrier and phase synchronization across the participating nodes for analytical tractability. We study binary signaling over frequency-flat fading channels, and quantify the system performance such as the expected gains in the received signal-to-noise ratio (SNR) and the average probability of error at the FC, as a function of the number of sensor nodes and the pilot overhead. Our results show that a modest amount of accumulated pilot SNR is sufficient to realize a large fraction of the maximum possible beamforming gain. We also investigate the performance gains obtained by censoring transmission at the sensors based on the estimated channel state, and the benefits obtained by using maximum ratio transmission (MRT) and truncated channel inversion (TCI) at the sensors in addition to cophasing transmission. Simulation results corroborate the theoretical expressions and show the relative performance benefits offered by the various schemes.

DMT of Wireless Networks: An overview

The e�cient operation of single-source, single-sink wireless network is considered with the diversity-multiplexing gain tradeo� (DMT) as the measure of performance. Whereas in the case of a point-to-point MIMO channel the DMT is determined by the fading statistics, in the case of a network, the DMT is additionally, a function of the time schedule according to which the network is operated, as well as the protocol that dictates the mode of operation of the intermediate relays.In general, it is only possible at present, to provide upper bounds on the DMT of the network in terms of the DMT of the MIMO channel appearing across cuts in the network. This paper presents a tutorial overview on the DMT of half-duplex multi-hop wireless networks that also attempts to identify where possible, codes that achieve the DMT.For example, it is shown how one can construct codes that achieve the DMT of a network under a given schedule and either an amplify-and-forward or decode-and-forward protocol. Also contained in the paper,are discussions on the DMT of the multiple-access channel as well as the impact of feedback on the DMT of a MIMO channel.