A survey on quantum channel capacities
Quantum information processing exploits the quantum nature of information. It offers
fundamentally new solutions in the field of computer science and extends the possibilities to …
fundamentally new solutions in the field of computer science and extends the possibilities to …
An elementary introduction to information geometry
F Nielsen - Entropy, 2020 - mdpi.com
In this survey, we describe the fundamental differential-geometric structures of information
manifolds, state the fundamental theorem of information geometry, and illustrate some use …
manifolds, state the fundamental theorem of information geometry, and illustrate some use …
[LIBRO][B] Advanced quantum communications: an engineering approach
S Imre, L Gyongyosi - 2012 - books.google.com
The book provides an overview of the most advanced quantum informational geometric
techniques, which can help quantum communication theorists analyze quantum channels …
techniques, which can help quantum communication theorists analyze quantum channels …
Sided and symmetrized Bregman centroids
In this paper, we generalize the notions of centroids (and barycenters) to the broad class of
information-theoretic distortion measures called Bregman divergences. Bregman …
information-theoretic distortion measures called Bregman divergences. Bregman …
Simpler core vector machines with enclosing balls
The core vector machine (CVM) is a recent approach for scaling up kernel methods based
on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient …
on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient …
Graph characterizations from von Neumann entropy
In this paper we explore how the von Neumann entropy can be used as a measure of graph
complexity. We also develop a simplified form for the von Neumann entropy of a graph that …
complexity. We also develop a simplified form for the von Neumann entropy of a graph that …
A simple approximation method for the Fisher–Rao distance between multivariate normal distributions
F Nielsen - Entropy, 2023 - mdpi.com
We present a simple method to approximate the Fisher–Rao distance between multivariate
normal distributions based on discretizing curves joining normal distributions and …
normal distributions based on discretizing curves joining normal distributions and …
[LIBRO][B] Information theory in computer vision and pattern recognition
Information theory has proved to be effective for solving many computer vision and pattern
recognition (CVPR) problems (such as image matching, clustering and segmentation …
recognition (CVPR) problems (such as image matching, clustering and segmentation …
LAP: Lightweight anonymity and privacy
Popular anonymous communication systems often require sending packets through a
sequence of relays on dilated paths for strong anonymity protection. As a result, increased …
sequence of relays on dilated paths for strong anonymity protection. As a result, increased …
Bregman Voronoi diagrams: Properties, algorithms and applications
The Voronoi diagram of a finite set of objects is a fundamental geometric structure that
subdivides the embedding space into regions, each region consisting of the points that are …
subdivides the embedding space into regions, each region consisting of the points that are …