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.
Quantum key distribution (QKD) protocols most often use two conjugate bases in order to verify the security of the quantum channel. In the majority of protocols, these bases are mutually unbiased to one another, which is to say they are formed from balanced superpositions of the entire set of states in the opposing basis. Here, we introduce a high-dimensional QKD protocol using qubit-like states, referred to as Fourier-qubits (or F-qubits). In our scheme, each F-qubit is a superposition of only two computational basis states with a relative phase that can take d distinct values, where d is the dimension of the computational basis. This non-mutually-unbiased approach allows us to bound the information leaked to an eavesdropper, maintaining security in high-dimensional quantum systems despite the states’ seemingly two-dimensional nature. By simplifying state preparation and measurement, our protocol offers a practical alternative for secure high-dimensional quantum communications. We experimentally demonstrate this protocol for a noisy high-dimensional QKD channel using the orbital angular momentum degree of freedom of light and discuss the potential benefits for encoding in other degrees of freedom. High dimensional quantum key distribution (QKD) systems will allow for higher key generation rate, but with added complexity for creating and detecting high dimensional quantum states. The authors demonstrate a QKD protocol using “qubit-like” qudit states, “F-qubits”, with simpler generation and detection, maintaining the benefits of high dimensional QKD protocols.
Recently, Chau [Phys. Rev. A 92, 062324 (2015)] introduced an experimentally feasible qudit-based quantum-key-distribution (QKD) scheme. In that scheme, one bit of information is phase encoded in the prepared state in a
2n-dimensional Hilbert space in the form $(|i\ensuremath{\rangle}\ifmmode\pm\else\textpm\fi{}|j\ensuremath{\rangle})/\sqrt{2}$ with $n\ensuremath{\ge}2$. For each qudit prepared and measured in the same two-dimensional Hilbert subspace, one bit of raw secret key is obtained in the absence of transmission error. Here we show that by modifying the basis announcement procedure, the same experimental setup can generate
n bits of raw key for each qudit prepared and measured in the same basis in the noiseless situation. The reason is that in addition to the phase information, each qudit also carries information on the Hilbert subspace used. The additional $(n\ensuremath{-}1)$ bits of raw key comes from a clever utilization of this extra piece of information. We prove the unconditional security of this modified protocol and compare its performance with other existing provably secure qubit- and qudit-based protocols on market in the one-way classical communication setting. Interestingly, we find that for the case of
n=2, the secret key rate of this modified protocol using nondegenerate random quantum code to perform one-way entanglement distillation is equal to that of the six-state scheme.