We introduce a new approach to evaluating entangled quantum networks using information geometry. Quantum computing is powerful because of the enhanced correlations from quantum entanglement. For example, larger entangled networks can enhance quantum key distribution (QKD). Each network we examine is an n-photon quantum state with a degree of entanglement. We analyze such a state within the space of measured data from repeated experiments made by n observers over a set of identically-prepared quantum states – a quantum state interrogation in the space of measurements. Each observer records a 1 if their detector triggers, otherwise they record a 0. This generates a string of 1’s and 0’s at each detector, and each observer can define a binary random variable from this sequence. We use a well-known information geometry-based measure of distance that applies to these binary strings of measurement outcomes,1–3 and we introduce a generalization of this length to area, volume and higher-dimensional volumes.4 These geometric equations are defined using the familiar Shannon expression for joint and mutual entropy.5 We apply our approach to three distinct tripartite quantum states: the |GHZi state, the |Wi state, and a separable state |Pi. We generalize a well-known information geometry analysis of a bipartite state to a tripartite state. This approach provides a novel way to characterize quantum states, and it may have favorable scaling with increased number of photons.
We introduce a new approach to evaluating entangled quantum networks using information geometry. Quantum computing is powerful because of the enhanced correlations from quantum entanglement. For example, larger entangled networks can enhance quantum key distribution (QKD). Each network we examine is an n-photon quantum state with a degree of entanglement. We analyze such a state within the space of measured data from repeated experiments made by n observers over a set of identically-prepared quantum states – a quantum state interrogation in the space of measurements. Each observer records a 1 if their detector triggers, otherwise they record a 0. This generates a string of 1’s and 0’s at each detector, and each observer can define a binary random variable from this sequence. We use a well-known information geometry-based measure of distance that applies to these binary strings of measurement outcomes,1–3 and we introduce a generalization of this length to area, volume and higher-dimensional volumes.4 These geometric equations are defined using the familiar Shannon expression for joint and mutual entropy.5 We apply our approach to three distinct tripartite quantum states: the |GHZi state, the |Wi state, and a separable state |Pi. We generalize a well-known information geometry analysis of a bipartite state to a tripartite state. This approach provides a novel way to characterize quantum states, and it may have favorable scaling with increased number of photons.
We analyze the geometry of a joint distribution over a set of discrete random variables. We briefly review Shannon's entropy, conditional entropy, mutual information and conditional mutual information. We review the entropic information distance formula of Rokhlin and Rajski. We then define an analogous information area. We motivate this definition and discuss its properties. We extend this definition to higher-dimensional volumes. We briefly discuss the potential utility for these geometric measures in quantum information processing.
In this paper, we introduce a novel way of witnessing entanglement in quantum systems. This geometrical approach will enable us to differentiate systems with high quantum correlation from systems with low quantum correlation. We will show using this geometrical approach to quantum entanglement; one can address the entanglement between specific parts of the quantum network without the necessity to calculate all pairwise entanglement between nodes in the network. We will also show that for particular quantum networks, this geometrical approach will be the geometrical realization of squashed entanglement. Our approach is inspired by Schumacher's singlet state triangle inequality, that used an information geometry-based entropic distance, however, unlike Schumacher, who uses classical entropy, we will use von Neumann entropy to reach a new inequality and then will generalize this inequality using entropic areas and volumes and higher dimensional volumes for multipartite quantum systems.
We introduce a novel geometric approach to characterize entanglement relations in large quantum systems. Our approach is inspired by Schumacher's singlet state triangle inequality, which used an entropic-based distance to capture the strange properties of entanglement using geometric-based inequalities. Schumacher uses classical entropy and can only describe the geometry of bipartite states. We extend his approach by using von Neumann entropy to create an entanglement monotone that can be generalized for higher dimensional systems. We achieve this by utilizing recent definitions for entropic areas, volumes, and higher-dimensional volumes for multipartite quantum systems. This enables us to differentiate systems with high quantum correlation from systems with low quantum correlation and differentiate between different types of multi-partite entanglement. It also enables us to describe some of the strange properties of quantum entanglement using simple geometrical inequalities. Our geometrization of entanglement provides new insight into quantum entanglement. Perhaps by constructing well-motivated geometrical structures (e.g. relations among areas, volumes ...), a set of trivial geometrical inequalities can reveal some of the complex properties of higher-dimensional entanglement in multi-partite systems. We provide numerous illustrative applications of this approach, and in particular to a random sample of a thousand density matrices.
The counter-intuitive features of Quantum Mechanics make it possible to solve problems and perform tasks that are beyond the abilities of classical computers and classical communication devices. The area of quantum information processing studies how representing information by quantum states can help achieving such improvements.In this research, we use basic notions of quantum information (mainly entanglement, Bloch sphere, and geometrical distances between quantum states) for analyzing relations of quantum states to each other and quantum cryptographic protocols.Entanglement is an important feature of quantum states. Intuitively (and, partly, inaccurately), entanglement represents quantum (non-classical) correlations between several different quantum systems. Entanglement is one of the most important quantum phenomena, and it has many uses in quantum information, quantum communication, and quantum computing.Some quantum states can be geometrically represented by the Bloch sphere: the unit sphere in the three-dimensional Euclidean space. The "standard" quantum states, to which the laws of Quantum Mechanics directly apply, are called pure states. Other states are the mixed states: probability distributions ("mixtures") of several pure states. The points on the Bloch sphere are the pure states, and those inside the Bloch sphere are the mixed states. This geometrical representation is useful and intuitive for many purposes.We provide a geometrical analysis of entanglement for all the quantum mixed states of rank 2 (all the mixtures of exactly two pure states): for any such state (in any dimension), we define a generalized Bloch sphere by using the two pure states, and we analyze this state and its neighbor states inside this Bloch sphere. We look at the set of non-entangled states ("separable states") in the Bloch sphere and characterize it into exactly five possible classes. We give examples for each class and prove that there are no other classes. In addition, we suggest possible definitions of "entanglement measures" by using the "trace distance" from the nearest separable state.Many types of distances between quantum states can be defined. One of the most useful distances is the trace distance, which bounds the "distinguishability" between the states. The trace distance is very useful in quantum information and quantum cryptography, and it also has a simple geometrical interpretation: it is half of the Euclidean distance between the states in the Bloch sphere.Quantum key distribution (QKD) protocols make it possible for two participators to achieve the classically-impossible task of generating a secret random shared key even if their adversary is computationally unlimited. Several important QKD protocols, including the first protocol of Bennett and Brassard (BB84), have their unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting. We discuss a slightly different protocol, named "BB84-INFO-z", and prove it secure against a broad class of attacks (the collective attacks). Moreover, we make use of the "trace distance" for making our security proof more "composable" than similar security proofs for BB84: namely, for making a step towards proving that the secret key remains secret even when the two participators actually use it for cryptographic purposes.
A hidden-variable model can reproduce context-independent individual readouts while failing to preserve observable records when devices are connected or reused. We distinguish two composition requirements. For a finite family of nonnegative instrument matrices, an invariant space generated by normalization defects characterizes unit continuation mass under every finite adaptive policy. Its annihilator defines the maximal admissible positive cone closed under outcome-conditioned updates. A separate observation space characterizes indistinguishability of context-dependent hidden preparations under joint readout. A finite-state example passes every fixed sequence but fails under outcome-dependent stopping. For a wrapped-Cauchy spin source with an explicitly stipulated unchanged-source passive extension, two individually fair probes acquire a setting-dependent agreement probability with contrast ε2sech(2g)/4. More generally, protection under one and two identical uses forces a continuous binary passive response to be constant; measurable two-valued exceptions remain possible. Exact rational calculations, exhaustive finite-policy experiments, continuous source sampling, and quadrature test the stated examples. The criteria apply to specified instrument families and accessible records; they do not construct a microscopic detector or establish consistency under unrestricted network composition.
Geometry is often a valuable guide to complex problems in physics. In this paper, we introduce a novel geometric quantity called quantum reactivity (QR) to probe quantum correlations in higher-dimensional quantum systems. Much like quantum discord, QR is not a measure of quantum entanglement but can be useful in quantum information processes where a notion of quantum correlation in higher dimensions is needed. Both quantum discord and QR are extendable to an arbitrarily large number of qubits; however, unlike discord, QR satisfies the invariance under unitary operations. Our approach parallels Schumacher's singlet state triangle inequality, which used an information geometry-based entropic distance. We use a generalization of information distance to area, volume, and higher-dimensional volumes and then use these to define a quantity that we call QR, which is the familiar ratio of surface area to volume. We examine a spectrum of multipartite states (Werner, W, GHZ, randomly generated density matrices, etc.) and demonstrate that QR can provide an ordering of these quantum states as to their degree of quantum correlation.