Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physica A Statistical Mechanics and its Applications

Extended space for quantum cryptography using mixed states

Bi Qiao, Harry E. Ruda, Zeng Xianghua, Bambi Hu

Published Feb 17, 2003• 4 citations
Publisher
DOI
10.1016/s0378-4371(02)01539-x

Related papers

Mixed States in Quantum Cryptography.

Ansis Rosmanis, Ilze Dzelme-Bērziņa

FCS•Jan 1, 2006•0 citations

Fidelity analysis of quantum cloning based attacks in quantum cryptography

László Gyöngyösi, Sándor Imre

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.

International Conference on Telecommunications•Jan 1, 2009•5 citations

Quantum entanglement and geometry of determinantal varieties

Hao Chen

Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky, and Rosen. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation, quantum communication, and quantum cryptography. In this paper, we introduce algebraic sets, which are determinantal varieties in the complex projective spaces or the products of complex projective spaces, for the mixed states on bipartite or multipartite quantum systems as their invariants under local unitary transformations. These invariants are naturally arised from the physical consideration of measuring mixed states by separable pure states. Our construction has applications in the following important topics in quantum information theory: (1) separability criterion, it is proved that the algebraic sets must be a union of the linear subspaces if the mixed states are separable; (2) simulation of Hamiltonians, it is proved that the simulation of semipositive Hamiltonians of the same rank implies the projective isomorphisms of the corresponding algebraic sets; (3) construction of bound entangled mixed states, examples of the entangled mixed states which are invariant under partial transpositions (thus PPT bound entanglement) are constructed systematically from our new separability criterion.

arXiv:quant-ph/0110103•Journal of Mathematical Physics•May 1, 2006•14 citations

Quantum cryptography using partially entangled states

Goren Gordon, Gustavo Rigolin

arXiv:0807.2234•Optics Communications•Sep 28, 2009•25 citations

Free-Space Quantum Cryptography

Christian Kurtsiefer, M. Halder, Harald Weinfurter +4 more

Optical science and engineering•Nov 14, 2005•0 citations

Square-root measurement for quantum symmetric mixed state signals

Kentaro Kato, Osamu Hirota

A certain class of mixed states artificially constructed that is used in quantum cryptography is crucial for representation of signals. This correspondence shows that the square-root measurement gives the optimal measurement for such a class of mixed states.

IEEE Transactions on Information Theory•Dec 1, 2003•29 citations
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.
Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky, and Rosen. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation, quantum communication, and quantum cryptography. In this paper, we introduce algebraic sets, which are determinantal varieties in the complex projective spaces or the products of complex projective spaces, for the mixed states on bipartite or multipartite quantum systems as their invariants under local unitary transformations. These invariants are naturally arised from the physical consideration of measuring mixed states by separable pure states. Our construction has applications in the following important topics in quantum information theory: (1) separability criterion, it is proved that the algebraic sets must be a union of the linear subspaces if the mixed states are separable; (2) simulation of Hamiltonians, it is proved that the simulation of semipositive Hamiltonians of the same rank implies the projective isomorphisms of the corresponding algebraic sets; (3) construction of bound entangled mixed states, examples of the entangled mixed states which are invariant under partial transpositions (thus PPT bound entanglement) are constructed systematically from our new separability criterion.