A quantitative witness for Greenberger-Horne-Zeilinger entanglement

Along with the vast progress in experimental quantum technologies there is an increasing demand for the quantification of entanglement between three or more quantum systems. Theory still does not provide adequate tools for this purpose. The objective is, besides the quest for exact results, to develop operational methods that allow for efficient entanglement quantification. Here we put forward an analytical approach that serves both these goals. We provide a simple procedure to quantify Greenberger-Horne-Zeilinger-type multipartite entanglement in arbitrary three-qubit states. For two qubits this method is equivalent to Wootters' seminal result for the concurrence. It establishes a close link between entanglement quantification and entanglement detection by witnesses, and can be generalised both to higher dimensions and to more than three parties.

Efficient learning of decomposable models with a bounded clique size

The learning of probability distributions from data is a ubiquitous problem in the fields of Statistics and Artificial Intelligence. During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models due to their advantageous theoretical properties. Some of these algorithms can be used to search for a maximum likelihood decomposable model with a given maximum clique size, k, which controls the complexity of the model. Unfortunately, the problem of learning a maximum likelihood decomposable model given a maximum clique size is NP-hard for k > 2. In this work, we propose a family of algorithms which approximates this problem with a computational complexity of O(k · n^2 log n) in the worst case, where n is the number of implied random variables. The structures of the decomposable models that solve the maximum likelihood problem are called maximal k-order decomposable graphs. Our proposals, called fractal trees, construct a sequence of maximal i-order decomposable graphs, for i = 2, ..., k, in k − 1 steps. At each step, the algorithms follow a divide-and-conquer strategy based on the particular features of this type of structures. Additionally, we propose a prune-and-graft procedure which transforms a maximal k-order decomposable graph into another one, increasing its likelihood. We have implemented two particular fractal tree algorithms called parallel fractal tree and sequential fractal tree. These algorithms can be considered a natural extension of Chow and Liu’s algorithm, from k = 2 to arbitrary values of k. Both algorithms have been compared against other efficient approaches in artificial and real domains, and they have shown a competitive behavior to deal with the maximum likelihood problem. Due to their low computational complexity they are especially recommended to deal with high dimensional domains.

The Forbidden Quantum Adder

Quantum information provides fundamentally different computational resources than classical information. We prove that there is no unitary protocol able to add unknown quantum states belonging to different Hilbert spaces. This is an inherent restriction of quantum physics that is related to the impossibility of copying an arbitrary quantum state, i.e., the no-cloning theorem. Moreover, we demonstrate that a quantum adder, in absence of an ancillary system, is also forbidden for a known orthonormal basis. This allows us to propose an approximate quantum adder that could be implemented in the lab. Finally, we discuss the distinct character of the forbidden quantum adder for quantum states and the allowed quantum adder for density matrices.

Diseño de la lógica programable de un sistema de monitorización de estructuras.

[ES]El objeto de este trabajo es desarrollar la lógica programable de una FPGA para un sistema de monitorización de estructuras. El diseño se compone de un generador de señales arbitrarias y un sistema de adquisición. El sistema de monitorización está dirigido al campo aeronáutico, pero se puede emplear en otras áreas.

El confinamiento de los prisioneros de guerra y rehenes en la Roma republicana

Dossier monográfico: Puesta en escena y escenarios en la diplomacia del mundo romano

Parity-dependent State Engineering and Tomography in the ultrastrong coupling regime

Reaching the strong coupling regime of light-matter interaction has led to an impressive development in fundamental quantum physics and applications to quantum information processing. Latests advances in different quantum technologies, like superconducting circuits or semiconductor quantum wells, show that the ultrastrong coupling regime (USC) can also be achieved, where novel physical phenomena and potential computational benefits have been predicted. Nevertheless, the lack of effective decoupling mechanism in this regime has so far hindered control and measurement processes. Here, we propose a method based on parity symmetry conservation that allows for the generation and reconstruction of arbitrary states in the ultrastrong coupling regime of light-matter interactions. Our protocol requires minimal external resources by making use of the coupling between the USC system and an ancillary two-level quantum system.