An NMR Analog of the Quantum Disentanglement Eraser

We report the implementation of a three-spin quantum disentanglement eraser on a liquid-state NMR quantum information processor. A key feature of this experiment was its use of pulsed magnetic field gradients to mimic projective measurements. This ability is an important step towards the development of an experimentally controllable system which can simulate any quantum dynamics, both coherent and decoherent.Comment: Four pages, one figure (RevTeX 2.1), to appear in Physics Review Letter

Center clusters in the Yang-Mills vacuum

Properties of local Polyakov loops for SU(2) and SU(3) lattice gauge theory at finite temperature are analyzed. We show that spatial clusters can be identified where the local Polyakov loops have values close to the same center element. For a suitable definition of these clusters the deconfinement transition can be characterized by the onset of percolation in one of the center sectors. The analysis is repeated for different resolution scales of the lattice and we argue that the center clusters have a continuum limit.Comment: Table added. Final version to appear in JHE

Implementation of the Quantum Fourier Transform

The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of the QFT is presented with fidelity measures, and state tomography. Experimentally realizing the QFT is a clear demonstration of NMR's ability to control quantum systems.Comment: 6 pages, 2 figure

Study of Giant Pairing Vibrations with neutron-rich nuclei

We investigate the possible signature of the presence of giant pairing states at excitation energy of about 10 MeV via two-particle transfer reactions induced by neutron-rich weakly-bound projectiles. Performing particle-particle RPA calculations on $^{208}$Pb and BCS+RPA calculations on $^{116}$Sn, we obtain the pairing strength distribution for two particles addition and removal modes. Estimates of two-particle transfer cross sections can be obtained in the framework of the 'macroscopic model'. The weak-binding nature of the projectile kinematically favours transitions to high-lying states. In the case of (~^6He, \~^4He) reaction we predict a population of the Giant Pairing Vibration with cross sections of the order of a millibarn, dominating over the mismatched transition to the ground state.Comment: Talk presented in occasion of the VII School-Semina r on Heavy Ion Physics hosted by the Flerov Laboratory (FLNR/JINR) Dubna, Russia from May 27 to June 2, 200

Distributed Graph Clustering using Modularity and Map Equation

We study large-scale, distributed graph clustering. Given an undirected graph, our objective is to partition the nodes into disjoint sets called clusters. A cluster should contain many internal edges while being sparsely connected to other clusters. In the context of a social network, a cluster could be a group of friends. Modularity and map equation are established formalizations of this internally-dense-externally-sparse principle. We present two versions of a simple distributed algorithm to optimize both measures. They are based on Thrill, a distributed big data processing framework that implements an extended MapReduce model. The algorithms for the two measures, DSLM-Mod and DSLM-Map, differ only slightly. Adapting them for similar quality measures is straight-forward. We conduct an extensive experimental study on real-world graphs and on synthetic benchmark graphs with up to 68 billion edges. Our algorithms are fast while detecting clusterings similar to those detected by other sequential, parallel and distributed clustering algorithms. Compared to the distributed GossipMap algorithm, DSLM-Map needs less memory, is up to an order of magnitude faster and achieves better quality.Comment: 14 pages, 3 figures; v3: Camera ready for Euro-Par 2018, more details, more results; v2: extended experiments to include comparison with competing algorithms, shortened for submission to Euro-Par 201