Remarks on entanglement entropy for gauge fields

In gauge theories the presence of constraints can obstruct expressing the global Hilbert space as a tensor product of the Hilbert spaces corresponding to degrees of freedom localized in complementary regions. In algebraic terms, this is due to the presence of a center --- a set of operators which commute with all others --- in the gauge invariant operator algebra corresponding to finite region. A unique entropy can be assigned to algebras with center, giving place to a local entropy in lattice gauge theories. However, ambiguities arise on the correspondence between algebras and regions. In particular, it is always possible to choose (in many different ways) local algebras with trivial center, and hence a genuine entanglement entropy, for any region. These choices are in correspondence with maximal trees of links on the boundary, which can be interpreted as partial gauge fixings. This interpretation entails a gauge fixing dependence of the entanglement entropy. In the continuum limit however, ambiguities in the entropy are given by terms local on the boundary of the region, in such a way relative entropy and mutual information are finite, universal, and gauge independent quantities.Comment: 26 pages, 7 figure

A Novel Fuzzy c -Means Clustering Algorithm Using Adaptive Norm

Abstract(#br)The fuzzy c -means (FCM) clustering algorithm is an unsupervised learning method that has been widely applied to cluster unlabeled data automatically instead of artificially, but is sensitive to noisy observations due to its inappropriate treatment of noise in the data. In this paper, a novel method considering noise intelligently based on the existing FCM approach, called adaptive-FCM and its extended version (adaptive-REFCM) in combination with relative entropy, are proposed. Adaptive-FCM, relying on an inventive integration of the adaptive norm, benefits from a robust overall structure. Adaptive-REFCM further integrates the properties of the relative entropy and normalized distance to preserve the global details of the dataset. Several experiments are carried out,..

An Interval-based Multiobjective Approach to Feature Subset Selection Using Joint Modeling of Objectives and Variables

This paper studies feature subset selection in classification using a multiobjective estimation of distribution algorithm. We consider six functions, namely area under ROC curve, sensitivity, specificity, precision, F1 measure and Brier score, for evaluation of feature subsets and as the objectives of the problem. One of the characteristics of these objective functions is the existence of noise in their values that should be appropriately handled during optimization. Our proposed algorithm consists of two major techniques which are specially designed for the feature subset selection problem. The first one is a solution ranking method based on interval values to handle the noise in the objectives of this problem. The second one is a model estimation method for learning a joint probabilistic model of objectives and variables which is used to generate new solutions and advance through the search space. To simplify model estimation, l1 regularized regression is used to select a subset of problem variables before model learning. The proposed algorithm is compared with a well-known ranking method for interval-valued objectives and a standard multiobjective genetic algorithm. Particularly, the effects of the two new techniques are experimentally investigated. The experimental results show that the proposed algorithm is able to obtain comparable or better performance on the tested datasets

Applications of Artificial Intelligence to Cryptography

This paper considers some recent advances in the field of Cryptography using Artificial Intelligence (AI). It specifically considers the applications of Machine Learning (ML) and Evolutionary Computing (EC) to analyze and encrypt data. A short overview is given on Artificial Neural Networks (ANNs) and the principles of Deep Learning using Deep ANNs. In this context, the paper considers: (i) the implementation of EC and ANNs for generating unique and unclonable ciphers; (ii) ML strategies for detecting the genuine randomness (or otherwise) of finite binary strings for applications in Cryptanalysis. The aim of the paper is to provide an overview on how AI can be applied for encrypting data and undertaking cryptanalysis of such data and other data types in order to assess the cryptographic strength of an encryption algorithm, e.g. to detect patterns of intercepted data streams that are signatures of encrypted data. This includes some of the authors’ prior contributions to the field which is referenced throughout. Applications are presented which include the authentication of high-value documents such as bank notes with a smartphone. This involves using the antenna of a smartphone to read (in the near field) a flexible radio frequency tag that couples to an integrated circuit with a non-programmable coprocessor. The coprocessor retains ultra-strong encrypted information generated using EC that can be decrypted on-line, thereby validating the authenticity of the document through the Internet of Things with a smartphone. The application of optical authentication methods using a smartphone and optical ciphers is also briefly explored

Resource theories of knowledge

How far can we take the resource theoretic approach to explore physics? Resource theories like LOCC, reference frames and quantum thermodynamics have proven a powerful tool to study how agents who are subject to certain constraints can act on physical systems. This approach has advanced our understanding of fundamental physical principles, such as the second law of thermodynamics, and provided operational measures to quantify resources such as entanglement or information content. In this work, we significantly extend the approach and range of applicability of resource theories. Firstly we generalize the notion of resource theories to include any description or knowledge that agents may have of a physical state, beyond the density operator formalism. We show how to relate theories that differ in the language used to describe resources, like micro and macroscopic thermodynamics. Finally, we take a top-down approach to locality, in which a subsystem structure is derived from a global theory rather than assumed. The extended framework introduced here enables us to formalize new tasks in the language of resource theories, ranging from tomography, cryptography, thermodynamics and foundational questions, both within and beyond quantum theory.Comment: 28 pages featuring figures, examples, map and neatly boxed theorems, plus appendi