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

Quantum Electronics

Analysis of limiting information characteristics of quantum-cryptography protocols

Сыч Денис Васильевич, B. A. Grishanin, Виктор Николаевич Задков

Published Jan 31, 2005• 21 citations
Publisher

Abstract

The problem of increasing the critical error rate of quantum-cryptography protocols by varying a set of letters in a quantum alphabet for space of a fixed dimensionality is studied. Quantum alphabets forming regular polyhedra on the Bloch sphere and the continual alphabet equally including all the quantum states are considered. It is shown that, in the absence of basis reconciliation, a protocol with the tetrahedral alphabet has the highest critical error rate among the protocols considered, while after the basis reconciliation, a protocol with the continual alphabet possesses the highest critical error rate.

DOI
10.1070/qe2005v035n01abeh002886

Related papers

Comparative characteristics of quantum key distribution protocols with alphabets corresponding to the regular polyhedrons on the Bloch sphere

Сыч Денис Васильевич, B. A. Grishanin, Victor N. Zadkov

Possibilities of improving characteristics of quantum key distribution (QKD) protocols via variation of character set in quantum alphabets are investigated. QKD protocols with discrete alphabets letters of which form regular polyhedrons on the Bloch sphere (tetrahedron octahedron cube icosahedron and dodecahedron which have 4, 6, 8, 12, and 20 vertexes) and QKD protocol with continuous alphabet which corresponds to the limiting case of a polyhedron with infinitive number of vertexes are considered. Stability of such QKD protocols to the interceptresend and optimal eavesdropping strategies at the individual attacks is studied in detail. It is shown that in case of optimal eavesdropping strategy after safety bases reconciliation critical error rate of the QKD protocol with continuous alphabet surpasses all other protocols. Without basis reconciliation the highest critical error rate have the protocol with tetrahedron-type alphabet.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jun 1, 2005•1 citation

Optimal alphabets for noise-resistant quantum cryptography

Сыч Денис Васильевич, B. A. Grishanin, Victor N. Zadkov

Possibilities of improving critical error rate of quantum key distribution (QKD) protocols for different strategies of eavesdropping are investigated. QKD-protocols with discrete alphabets letters of which form regular polyhedrons on the Bloch sphere (tetrahedron octahedron cube icosahedron and dodecahedron which have 4, 6, 8, 12 and 20 vertexes respectively) and QKD-protocol with continuous alphabet which corresponds to the limiting case of a polyhedron with infinitive number of vortexes are considered. Stability of such QKD-protocols to the noise in a quantum channel which is due to the Eve's interference that apply either intercept-receipt or optimal eavesdropping strategy at the individual attacks is studied in detail. It is shown that in case of optimal eavesdropping strategy after bases reconciliation the QKD-protocol with continuous alphabet surpasses all other protocols in terms of noise-resistance. Without basis reconciliation the highest critical error rate have the protocol with tetrahedron-type alphabet.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jun 1, 2005•0 citations

Critical error rate of quantum-key-distribution protocols versus the size and dimensionality of the quantum alphabet

Сыч Денис Васильевич, B. A. Grishanin, Victor N. Zadkov

A quantum-information analysis of how the size and dimensionality of the quantum alphabet affect the critical error rate of the quantum-key-distribution (QKD) protocols is given on an example of two QKD protocols---the six-state and \ensuremath{\infty}-state (i.e., a protocol with continuous alphabet) ones. In the case of a two-dimensional Hilbert space, it is shown that, under certain assumptions, increasing the number of letters in the quantum alphabet up to infinity slightly increases the critical error rate. Increasing additionally the dimensionality of the Hilbert space leads to a further increase in the critical error rate.

Physical Review A•Nov 30, 2004•28 citations

Quantum cryptography with continuous alphabet

Сыч Денис Васильевич, B. A. Grishanin, Victor N. Zadkov

A new quantum cryptography protocol, based on all unselected states of a qubit as a sort of alphabet with continuous set of letters, is proposed. Its effectiveness is calculated and shown to be essentially higher than those of the other known protocols.

arXiv:quant-ph/0304035•Apr 4, 2003•1 citation

Noise-resistant quantum key distribution protocol

B. A. Grishanin, Сыч Денис Васильевич, Victor N. Zadkov

We present the scheme of compatible quantum information analysis of the quantum key distribution (QKD) protocols, which give answers to the following questions: is it possible to improve the quantum bit error rate (QBER) of the 6-state protocol by employing more states, up to infinity, and can we essentially improve the QBER if the multidimensional Hilbert space with dimensionality more than 3 is used? Also, a novel quantum key distribution (QKD) protocol, based on all unselected states of a quantum system, which set the alphabet with continuous set of letters, is proposed. Employing all states of the Hilbert space leads to the maximal quantum uncertainty of transmitted states and therefore an eavesdropper receives the minimal amount of information. For the case of two-dimensional Hilbert space, our protocol allows secure transmission at the error rate higher than that one for the BB84-protocol and comparable with the characteristics of the best known QKD-protocols. However, with increasing the dimensionality of the Hilbert space the critical error rate for our protocol increases and in the limit of infinite-dimensional space the protocol becomes non-threshold.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 28, 2004•0 citations

Quantum Key Distribution with a Continuous Alphabet

Сыч Денис Васильевич, B. A. Grishanin, Victor N. Zadkov

A novel quantum key distribution protocol (QKD) based on all unselected states of a quantum sys- tem that set the alphabet with a continuous set of letters is proposed. Employing all states of the Hilbert space leads to a maximum quantum uncertainty of transmitted states, and, therefore, an eavesdropper receives the minimum amount of information. For the case of a two-dimensional Hilbert space, our protocol allows secure transmission at an error rate better than that for the BB84-protocol and is comparable with the characteristics of the best known QKD protocols. However, with increasing the dimensionality of the Hilbert space, the critical error rate for our protocol increases and, in the limit of infinite-dimensional space, the protocol becomes non- threshold.

Laser Physics•Jan 1, 2004•7 citations
The problem of increasing the critical error rate of quantum-cryptography protocols by varying a set of letters in a quantum alphabet for space of a fixed dimensionality is studied. Quantum alphabets forming regular polyhedra on the Bloch sphere and the continual alphabet equally including all the quantum states are considered. It is shown that, in the absence of basis reconciliation, a protocol with the tetrahedral alphabet has the highest critical error rate among the protocols considered, while after the basis reconciliation, a protocol with the continual alphabet possesses the highest critical error rate.
Possibilities of improving characteristics of quantum key distribution (QKD) protocols via variation of character set in quantum alphabets are investigated. QKD protocols with discrete alphabets letters of which form regular polyhedrons on the Bloch sphere (tetrahedron octahedron cube icosahedron and dodecahedron which have 4, 6, 8, 12, and 20 vertexes) and QKD protocol with continuous alphabet which corresponds to the limiting case of a polyhedron with infinitive number of vertexes are considered. Stability of such QKD protocols to the interceptresend and optimal eavesdropping strategies at the individual attacks is studied in detail. It is shown that in case of optimal eavesdropping strategy after safety bases reconciliation critical error rate of the QKD protocol with continuous alphabet surpasses all other protocols. Without basis reconciliation the highest critical error rate have the protocol with tetrahedron-type alphabet.
Possibilities of improving critical error rate of quantum key distribution (QKD) protocols for different strategies of eavesdropping are investigated. QKD-protocols with discrete alphabets letters of which form regular polyhedrons on the Bloch sphere (tetrahedron octahedron cube icosahedron and dodecahedron which have 4, 6, 8, 12 and 20 vertexes respectively) and QKD-protocol with continuous alphabet which corresponds to the limiting case of a polyhedron with infinitive number of vortexes are considered. Stability of such QKD-protocols to the noise in a quantum channel which is due to the Eve's interference that apply either intercept-receipt or optimal eavesdropping strategy at the individual attacks is studied in detail. It is shown that in case of optimal eavesdropping strategy after bases reconciliation the QKD-protocol with continuous alphabet surpasses all other protocols in terms of noise-resistance. Without basis reconciliation the highest critical error rate have the protocol with tetrahedron-type alphabet.
A quantum-information analysis of how the size and dimensionality of the quantum alphabet affect the critical error rate of the quantum-key-distribution (QKD) protocols is given on an example of two QKD protocols---the six-state and \ensuremath{\infty}-state (i.e., a protocol with continuous alphabet) ones. In the case of a two-dimensional Hilbert space, it is shown that, under certain assumptions, increasing the number of letters in the quantum alphabet up to infinity slightly increases the critical error rate. Increasing additionally the dimensionality of the Hilbert space leads to a further increase in the critical error rate.
We present the scheme of compatible quantum information analysis of the quantum key distribution (QKD) protocols, which give answers to the following questions: is it possible to improve the quantum bit error rate (QBER) of the 6-state protocol by employing more states, up to infinity, and can we essentially improve the QBER if the multidimensional Hilbert space with dimensionality more than 3 is used? Also, a novel quantum key distribution (QKD) protocol, based on all unselected states of a quantum system, which set the alphabet with continuous set of letters, is proposed. Employing all states of the Hilbert space leads to the maximal quantum uncertainty of transmitted states and therefore an eavesdropper receives the minimal amount of information. For the case of two-dimensional Hilbert space, our protocol allows secure transmission at the error rate higher than that one for the BB84-protocol and comparable with the characteristics of the best known QKD-protocols. However, with increasing the dimensionality of the Hilbert space the critical error rate for our protocol increases and in the limit of infinite-dimensional space the protocol becomes non-threshold.
A novel quantum key distribution protocol (QKD) based on all unselected states of a quantum sys- tem that set the alphabet with a continuous set of letters is proposed. Employing all states of the Hilbert space leads to a maximum quantum uncertainty of transmitted states, and, therefore, an eavesdropper receives the minimum amount of information. For the case of a two-dimensional Hilbert space, our protocol allows secure transmission at an error rate better than that for the BB84-protocol and is comparable with the characteristics of the best known QKD protocols. However, with increasing the dimensionality of the Hilbert space, the critical error rate for our protocol increases and, in the limit of infinite-dimensional space, the protocol becomes non- threshold.