Optical state engineering, quantum communication, and robustness of entanglement promiscuity in three-mode Gaussian states

We present a novel, detailed study on the usefulness of three-mode Gaussian states states for realistic processing of continuous-variable quantum information, with a particular emphasis on the possibilities opened up by their genuine tripartite entanglement. We describe practical schemes to engineer several classes of pure and mixed three-mode states that stand out for their informational and/or entanglement properties. In particular, we introduce a simple procedure -- based on passive optical elements -- to produce pure three-mode Gaussian states with {\em arbitrary} entanglement structure (upon availability of an initial two-mode squeezed state). We analyze in depth the properties of distributed entanglement and the origin of its sharing structure, showing that the promiscuity of entanglement sharing is a feature peculiar to symmetric Gaussian states that survives even in the presence of significant degrees of mixedness and decoherence. Next, we discuss the suitability of the considered tripartite entangled states to the implementation of quantum information and communication protocols with continuous variables. This will lead to a feasible experimental proposal to test the promiscuous sharing of continuous-variable tripartite entanglement, in terms of the optimal fidelity of teleportation networks with Gaussian resources. We finally focus on the application of three-mode states to symmetric and asymmetric telecloning, and single out the structural properties of the optimal Gaussian resources for the latter protocol in different settings. Our analysis aims to lay the basis for a practical quantum communication with continuous variables beyond the bipartite scenario.Comment: 33 pages, 10 figures (some low-res due to size constraints), IOP style; (v2) improved and reorganized, accepted for publication in New Journal of Physic

Quantum annealing for the number partitioning problem using a tunable spin glass of ions

Exploiting quantum properties to outperform classical ways of information-processing is an outstanding goal of modern physics. A promising route is quantum simulation, which aims at implementing relevant and computationally hard problems in controllable quantum systems. Here we demonstrate that in a trapped ion setup, with present day technology, it is possible to realize a spin model of the Mattis type that exhibits spin glass phases. Remarkably, our method produces the glassy behavior without the need for any disorder potential, just by controlling the detuning of the spin-phonon coupling. Applying a transverse field, the system can be used to benchmark quantum annealing strategies which aim at reaching the ground state of the spin glass starting from the paramagnetic phase. In the vicinity of a phonon resonance, the problem maps onto number partitioning, and instances which are difficult to address classically can be implemented.Comment: accepted version (11 pages, 7 figures

Distributed graph-based state space generation

LTSMIN provides a framework in which state space generation can be distributed easily over many cores on a single compute node, as well as over multiple compute nodes. The tool works on the basis of a vector representation of the states; the individual cores are assigned the task of computing all successors of states that are sent to them. In this paper we show how this framework can be applied in the case where states are essentially graphs interpreted up to isomorphism, such as the ones we have been studying for GROOVE. This involves developing a suitable vector representation for a canonical form of those graphs. The canonical forms are computed using a third tool called BLISS. We combined the three tools to form a system for distributed state space generation based on graph grammars. We show that the time performance of the resulting system scales well (i.e., close to linear) with the number of cores. We also report surprising statistics on the memory\ud consumption, which imply that the vector representation used to store graphs in LTSMIN is more compact than the representation used in GROOVE