Abstract

This brief relates to communication established through high-speed serial links. A serial communication channel can be formed by grouping multiple high-speed serial communication lanes to achieve greater serial bandwidth. Such channels require circuitry to eliminate relative skew across multiple lanes to ensure data integrity in the receiver. Channel bonding is a mechanism used to synchronize serial communication channels in larger data rate and bandwidth applications. This brief presents an approach to channel bonding that optimizes area, power, and initialization time and yields better performance. The ideas discussed here use a delay-based model and explore the possibility of performing channel bonding in a centralized way. The methodology is deployed in the Aurora Protocol Solution Suite, and a comparative analysis with another state-of-the-art approach is performed.

Abstract

We propose an alternate method to sense inertial rotation using semiconductor ring laser gyroscope (SRLG). We show that inertial rotation causes change in the magnitude of voltage across the terminals of semiconductor gain medium which can be measured externally to determine angular rotation velocity. The resonant oscillating frequency of the counter-traveling waves are not involved in the measurement which leads to elimination of lock-in in the gyro. The mathematical analysis and simulation results of the proposed method are also shown.

Abstract

We propose a novel method to eliminate the lock-in in a Semiconductor Fiber Ring Laser Gyroscope by orthogonally polarizing the counter-traveling waves in the ring cavity. Orthogonal polarization reduces the coupling between the waves which prevents them from locking.

Abstract

We find a single parameter family of genuinely entangled three qubit pure states, called maximally Bell inequality violating states, which exhibits maximum Bell inequality violation by the reduced bipartite system for a fixed amount of genuine tripartite correlation. This in turn implies that there holds a complementary relation between the Bell inequality violation by the reduced bipartite systems and the genuine tripartite correlation present in the tripartite pure states. Tangle, generalized geometric measure and discord monogamy score have been considered to quantify the genuine quantum correlation of the tripartite pure states. The complementarity suggests the Bell violation in the reduced two qubit system comes at the price of the total tripartite correlations present in the entire system.

Abstract

It has been suggested that there may exist quantum correlations that go beyond entanglement. The existence of such correlations can be revealed by quantum discord, but not by the conventional measure of entanglement. We argue that a state displays quantumness that can be of local and nonlocal origin. The physical quantity such as the quantum discord probes not only the nonlocal quantumness but also the local quantumness, such as the “local superposition”. This can be a reason why such measures are non-zero when there is no entanglement. We consider a generalized version of the Werner state to demonstrate the interplay of local quantumness, nonlocal quantumness, and classical mixedness of a state.

Abstract

The basic motivation behind this work is to raise the question that whether post selection can be considered a valid physical transformation (on probability space) or not. We study the consequences of both answers set in a device (theory) independent framework, based only on observed statistics. We start with taking up post-selection as an assumption (if the answer is YES) and model the same using independent devices governed by Boolean functions. We establish analogy between the post selection functions and the general probabilistic games in a two party binary input-output scenario. As an observation, we categorize all possible post-selection functions based on the effect on a uniform input probability distribution. We find that post-selection can transform simple no signaling probability distributions to signaling. Similarly, solving NP (nondeterministic polynomial time) complete problems is easy independent of classical or quantum computation (in particular we prove that Post RP (Randomized Polynomial Time) = NP). Finally, we demonstrate an instance of the violation of the pigeon hole principle independent of underlying theory. As result of our theory independent modeling we conclude that post-selection as an assumption adds power to the underlying theory. In particular, quantum mechanics benefits more with the post-selection assumption, only because it admits a more general set of allowed probabilities as compared to the local hidden variable model. Without the assumption (if the answer is NO) we associate a device independent efficiency factor to quantify the cost of post selection. Our study shows that in the real world post-selection is not efficient enough to be of any advantage. But from an adversarial perspective it is still of significance. As an application, we obtain robust bounds on faking the bell violation (correlation in general) in terms of minimum efficiency required using post selection. Here in this work we argue that post-selection as an assumption is not physical. In the real world post-selection is simply dropping trials based on a pre-decided rule. It makes physical reality appear surprising. However, we suggest the use of post-selection with an device independent trial efficiency to avoid anomalous effects.

Abstract

We quantify the amount of correlations generated between two different output modes in the process of imperfect cloning and deletion processes. We use three different measures of quantum correlations and investigate their role in determining the fidelity of the cloning and the deletion. We obtain a bound on the total correlation generated in the successive processes of cloning and deleting operations. This bound displays a new kind of complementary relationship between the quantum correlations required in generating a copy of a quantum state and the amount of correlations required in bringing it back to the original state by deleting and vice versa. Our result shows that the better we clone (delete) a state, the more difficult it will be to bring the state back to its original form by the process of deleting (cloning).

Abstract

In this work, we extensively study the problem of broadcasting of entanglement. In the first part of the work, we reconceptualize the idea of state dependent quantum cloning machine, and in that process we introduce different types of state dependent cloners like static and dynamic state dependent cloners. We derive the conditions under which we can make these cloners independent of the input state. In the broadcasting part, as our resource initial state, we start with general two qubit state and consider specific examples like, non maximally entangled state (NME), Werner like state (WS), and Bell diagonal state (BDS). We apply both state dependent/ state independent cloners, both locally and non-locally, in each of these cases. Incidentally, we find several instances where state dependent cloners outperform state independent cloners in broadcasting. This work gives us a holistic view on the broadcasting of entanglement in various two qubit states, when we have an almost exhaustive sets of cloning machines in our arsenal

Abstract

We present a mathematical analysis and comparison of the performance of integrated on-chip semiconductor ring laser gyroscope (SRLG) fabricated using GaAs/AlGaAs and InP/InGaAsP technologies. The performance parameters of the gyro are modeled in terms of fundamental material, waveguide, and resonator parameters. In addition to this, influence of phenomena specific to semiconductor lasers such as nonlinear coupling, spatial hole burning, gain grating formation, and carrier induced index change on the gyro performance is also included. The analysis helps in identifying critical parameters, which must be optimized to improve the gyro performance.Best achievable performance of integrated SRLG is calculated, and design modifications are suggested to enhance it for high-performance military applications.

Abstract

Graph algorithms play a prominent role in several fields of sciences and engineering. Notable among them are graph traversal, finding the connected components of a graph, and computing shortest paths. There are several efficient implementations of the above problems on a variety of modern multiprocessor architectures. It can be noticed in recent times that the size of the graphs that correspond to real world datasets has been increasing. Parallelism offers only a limited succor to this situation as current parallel architectures have severe short-comings when deployed for most graph algorithms. At the same time, these graphs are also getting very sparse in nature. This calls for particular solution strategies aimed at processing large, sparse graphs on modern parallel architectures.