The problem of quantum cloning is closely connected to quantum cryptography. In quantum cryptography, an eavesdropper on the quantum channel can not copy perfectly the sent quantum states, however in many cases the cloning machine is known to be the most powerful eavesdropping strategy against quantum cryptographic protocols. The geometric interpretation of quantum states investigates distances between two different quantum states. In our method we use quantum relative entropy as an informational distance between quantum states. We show a geometrical approach to analyze the security of quantum cryptography, based on quantum relative entropy and Delaunay triangulation on the Bloch sphere. In our security analysis, we use an approximation algorithm from classical computational geometry to determine the smallest enclosing ball of balls using core-sets.
The problem of quantum cloning is closely connected to quantum cryptography. In quantum cryptography, an eavesdropper on the quantum channel can not copy perfectly the sent quantum states, however in many cases the cloning machine is known to be the most powerful eavesdropping strategy against quantum cryptographic protocols. The geometric interpretation of quantum states investigates distances between two different quantum states. In our method we use quantum relative entropy as an informational distance between quantum states. We show a geometrical approach to analyze the security of quantum cryptography, based on quantum relative entropy and Delaunay triangulation on the Bloch sphere. In our security analysis, we use an approximation algorithm from classical computational geometry to determine the smallest enclosing ball of balls using core-sets.
Abstract:- In secret quantum communications the best eavesdropping attacks on quantum cryptography are based on imperfect cloning machines. The incoherent attack, based on quantum cloning, is the most common eavesdropping strategy. Using a probe, the eavesdropper imperfectly clones the sender’s quantum state which keeps one copy and sends the other. The physically allowed transformations of Eve’s quantum cloner on Bob’s qubit can be described in terms of Completely Positive (CP), trace preserving maps. The map of the quantum cloner compresses the Bloch-ball, as an affine map. This affine map has to be a complete positive, trace preserving map, which shrinks the Bloch ball. The effects of a quantum cloner can be given in tetrahedron representation. In this paper we show a new, quantum information theoretical representation of eavesdropping detection, focused on the Four-state (BB84) and Six-state quantum cryptography protocols. We use a fundamentally new computational geometrical method to analyze the informational theoretical impacts of cloning activity on the quantum channel. The proposed algorithm uses Delaunay tessellation and convex hull calculation on the Bloch sphere, with respect to quantum relative entropy as distance measure. The improved core-set approach can be used to analyze efficiently the informational theoretical impacts of physically allowed quantum cloning attacks.
Abstract:- The safety of quantum cryptography relies on the no-cloning theorem. In secret quantum communications, an eavesdropper cannot clone the sent qubits perfectly, however the best eavesdropping attacks for quantum cryptography are based on imperfect cloning machines. The eavesdropper’s physically allowed quantum evolutions on the sent qubit can be described in terms of the quantum state’s geometry. We use a fundamentally new computational geometrical method to analyze the informational theoretical impacts of cloning activity on the quantum channel. Our method uses Delaunay tessellation and convex hull calculation, with respect to quantum relative entropy as distance measure. The security analysis is focused on the four state (BB84) and Six state quantum cryptography protocols. The proposed geometrical method can be used to analyze efficiently the informational theoretical impacts of physically allowed quantum cloning transformations.
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.
In quantum cryptography the encoded pure quantum states are sent through a quantum communication channel. An eavesdropper can not measure the sent qubit, since the result of the measurement is one of the single quantum system's eigenstates. The best eavesdropping attacks for quantum cryptography use the cloning machines. In this paper, we show an effective method to compute the fidelity of quantum cloning based attacks in quantum cryptography, using Delaunay tessellation. We extend our method to study the fidelity of optimal cloning of mixed states in quantum cryptography.
Abstract Computational Geometry is the art of designing efficientalgorithms for answering geometric questions. Computa-tional Geometry involves efficient and elegant solutionsfor difficult algorithmic problems and plays a central rolein many different areas of computer science. Quantumcloning-based attacks have deep relevance to quantumcryptography. In this paper we use the results of clas-sical Computational Geometry to analyze the security ofa quantum channel using current classical computer ar-chitectures. To analyze a quantum channel for a largenumber of input quantum states with classical computerarchitectures, very fast and effective algorithms are re-quired.Keywords: Quantum communication, quantum cryptogra-phy, quantum informational distance 1 Introduction In today’s communication networks, the widespread useof optical fiber and passive optical elements allows to usequantum cryptography in the current standard opticalnetwork infrastructure. In the past few years, quantumkey distribution schemes have attracted much study. Thesecurity of modern cryptographic methods, like asymmet-ric cryptography, relies heavily on the problem of factor-ing large integers [7]. In the future, if quantum computersbecome reality, any information exchange using currentclassical cryptographic schemes will be immediately inse-cure [11, 13]. Current classical cryptographic methods arenot able to guarantee long-term security. Other crypto-graphic methods, with absolute security must be appliedin the future. Cryptography based on the principles ofquantum theory is known as quantum cryptography. Us-ing current network technology, in order to spread quan-tum cryptography, interfaces must be implemented thatare able to manage together the quantum and classicalchannels [10].Many challenging hard algorithmic problems can bestudied with computational geometry and, at present,there exist many geometric algorithms that offer an effi-cient and well implementable solution for hard computa-tional problems. Computational Geometry was originallyfocused on the construction of efficient algorithms and itprovides a very valuable and efficient tool for computinghard tasks [8]. In many cases, the traditional linear pro-gramming methods are not very efficient. The computa-tion of the convex hull between quantum states cannot becomputed efficiently by linear programming, however themethods of computational geometry are better at solvingthese kinds of hard problems [18, 3, 8]. ComputationalGeometry uses the results of classical geometry and thepower of computing. In Figure 1, we illustrate the logicalstructure of the analysis and the cooperation of classi-cal and quantum systems. To this day, the most efficientclassical algorithms for this purpose are computationalgeometric methods. We use these classical computationalgeometrictoolsto analyzethe securityofa quantum chan-nel.
In quantum information theory, a geometric approach, known as "quantum information geometry," has been considered as a powerful method. In this thesis, we give a computational geometric interpretation to the geometric structure of a quantum system. Especially we introduce the concept of the Voronoi diagram and the smallest enclosing ball problem to the space of quantum states. With those tools in computational geometry, we analyze the adjacency structure of a point set in the quantum state space. Additionally, as an application, we show an effective method to compute the capacity of a quantum channel.