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

arXiv:0906.0163 · Physical Review A

Symmetric extendibility for qudits and tolerable error rates in quantum cryptography

Kedar S. Ranade

Published Aug 3, 2009• 9 citations
arXivHTMLPDF

Abstract

Symmetric extendibility of quantum states has recently drawn attention in the context of quantum cryptography to judge whether quantum states shared between two distant parties can be purified by means of one-way error correction protocols. In this paper we study the symmetric extendibility in a specific class of two-qudit states, i.e., states composed of two $d$-level systems, in order to find upper bounds on tolerable error rates for a wide class of qudit-based quantum cryptographic protocols using two-way error correction. In important cases these bounds coincide with previously known lower bounds, thereby proving sharpness of these bounds in arbitrary finite-dimensional systems.

DOI
10.1103/physreva.80.022301

Related papers

Symmetric extendibility for a class of qudit states

Kedar S Ranade

The concept of symmetric extendibility has recently drawn attention in the context of tolerable error rates in quantum cryptography, where it can be used to decide whether quantum states shared between two parties can be purified by means of entanglement purification with one-way classical communication only. Unfortunately, at present there exists no simple general criterion to decide whether a state possesses a symmetric extension or not. In this paper, we derive criteria for symmetric extendibility within subclasses of all two-qudit states. Using these criteria, we can completely solve the problem for a two-parameter family of two-qudit states, which includes the isotropic states as a subclass.

arXiv:0906.5255•Journal of Physics A Mathematical and Theoretical•Sep 30, 2009•9 citations

Asymptotic correctability of Bell-diagonal qudit states and lower bounds on tolerable error probabilities in quantum cryptography

Kedar S Ranade, G. Alber

The concept of asymptotic correctability of Bell-diagonal quantum states is generalized to elementary quantum systems of higher dimensions. Based on these results basic properties of quantum state purification protocols are investigated which are capable of purifying tensor products of Bell-diagonal states and which are based on B -steps of the Gottesman-Lo-type with the subsequent application of a Calderbank–Shor–Steane quantum code. Consequences for maximum tolerable error rates of quantum cryptographic protocols are discussed.

arXiv:quant-ph/0609196•Journal of Physics A Mathematical and Theoretical•Dec 6, 2006•6 citations

Error tolerance of two-basis quantum-key-distribution protocols using qudits and two-way classical communication

Georgios M. Nikolopoulos, Kedar S. Ranade, G. Alber

We investigate the error tolerance of quantum cryptographic protocols using $d$-level systems. In particular, we focus on prepare-and-measure schemes that use two mutually unbiased bases and a key-distillation procedure with two-way classical communication. For arbitrary quantum channels, we obtain a sufficient condition for secret-key distillation which, in the case of isotropic quantum channels, yields an analytic expression for the maximally tolerable error rate of the cryptographic protocols under consideration. The difference between the tolerable error rate and its theoretical upper bound tends slowly to zero for sufficiently large dimensions of the information carriers.

arXiv:quant-ph/0602008•Physical Review A•Mar 17, 2006•59 citations

Exchange-symmetrized qudit Bell bases and Bell-state distinguishability

Oscar Scholin, T. W. Lynn

Entanglement of qudit pairs, with single-particle Hilbert space dimension d , has important potential for quantum information processing, with applications in cryptography, algorithms, and error correction. For a pair of qudits of arbitrary even dimension d , we introduce a generalized Bell basis with definite symmetry under exchange of internal states between the two particles. We show that no complete exchange-symmetrized basis can exist for odd d . This framework extends prior work on exchange-symmetrized hyperentangled qubit bases, where d is a power of 2. For our exchange-symmetrized basis, we show that measurement devices restricted to linear evolution and local measurement (LELM) can unambiguously distinguish 2 d − 1 qudit Bell states for any even d . This achieves the upper bound in general for reliable Bell-state distinguishability via LELM and augments previously known limits for d = 2 n and d = 3 . This result is relevant to near-term realizations of quantum communication protocols.

arXiv:2412.10297•Physical Review Research•Jul 14, 2025•3 citations

Security bound of two-basis quantum-key-distribution protocols using qudits

Georgios M. Nikolopoulos, G. Alber

We investigate the security bounds of quantum-cryptographic protocols using $d$-level systems. In particular, we focus on schemes that use two mutually unbiased bases, thus extending the Bennett-Brassard 1984 quantum-key-distribution scheme to higher dimensions. Under the assumption of general coherent attacks, we derive an analytic expression for the ultimate upper security bound of such quantum-cryptography schemes. This bound is well below the predictions of optimal cloning machines. The possibility of extraction of a secret key beyond entanglement distillation is discussed. In the case of qutrits we argue that any eavesdropping strategy is equivalent to a symmetric one. For higher dimensions such an equivalence is generally no longer valid.

arXiv:quant-ph/0507221•Physical Review A•Sep 16, 2005•55 citations

Emerging Paradigms in Quantum Error Correction and Quantum Cryptography

Prabha Mandayam Doddamane

We study two novel paradigms in quantum error correction and quantum cryptography — approximate quantum error correction and noisy-storage cryptography — which explore alternate approaches for dealing with quantum noise. Approximate quantum error correction seeks to relax the constraint of perfect error correction and construct codes that might be better adapted to correct for specific noise models. Noisy-storage cryptography relies on the power of quantum noise to execute two-party cryptographic tasks securely. Motivated by examples of approximately correcting codes, which make use of fewer physical resources than perfect codes and still obtain comparable levels of fidelity, we study the problem of finding and characterizing such codes in general. We construct for the first time a universal, near-optimal recovery map for approximate quantum error correction (AQEC), with optimality defined in terms of worst-case fidelity. Using the analytical form of this recovery, we also obtain easily verifiable conditions for AQEC. This in turn leads to a simple algorithm for identifying good approximate codes, without having to perform a difficult optimization over all recovery maps for every possible encoding. Noisy-storage cryptography envisions a setting where two-party cryptographic protocols can be securely implemented based solely on the assumption that the quantum storage device possessed by either party is noisy and bounded. Here, we construct two-party protocols (using higher-dimensional states) that are secure even when a dishonest player can store all but a small fraction of the information transmitted during the protocol, in his noiseless quantum memory. We also show that when his memory is noisy, security can be extended to a larger class of noisy quantum memories. Our result demonstrates that the physical limits of the quantum noisy-storage model are indeed achievable, albeit asymptotically. We also describe our investigations on obtaining strong entropic uncertainty relations using symmetric complementary bases. Uncertainty relations are an important and useful resource in analyzing the security of quantum cryptographic protocols, in addition to being of interest from a foundational standpoint. We present a novel construction of sets of symmetric, complementary bases in dimension d = 2n, which are cyclically permuted under the action of a unitary transformation. We also obtain new lower bounds for uncertainty relations in terms of the min-entropy, which are tight for specific instances of our construction.

•Jun 1, 2011•0 citations
Symmetric extendibility of quantum states has recently drawn attention in the context of quantum cryptography to judge whether quantum states shared between two distant parties can be purified by means of one-way error correction protocols. In this paper we study the symmetric extendibility in a specific class of two-qudit states, i.e., states composed of two ddd-level systems, in order to find upper bounds on tolerable error rates for a wide class of qudit-based quantum cryptographic protocols using two-way error correction. In important cases these bounds coincide with previously known lower bounds, thereby proving sharpness of these bounds in arbitrary finite-dimensional systems.
The concept of symmetric extendibility has recently drawn attention in the context of tolerable error rates in quantum cryptography, where it can be used to decide whether quantum states shared between two parties can be purified by means of entanglement purification with one-way classical communication only. Unfortunately, at present there exists no simple general criterion to decide whether a state possesses a symmetric extension or not. In this paper, we derive criteria for symmetric extendibility within subclasses of all two-qudit states. Using these criteria, we can completely solve the problem for a two-parameter family of two-qudit states, which includes the isotropic states as a subclass.
The concept of asymptotic correctability of Bell-diagonal quantum states is generalized to elementary quantum systems of higher dimensions. Based on these results basic properties of quantum state purification protocols are investigated which are capable of purifying tensor products of Bell-diagonal states and which are based on B -steps of the Gottesman-Lo-type with the subsequent application of a Calderbank–Shor–Steane quantum code. Consequences for maximum tolerable error rates of quantum cryptographic protocols are discussed.
We investigate the error tolerance of quantum cryptographic protocols using ddd-level systems. In particular, we focus on prepare-and-measure schemes that use two mutually unbiased bases and a key-distillation procedure with two-way classical communication. For arbitrary quantum channels, we obtain a sufficient condition for secret-key distillation which, in the case of isotropic quantum channels, yields an analytic expression for the maximally tolerable error rate of the cryptographic protocols under consideration. The difference between the tolerable error rate and its theoretical upper bound tends slowly to zero for sufficiently large dimensions of the information carriers.
Entanglement of qudit pairs, with single-particle Hilbert space dimension d , has important potential for quantum information processing, with applications in cryptography, algorithms, and error correction. For a pair of qudits of arbitrary even dimension d , we introduce a generalized Bell basis with definite symmetry under exchange of internal states between the two particles. We show that no complete exchange-symmetrized basis can exist for odd d . This framework extends prior work on exchange-symmetrized hyperentangled qubit bases, where d is a power of 2. For our exchange-symmetrized basis, we show that measurement devices restricted to linear evolution and local measurement (LELM) can unambiguously distinguish 2 d − 1 qudit Bell states for any even d . This achieves the upper bound in general for reliable Bell-state distinguishability via LELM and augments previously known limits for d = 2 n and d = 3 . This result is relevant to near-term realizations of quantum communication protocols.
We investigate the security bounds of quantum-cryptographic protocols using ddd-level systems. In particular, we focus on schemes that use two mutually unbiased bases, thus extending the Bennett-Brassard 1984 quantum-key-distribution scheme to higher dimensions. Under the assumption of general coherent attacks, we derive an analytic expression for the ultimate upper security bound of such quantum-cryptography schemes. This bound is well below the predictions of optimal cloning machines. The possibility of extraction of a secret key beyond entanglement distillation is discussed. In the case of qutrits we argue that any eavesdropping strategy is equivalent to a symmetric one. For higher dimensions such an equivalence is generally no longer valid.
We study two novel paradigms in quantum error correction and quantum cryptography — approximate quantum error correction and noisy-storage cryptography — which explore alternate approaches for dealing with quantum noise. Approximate quantum error correction seeks to relax the constraint of perfect error correction and construct codes that might be better adapted to correct for specific noise models. Noisy-storage cryptography relies on the power of quantum noise to execute two-party cryptographic tasks securely. Motivated by examples of approximately correcting codes, which make use of fewer physical resources than perfect codes and still obtain comparable levels of fidelity, we study the problem of finding and characterizing such codes in general. We construct for the first time a universal, near-optimal recovery map for approximate quantum error correction (AQEC), with optimality defined in terms of worst-case fidelity. Using the analytical form of this recovery, we also obtain easily verifiable conditions for AQEC. This in turn leads to a simple algorithm for identifying good approximate codes, without having to perform a difficult optimization over all recovery maps for every possible encoding. Noisy-storage cryptography envisions a setting where two-party cryptographic protocols can be securely implemented based solely on the assumption that the quantum storage device possessed by either party is noisy and bounded. Here, we construct two-party protocols (using higher-dimensional states) that are secure even when a dishonest player can store all but a small fraction of the information transmitted during the protocol, in his noiseless quantum memory. We also show that when his memory is noisy, security can be extended to a larger class of noisy quantum memories. Our result demonstrates that the physical limits of the quantum noisy-storage model are indeed achievable, albeit asymptotically. We also describe our investigations on obtaining strong entropic uncertainty relations using symmetric complementary bases. Uncertainty relations are an important and useful resource in analyzing the security of quantum cryptographic protocols, in addition to being of interest from a foundational standpoint. We present a novel construction of sets of symmetric, complementary bases in dimension d = 2n, which are cyclically permuted under the action of a unitary transformation. We also obtain new lower bounds for uncertainty relations in terms of the min-entropy, which are tight for specific instances of our construction.