Entanglement measure and quantum violation of Bell-type inequality for a family of four-qubit entangled states

By calculating entanglement measures and quantum violation of Bell-type inequality, we reveal the relationship between entanglement measure and the amount of quantum violation for a family of four-qubit entangled states. It has been demonstrated that the Bell-type inequality is completely violated by these four-qubit entangled states. The plot of entanglement measure as a function of the expectation value of Bell operator shows that entanglement measure first decreases and then increases smoothly with increasing quantum violation.Comment: 5 pages, 3 figure

Harmonics suppression effect of the quasi-periodic undulator in SASE free-electron-laser

In this paper, the harmonics suppression effect of QPUs in SASE FEL is investigated. The numerical results show that the harmonics power is reduced by using QPUs, but the fundamental radiation power also has a pronounced decrease as the saturation length gets very long. The cases of employing QPUs as parts of undulators are studied. The calculations show that if the fraction of QPUs and their offgap are appropriate in an undulator system, the harmonics radiation could be suppressed remarkably, meanwhile the fundamental saturation length does not increase too much

Fundamental limits of failure identifiability by Boolean Network Tomography

Boolean network tomography is a powerful tool to infer the state (working/failed) of individual nodes from path-level measurements obtained by egde-nodes. We consider the problem of optimizing the capability of identifying network failures through the design of monitoring schemes. Finding an optimal solution is NP-hard and a large body of work has been devoted to heuristic approaches providing lower bounds. Unlike previous works, we provide upper bounds on the maximum number of identifiable nodes, given the number of monitoring paths and different constraints on the network topology, the routing scheme, and the maximum path length. The proposed upper bounds represent a fundamental limit on the identifiability of failures via Boolean network tomography. This analysis provides insights on how to design topologies and related monitoring schemes to achieve the maximum identifiability under various network settings. Through analysis and experiments we demonstrate the tightness of the bounds and efficacy of the design insights for engineered as well as real network