DocumentCode
2760413
Title
Quantum Informational Geometry for Secret Quantum Communication
Author
Gyongyosi, Laszlo ; Imre, Sandor
Author_Institution
Dept. of Telecommun., Univ. of Technol., Budapest, Hungary
fYear
2009
fDate
15-20 Nov. 2009
Firstpage
580
Lastpage
585
Abstract
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.
Keywords
approximation theory; computational geometry; cryptographic protocols; entropy; mesh generation; quantum computing; quantum cryptography; Bloch sphere; Delaunay triangulation; approximation algorithm; classical computational geometry; quantum channel; quantum cloning; quantum cryptographic protocols; quantum informational geometry; quantum relative entropy; secret quantum communication; Cloning; Computational geometry; Cryptographic protocols; Cryptography; Entropy; Information geometry; Information security; Quantum computing; Quantum mechanics; Telecommunication computing; quantum cloning; quantum cryptography; quantum relative entropy;
fLanguage
English
Publisher
ieee
Conference_Titel
Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2009. COMPUTATIONWORLD '09. Computation World:
Conference_Location
Athens
Print_ISBN
978-1-4244-5166-1
Electronic_ISBN
978-0-7695-3862-4
Type
conf
DOI
10.1109/ComputationWorld.2009.58
Filename
5359656
Link To Document