The geometric measure of entanglement for a symmetric pure state with positive amplitudes

In this paper for a class of symmetric multiparty pure states we consider a conjecture related to the geometric measure of entanglement: 'for a symmetric pure state, the closest product state in terms of the fidelity can be chosen as a symmetric product state'. We show that this conjecture is true for symmetric pure states whose amplitudes are all non-negative in a computational basis. The more general conjecture is still open.Comment: Similar results have been obtained independently and with different methods by T-C. Wei and S. Severini, see arXiv:0905.0012v

The chain rule implies Tsirelson's bound: an approach from generalized mutual information

In order to analyze an information theoretical derivation of Tsirelson's bound based on information causality, we introduce a generalized mutual information (GMI), defined as the optimal coding rate of a channel with classical inputs and general probabilistic outputs. In the case where the outputs are quantum, the GMI coincides with the quantum mutual information. In general, the GMI does not necessarily satisfy the chain rule. We prove that Tsirelson's bound can be derived by imposing the chain rule on the GMI. We formulate a principle, which we call the no-supersignalling condition, which states that the assistance of nonlocal correlations does not increase the capability of classical communication. We prove that this condition is equivalent to the no-signalling condition. As a result, we show that Tsirelson's bound is implied by the nonpositivity of the quantitative difference between information causality and no-supersignalling.Comment: 23 pages, 8 figures, Added Section 2 and Appendix B, result unchanged, Added reference

Summary of the Sussex-Huawei Locomotion-Transportation Recognition Challenge

In this paper we summarize the contributions of participants to the Sussex-Huawei Transportation-Locomotion (SHL) Recognition Challenge organized at the HASCA Workshop of UbiComp 2018. The SHL challenge is a machine learning and data science competition, which aims to recognize eight transportation activities (Still, Walk, Run, Bike, Bus, Car, Train, Subway) from the inertial and pressure sensor data of a smartphone. We introduce the dataset used in the challenge and the protocol for the competition. We present a meta-analysis of the contributions from 19 submissions, their approaches, the software tools used, computational cost and the achieved results. Overall, two entries achieved F1 scores above 90%, eight with F1 scores between 80% and 90%, and nine between 50% and 80%

Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication

We show that entanglement guarantees difficulty in the discrimination of orthogonal multipartite states locally. The number of pure states that can be discriminated by local operations and classical communication is bounded by the total dimension over the average entanglement. A similar, general condition is also shown for pure and mixed states. These results offer a rare operational interpretation for three abstractly defined distance like measures of multipartite entanglement.Comment: 4 pages, 1 figure. Title changed in accordance with jounral request. Major changes to the paper. Intro rewritten to make motivation clear, and proofs rewritten to be clearer. Picture added for clarit

Direct evaluation of pure graph state entanglement

We address the question of quantifying entanglement in pure graph states. Evaluation of multipartite entanglement measures is extremely hard for most pure quantum states. In this paper we demonstrate how solving one problem in graph theory, namely the identification of maximum independent set, allows us to evaluate three multipartite entanglement measures for pure graph states. We construct the minimal linear decomposition into product states for a large group of pure graph states, allowing us to evaluate the Schmidt measure. Furthermore we show that computation of distance-like measures such as relative entropy of entanglement and geometric measure becomes tractable for these states by explicit construction of closest separable and closest product states respectively. We show how these separable states can be described using stabiliser formalism as well as PEPs-like construction. Finally we discuss the way in which introducing noise to the system can optimally destroy entanglement.Comment: 23 pages, 9 figure

Survival of entanglement in thermal states

We present a general sufficiency condition for the presence of multipartite entanglement in thermal states stemming from the ground state entanglement. The condition is written in terms of the ground state entanglement and the partition function and it gives transition temperatures below which entanglement is guaranteed to survive. It is flexible and can be easily adapted to consider entanglement for different splittings, as well as be weakened to allow easier calculations by approximations. Examples where the condition is calculated are given. These examples allow us to characterize a minimum gapping behavior for the survival of entanglement in the thermodynamic limit. Further, the same technique can be used to find noise thresholds in the generation of useful resource states for one-way quantum computing.Comment: 6 pages, 2 figures. Changes made in line with publication recommendations. Motivation and concequences of result clarified, with the addition of one more example, which applies the result to give noise thresholds for measurement based quantum computing. New author added with new result

Anisotropic Hubbard model on a triangular lattice -- spin dynamics in Ho Mn O_3

The recent neutron-scattering data for spin-wave dispersion in $\rm Ho Mn O_3$ are well described by an anisotropic Hubbard model on a triangular lattice with a planar (XY) spin anisotropy. Best fit indicates that magnetic excitations in $\rm Ho Mn O_3$ correspond to the strong-coupling limit $U/t > \sim 15$, with planar exchange energy $J=4t^2/U \simeq 2.5$meV and planar anisotropy $\Delta U \simeq 0.35$meV.Comment: 4 pages, 3 figure

Learning more with less: Conditional PGGAN-based data augmentation for brain metastases detection using highly-rough annotation on MR images

Accurate Computer-Assisted Diagnosis, associated with proper data wrangling, can alleviate the risk of overlooking the diagnosis in a clinical environment. Towards this, as a Data Augmentation (DA) technique, Generative Adversarial Networks (GANs) can synthesize additional training data to handle the small/fragmented medical imaging datasets collected from various scanners; those images are realistic but completely different from the original ones, filling the data lack in the real image distribution. However, we cannot easily use them to locate disease areas, considering expert physicians' expensive annotation cost. Therefore, this paper proposes Conditional Progressive Growing of GANs (CPGGANs), incorporating highly-rough bounding box conditions incrementally into PGGANs to place brain metastases at desired positions/sizes on 256 X 256 Magnetic Resonance (MR) images, for Convolutional Neural Network-based tumor detection; this first GAN-based medical DA using automatic bounding box annotation improves the training robustness. The results show that CPGGAN-based DA can boost 10% sensitivity in diagnosis with clinically acceptable additional False Positives. Surprisingly, further tumor realism, achieved with additional normal brain MR images for CPGGAN training, does not contribute to detection performance, while even three physicians cannot accurately distinguish them from the real ones in Visual Turing Test.Comment: 9 pages, 7 figures, accepted to CIKM 2019 (acceptance rate: 19%

Quantum cobwebs: Universal entangling of quantum states

Entangling an unknown qubit with one type of reference state is generally impossible. However, entangling an unknown qubit with two types of reference states is possible. To achieve this, we introduce a new class of states called zero sum amplitude (ZSA) multipartite, pure entangled states for qubits and study their salient features. Using shared-ZSA state, local operation and classical communication we give a protocol for creating multipartite entangled states of an unknown quantum state with two types of reference states at remote places. This provides a way of encoding an unknown pure qubit state into a multiqubit entangled state. We quantify the amount of classical and quantum resources required to create universal entangled states. This is possibly a strongest form of quantum bit hiding with multiparties.Comment: Invited talk in II Winter Institute on FQTQO: Quantum Information Processing, held at S. N. Bose Center for Basic Science, Kolkata, during Jan 2-11, 2002. (To appear in Pramana-J. of Physics, 2002.