Polarization Entanglement Purification using Spatial Entanglement

Parametric down-conversion can produce photons that are entangled both in polarization and in space. Here we show how the spatial entanglement can be used to purify the polarization entanglement using only linear optical elements. Spatial entanglement as an additional resource leads to a substantial improvement in entanglement output compared to a previous scheme. Interestingly, in the present context the thermal character of down-conversion sources can be turned into an advantage. Our scheme is realizable with current technology.Comment: 5 pages, 2 figure

Robust and Efficient Quantum Repeaters with Atomic Ensembles and Linear Optics

In the last few years there has been a lot of interest in quantum repeater protocols using only atomic ensembles and linear optics. Here we show that the local generation of high-fidelity entangled pairs of atomic excitations, in combination with the use of two-photon detections for long-distance entanglement generation, permits the implementation of a very attractive quantum repeater protocol. Such a repeater is robust with respect to phase fluctuations in the transmission channels, and at the same time achieves higher entanglement generation rates than other protocols using the same ingredients. We propose an efficient method of generating high-fidelity entangled pairs locally, based on the partial readout of the ensemble-based memories. We also discuss the experimental implementation of the proposed protocol.Comment: 7 pages, 3 figures, accepted version (to appear in Phys. Rev. A

nuID: a universal naming scheme of oligonucleotides for Illumina, Affymetrix, and other microarrays

<p>Abstract</p> <p>Background</p> <p>Oligonucleotide probes that are sequence identical may have different identifiers between manufacturers and even between different versions of the same company's microarray; and sometimes the same identifier is reused and represents a completely different oligonucleotide, resulting in ambiguity and potentially mis-identification of the genes hybridizing to that probe.</p> <p>Results</p> <p>We have devised a unique, non-degenerate encoding scheme that can be used as a universal representation to identify an oligonucleotide across manufacturers. We have named the encoded representation 'nuID', for nucleotide universal identifier. Inspired by the fact that the raw sequence of the oligonucleotide is the true definition of identity for a probe, the encoding algorithm uniquely and non-degenerately transforms the sequence itself into a compact identifier (a lossless compression). In addition, we added a redundancy check (checksum) to validate the integrity of the identifier. These two steps, encoding plus checksum, result in an nuID, which is a unique, non-degenerate, permanent, robust and efficient representation of the probe sequence. For commercial applications that require the sequence identity to be confidential, we have an encryption schema for nuID. We demonstrate the utility of nuIDs for the annotation of Illumina microarrays, and we believe it has universal applicability as a source-independent naming convention for oligomers.</p> <p>Reviewers</p> <p>This article was reviewed by Itai Yanai, Rong Chen (nominated by Mark Gerstein), and Gregory Schuler (nominated by David Lipman).</p

Detection of False Data Injection Attacks Using the Autoencoder Approach

State estimation is of considerable significance for the power system operation and control. However, well-designed false data injection attacks can utilize blind spots in conventional residual-based bad data detection methods to manipulate measurements in a coordinated manner and thus affect the secure operation and economic dispatch of grids. In this paper, we propose a detection approach based on an autoencoder neural network. By training the network on the dependencies intrinsic in 'normal' operation data, it effectively overcomes the challenge of unbalanced training data that is inherent in power system attack detection. To evaluate the detection performance of the proposed mechanism, we conduct a series of experiments on the IEEE 118-bus power system. The experiments demonstrate that the proposed autoencoder detector displays robust detection performance under a variety of attack scenarios.Comment: 6 pages, 5 figures, 1 table, conferenc

Orthogonal Laurent polynomials in unit circle, extended CMV ordering and 2D Toda type integrable hierarchies

Orthogonal Laurent polynomials in the unit circle and the theory of Toda-like integrable systems are connected using the Gauss--Borel factorization of a Cantero-Moral-Velazquez moment matrix, which is constructed in terms of a complex quasi-definite measure supported in the unit circle. The factorization of the moment matrix leads to orthogonal Laurent polynomials in the unit circle and the corresponding second kind functions. Jacobi operators, 5-term recursion relations and Christoffel-Darboux kernels, projecting to particular spaces of truncated Laurent polynomials, and corresponding Christoffel-Darboux formulae are obtained within this point of view in a completely algebraic way. Cantero-Moral-Velazquez sequence of Laurent monomials is generalized and recursion relations, Christoffel-Darboux kernels, projecting to general spaces of truncated Laurent polynomials and corresponding Christoffel-Darboux formulae are found in this extended context. Continuous deformations of the moment matrix are introduced and is shown how they induce a time dependant orthogonality problem related to a Toda-type integrable system, which is connected with the well known Toeplitz lattice. Using the classical integrability theory tools the Lax and Zakharov-Shabat equations are obtained. The dynamical system associated with the coefficients of the orthogonal Laurent polynomials is explicitly derived and compared with the classical Toeplitz lattice dynamical system for the Verblunsky coefficients of Szeg\H{o} polynomials for a positive measure. Discrete flows are introduced and related to Darboux transformations. Finally, the representation of the orthogonal Laurent polynomials (and its second kind functions), using the formalism of Miwa shifts, in terms of $\tau$-functions is presented and bilinear equations are derived

Indigenous Emancipation: The Fight Against Marginalisation, Criminalisation, and Oppression

This thematic issue addresses the challenges faced by Indigenous peoples in protecting their rights and maintaining their unique cultures and ways of life. Despite residing on all continents and possessing distinct social, cultural, economic, and political characteristics, Indigenous peoples have historically faced oppression and violation of their rights. Measures to protect Indigenous rights are gradually being recognized by the international community, but ongoing issues such as illegal deforestation, mining, and land clearances continue to desecrate sacred sites and oppress Indigenous peoples. Indigenous women and youth are particularly vulnerable, facing higher levels of gender‐based violence and overrepresentation in judicial sentencing statistics. Land rights continue to be threatened by natural resource extraction, infrastructure projects, large‐scale agricultural expansion, and conservation orders. There is also a heightened risk of statelessness for Indigenous peoples whose traditional lands cross national borders, leading to displacement, attacks, killings, and criminalization

Negative Statements Considered Useful

Knowledge bases (KBs) about notable entities and their properties are an important asset in applications such as search, question answering and dialogue. All popular KBs capture virtually only positive statements, and abstain from taking any stance on statements not stored in the KB. This paper makes the case for explicitly stating salient statements that do not hold. Negative statements are useful to overcome limitations of question answering systems that are mainly geared for positive questions; they can also contribute to informative summaries of entities. Due to the abundance of such invalid statements, any effort to compile them needs to address ranking by saliency. We present a statisticalinference method for compiling and ranking negative statements, based on expectations from positive statements of related entities in peer groups. Experimental results, with a variety of datasets, show that the method can effectively discover notable negative statements, and extrinsic studies underline their usefulness for entity summarization. Datasets and code are released as resources for further research