81,635 research outputs found
Entanglement without nonlocality
We consider the characterization of entanglement from the perspective of a
Heisenberg formalism. We derive an original two-party generalized separability
criteria, and from this describe a novel physical understanding of
entanglement. We find that entanglement may be considered as fundamentally a
local effect, and therefore as a separable computational resource from
nonlocality. We show how entanglement differs from correlation physically, and
explore the implications of this new conception of entanglement for the notion
of classicality. We find that this understanding of entanglement extends
naturally to multipartite cases.Comment: 9 pages. Expanded introduction and sections on physical entanglement
and localit
Secret Key Agreement from Correlated Data, with No Prior Information
A fundamental question that has been studied in cryptography and in
information theory is whether two parties can communicate confidentially using
exclusively an open channel. We consider the model in which the two parties
hold inputs that are correlated in a certain sense. This model has been studied
extensively in information theory, and communication protocols have been
designed which exploit the correlation to extract from the inputs a shared
secret key. However, all the existing protocols are not universal in the sense
that they require that the two parties also know some attributes of the
correlation. In other words, they require that each party knows something about
the other party's input. We present a protocol that does not require any prior
additional information. It uses space-bounded Kolmogorov complexity to measure
correlation and it allows the two legal parties to obtain a common key that
looks random to an eavesdropper that observes the communication and is
restricted to use a bounded amount of space for the attack. Thus the protocol
achieves complexity-theoretical security, but it does not use any unproven
result from computational complexity. On the negative side, the protocol is not
efficient in the sense that the computation of the two legal parties uses more
space than the space allowed to the adversary.Comment: Several small errors have been fixed and the presentation has been
improved, following the reviewers' observation
Political Text Scaling Meets Computational Semantics
During the last fifteen years, automatic text scaling has become one of the
key tools of the Text as Data community in political science. Prominent text
scaling algorithms, however, rely on the assumption that latent positions can
be captured just by leveraging the information about word frequencies in
documents under study. We challenge this traditional view and present a new,
semantically aware text scaling algorithm, SemScale, which combines recent
developments in the area of computational linguistics with unsupervised
graph-based clustering. We conduct an extensive quantitative analysis over a
collection of speeches from the European Parliament in five different languages
and from two different legislative terms, and show that a scaling approach
relying on semantic document representations is often better at capturing known
underlying political dimensions than the established frequency-based (i.e.,
symbolic) scaling method. We further validate our findings through a series of
experiments focused on text preprocessing and feature selection, document
representation, scaling of party manifestos, and a supervised extension of our
algorithm. To catalyze further research on this new branch of text scaling
methods, we release a Python implementation of SemScale with all included data
sets and evaluation procedures.Comment: Updated version - accepted for Transactions on Data Science (TDS
SWIM: A computational tool to unveiling crucial nodes in complex biological networks
SWItchMiner (SWIM) is a wizard-like software implementation of a procedure, previously described, able to extract information contained in complex networks. Specifically, SWIM allows unearthing the existence of a new class of hubs, called "fight-club hubs", characterized by a marked negative correlation with their first nearest neighbors. Among them, a special subset of genes, called "switch genes", appears to be characterized by an unusual pattern of intra- and inter-module connections that confers them a crucial topological role, interestingly mirrored by the evidence of their clinic-biological relevance. Here, we applied SWIM to a large panel of cancer datasets from The Cancer Genome Atlas, in order to highlight switch genes that could be critically associated with the drastic changes in the physiological state of cells or tissues induced by the cancer development. We discovered that switch genes are found in all cancers we studied and they encompass protein coding genes and non-coding RNAs, recovering many known key cancer players but also many new potential biomarkers not yet characterized in cancer context. Furthermore, SWIM is amenable to detect switch genes in different organisms and cell conditions, with the potential to uncover important players in biologically relevant scenarios, including but not limited to human cancer
Computational power of correlations
We study the intrinsic computational power of correlations exploited in
measurement-based quantum computation. By defining a general framework the
meaning of the computational power of correlations is made precise. This leads
to a notion of resource states for measurement-based \textit{classical}
computation. Surprisingly, the Greenberger-Horne-Zeilinger and
Clauser-Horne-Shimony-Holt problems emerge as optimal examples. Our work
exposes an intriguing relationship between the violation of local realistic
models and the computational power of entangled resource states.Comment: 4 pages, 2 figures, 2 tables, v2: introduction revised and title
changed to highlight generality of established framework and results, v3:
published version with additional table I
- …