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.
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.
Representations of quantum operations – We start by introducing a geometrical representation (real vector space) of quantum states and quantum operations. To do so we exploit an isomorphism from positive matrices to a subcone of the Minkowski future light-cone. Pure states map onto certain light-like vectors, whilst the axis of revolution encodes the overall probability of occurrence for the state. This extension of the Generalized Bloch Sphere enables us to cater for non-trace-preserving quantum operations, and in particular to view the per-outcome effects of generalized measurements. We show that these consist of the product of an orthogonal transform about the axis of the cone of revolution and a positive real symmetric linear transform. In the case of a qubit the representation becomes all the more interesting since it elegantly associates, to each measurement element of a generalized measurement, a Lorentz transformation in Minkowski space. We formalize explicitly this correspondence between ‘observation of a quantum system’ and ‘special relativistic change of inertial frame’. To end this part we review the state-operator correspondence, which was successfully exploited by Choi to derive the operator-sum representation of quantum operations. We go further and show that all of the important theorems concerning quantum operations can in fact be derived as simple corollaries of those concerning quantum states. Using this methodology we derive novel composition laws upon quantum states and quantum operations, Schmidt-type decompositions for bipartite pure states and some powerful formulae relating to the correspondence. Quantum cryptography – The key principle of quantum cryptography could be summarized as follows. Honest parties communicate using quantum states. To the eavesdropper these states are random and non-orthogonal. In order to gather information she must measure them, but this may cause irreversible damage. Honest parties seek to detect her mischief by checking whether certain quantum states are left intact. Thus tradeoff between the eavesdropper’s information gain, and the disturbance she necessarily induces, can be viewed as the power engine behind quantum cryptographic protocols. We begin by quantifying this tradeoff in the case of a measure distinguishing two non-orthogonal equiprobable pure states. A formula for this tradeoff was first obtained by Fuchs and Peres, but we provide a shorter, geometrical derivation (within the framework of the above mentioned conal representation). Next we proceed to analyze the Information gain versus disturbance tradeoff in a scenario where Alice and Bob interleave, at random, pairwise superpositions of two message words within their otherwise classical communications. This work constitutes one of the few results currently available regarding d-level systems quantum cryptography, and seems to provide a good general primitive for building such protocols. The proof crucially relies on the state-operator correspondence formulae derived in the first part, together with some methods by Banaszek. Finally we make use of this analysis to prove the security of a ‘blind quantum computation’ protocol, whereby Alice gets Bob to perform some quantum algorithm for her, but prevents him from learning her input to this quantum algorithm.
This paper presents an introduction to geometric representations of quantum states in which each distinct quantum state, pure and mixed, corresponds to a unique point in a Euclidean space. Beginning with a review of some underappreciated properties of the most commonly used geometric representation, the Bloch sphere visualization of qubit states, we show how concepts, algorithms, and spatial relations viewable on this geometric representation can be extended to representations of qudit states of any finite quantum dimension d and on to the infinite-dimensional limit. A primary goal of the work is helping the reader develop a visual intuition of these spaces, which can complement the understanding of the algebraic formalism of quantum mechanics for learners, teachers, and researchers at any level. Particular emphasis is given both to understanding states in a basis-independent way and to understanding how probability amplitudes and density matrix elements used to algebraically represent states in a particular basis correspond to line segments and angles in the geometric representations. In addition to providing visualizations for such concepts as superpositions, mixtures, decoherence, and measurement, we demonstrate how the representations can be used to substitute simple geometrical calculations for more cumbersome linear algebra ones, which may be of particular use in introducing mixed states and density matrices to beginning quantum students at an early stage. The work concludes with the geometrical interpretation of some commonly used metrics such as the purity of states and their relation to real, Euclidean vectors in the infinite-dimensional limit of the space, which contains all lower-dimensional qudit spaces as subspaces.
The Bloch Sphere visualization of the possible states of a single qubit serves as a useful pedagogical and conceptual tool, offering a one-to-one map between qubit states and points in a 3D space. However, understanding many important concepts of quantum mechanics, such as entanglement, requires developing intuitions about states with a minimum of two qubits, which map one-to-one to unvisualizable spaces of six dimensions and higher. In this paper, we circumvent this visualization issue by creating maps of subspaces of 1- and 2-qubit systems that quantitatively and qualitatively encode properties of these states in their geometries. For the 1-qubit case, the subspace approach allows one to visualize how mixed states relate to different choices of measurement in a basis-independent way and how to read off the entries in a density matrix representation of these states from lengths in a simple diagram. For the 2-qubit case, a toroidal map of 2-qubit states illuminates the non-trivial topology of the state space while allowing one to simultaneously read off, in distances and angles, the level of entanglement in the 2-qubit state and the mixed-state properties of its constituent qubits. By encoding states and their evolutions through quantum logic gates with little to no need of mathematical formalism, these maps may prove particularly useful for understanding fundamental concepts of quantum mechanics and quantum information at the introductory level.
This paper explores the potential of non-Euclidean geometry to provide a novel framework for understanding and modeling quantum information. Traditional approaches often treat quantum information as a purely mathematical construct, limiting its applicability to purely computational contexts. We propose a radical shift, formalizing quantum information as a geometric object within a non-Euclidean space, leveraging the properties of geometry to reveal deeper connections to the physical world. The core mechanism centers around extending the concept of quantum information beyond classical representations, allowing for the visualization and manipulation of entanglement and other quantum phenomena through a geometric lens. This paper will detail the conceptual groundwork, mathematical framework, and potential implications of this approach, emphasizing its capacity to bridge the gap between abstract mathematics and the complexities of quantum mechanics. Chapter 1: Foundations – Geometry and Information The fundamental concept underpinning this research lies in the recognition that geometry, particularly non-Euclidean geometry, possesses inherent properties that resonate with the nature of quantum information. Classical geometry, with its inherent Euclidean assumptions, struggles to adequately capture the counterintuitive aspects of quantum mechanics. The inherent non-Euclidean nature of space, where distances are not absolute but relative, mirrors the fundamental fuzziness and probabilistic nature of quantum states. Furthermore, the distribution of information, a cornerstone of quantum mechanics, can be visualized as a complex geometric pattern, and non-Euclidean geometry offers a powerful tool to analyze and manipulate this pattern. The challenge, therefore, is to move beyond a purely mathematical abstraction to a geometric understanding of information itself. Early attempts to model quantum information often relied on representations like Hilbert spaces, which, while powerful, represent information as a vector space. However, this representation lacks the inherent geometric richness that is crucial for understanding entanglement and other quantum phenomena. We propose a shift towards representing quantum information as points within a non-Euclidean space, where the distance and orientation of these points encode the quantum state. This shift is predicated on the observation that geometric properties, such as curvature and connectivity, are intimately linked to quantum entanglement and the preservation of information. The core idea is to formulate a geometric model where entanglement is represented not as a correlation between particles but as a distortion of the geometric space itself, influenced by the quantum state. This distortion, driven by the inherent properties of the non-Euclidean space, provides a richer and potentially more intuitive understanding of quantum phenomena. The choice of non-Euclidean geometry is not arbitrary; it is intended to be a 'natural' choice, reflecting the underlying structure of quantum information. Chapter 2: Non-Euclidean Geometry – A Conceptual Framework We introduce a specific type of non-Euclidean geometry, termed "Hyperbolic Geometry for Quantum Information," that incorporates several key features. Unlike Euclidean geometry, Hyperbolic Geometry allows for the representation of multiple, potentially conflicting, states simultaneously. This is achieved through the concept of "Hyperbolic Density," which quantifies the probability of finding a quantum state within a given region of the space. The density of a Hyperbolic Density is influenced by the quantum state, creating a dynamic and evolving geometric representation. The mathematical framework of Hyperbolic Geometry is built around the concept of "Geometric Curvature." This curvature is not simply a measure of distance but rather a representation of the quantum state's inherent orientation. Specifically, we define a curvature function that is sensitive to the quantum state. This curvature is not constant; it adapts to the quantum state, creating a continuously evolving geometric representation. This adaptation is crucial for capturing the inherent randomness and non-determinism of quantum mechanics. Furthermore, we introduce the concept of "Geometric Connectivity," which describes the relationships between points within the Hyperbolic Geometry. These connections are not simply spatial relationships but are defined by the quantum state's inherent properties. The strength and type of connectivity represent the degree to which the quantum state is entangled with the geometric structure. This connectivity is dynamically modified by the curvature function, creating a complex and interconnected geometric pattern. The core mathematical tool for manipulating these geometries is the "Geometric Transformation." This transformation allows us to 'morph' geometric forms into new forms, representing the evolution of quantum information. The transformation is based on a specific set of rules which are intrinsically linked to the nature of entanglement. These rules are carefully designed to preserve the fundamental properties of quantum information.
We geometrically examine the entanglement in symmetric multiquibt states using the spin coherent states properties. We employ the Majorana representation to examine how coherent (polarized) and unpolarized states can be represented in the Bloch sphere and subsequently to quantify entanglement in multipartite systems. Entanglement can be viewed as a distance separate two points in Bloch sphere and how this notion can be extended for multipartite states in W class. This provides us with an entanglement measure for [Formula: see text]-states analogue to the notion of Concurrence.
The counter-intuitive features of quantum mechanics make it possible to solve problems and perform tasks that are beyond the abilities of non-quantum (classical) computers and communication devices. The field of quantum information processing studies how we can achieve such improvements by representing information as quantum states.One of the early achievements of quantum information processing is the development of quantum key distribution (QKD). QKD protocols allow two participants (Alice and Bob) to achieve the classically-impossible task of generating a secret shared key even if their adversary is computationally unlimited.Unfortunately, the security promises of QKD are true only in theory; practical implementations of QKD deviate from the theoretical protocols, and many of these deviations give rise to practical attacks. In this research thesis, we study the security properties of various QKD protocols in many practical settings:First, we study practical security of semiquantum key distribution (SQKD) protocols, where either Alice or Bob is non-quantum (classical). Following practical security problems in previous SQKD protocols, we suggest a new SQKD protocol (the "Mirror protocol") which can be securely implemented, and we prove it robust and secure against a wide range of attacks (the "uniform collective attacks").Then, we study "composable security" of the first QKD protocol created by Bennett and Brassard (BB84). BB84 has its unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting; however, some security approaches do not prove "composable security", which requires the secret key to remain secret even when Alice and Bob actually use it for cryptographic purposes. We generalize an algebraic security approach for BB84, making it prove composable security of BB84 (and many variants of BB84) against the most general attacks.Finally, we analyze an important practical attack (named "Bright Illumination"), showing how it can be modeled as a theoretical "Reversed-Space" attack.Overall, all results aim to enhance our understanding on how to bridge the gap between theory and practice in various sub-fields of QKD, and they may help solve a major open problem in the field of QKD: constructing a realistic QKD implementation that can be proved truly and unconditionally secure against any possible attack.