Abstract The study of quantum information processing seeks to characterize the resources that enable quantum information processing to perform tasks that are unfeasible or inefficient for classical information processing. Quantum cryptography is one such task, and researchers have identified entanglement as a sufficient resource for secure key generation. However, quantum discord, another type of quantum correlation beyond entanglement, has been found to be necessary for guaranteeing secure communication. Despite this, it remains a long-standing problem to clearly understand the role that discord plays and how to effectively utilize discord for analyzing security in specific quantum cryptography protocols. Here, we strictly prove that discord determines the secrecy and show its practical interest by considering a three-state quantum key distribution protocol. Its robustness against imperfections in qubit sources and measurements as well as basis misalignment, results in better key rates than BB84 protocol. Those advantages are experimentally demonstrated via photonic phase encoding systems.
Abstract The study of quantum information processing seeks to characterize the resources that enable quantum information processing to perform tasks that are unfeasible or inefficient for classical information processing. Quantum cryptography is one such task, and researchers have identified entanglement as a sufficient resource for secure key generation. However, quantum discord, another type of quantum correlation beyond entanglement, has been found to be necessary for guaranteeing secure communication. Despite this, it remains a long-standing problem to clearly understand the role that discord plays and how to effectively utilize discord for analyzing security in specific quantum cryptography protocols. Here, we strictly prove that discord determines the secrecy and show its practical interest by considering a three-state quantum key distribution protocol. Its robustness against imperfections in qubit sources and measurements as well as basis misalignment, results in better key rates than BB84 protocol. Those advantages are experimentally demonstrated via photonic phase encoding systems.
Abstract Quantum key distribution (QKD) facilitates secure communication by harnessing non-classical correlations within quantum systems. Although entanglement is fundamental to many QKD protocols, it is highly susceptible to noise and decoherence effects. In this work, we analyze the performance of Werner and Bell-diagonal states within commonly used QKD protocols such as BB84, Six-state, and their device-independent variants, considering realistic noise environments and eavesdropping strategies. Employing a Qiskit-based simulation toolkit , we assess critical performance metrics including quantum bit error rate (QBER), fidelity, concurrence, quantum discord, violations of the CHSH inequality, and Devetak, Winter key rates. Our findings emphasize the resilience of quantum discord as a resource in scenarios where entanglement is diminished, and reveal that Bell-diagonal states may exhibit superior performance compared to Werner states under certain noise conditions. We further discuss practical consequences for secure key generation and propose directions for extending this work toward physical device implementation and machine learning–enhanced detection of eavesdropping attempts. These results shed light on the robustness of QKD protocols that utilize mixed quantum states and the significant role quantum discord can play in secure quantum communication.
Quantum discord represents a correlation beyond classicality that could be useful for many quantum information tasks, and therefore is viewed as a valuable quantum resource. Theoretically, whether a bipartite quantum state has a non-zero amount of quantum discord or not can be determined once its density matrix is given. Experimentally, however, it is not easy to perform a reliable tomography on the state, especially when considering the imperfection of devices and the high dimensionality of system. Here, inspired by the so-called dimension witness, we propose a new approach using uncharacterized measurements to witness quantum discord of an unknown bipartite state within arbitrary dimension system. Furthermore, 2×2 measurements are sufficient for any bipartite state of arbitrarily large dimension. For any two-qubit state, we show that the maximum of witness happens when one performs mutually orthogonal basis measurement on each qubit. Our method exhibits high robustness against device imperfections, such as error tolerance, indicating its experimental feasibility.
Quantum communication is a rapidly evolving field that leverages quantum physics to enable secure and efficient information exchange. A cornerstone of quantum cryptography is Quantum Key Distribution (QKD), a secure key exchange mechanism that ensures the confidentiality of transmitted data by employing the no-cloning theorem and the uncertainty principle of quantum mechanics. This study explores key aspects of quantum networks and communication, including quantum states, QKD, and quantum cryptographic protocols, with a focus on photon polarization states and entangled qubits as fundamental building blocks of quantum information. Additionally, two well-established quantum cryptographic protocols, BB84 and E91, are analyzed for their principles and advantages in secure communication. However, challenges such as quantum state loss in communication channels hinder the long-distance transmission of quantum information. To address these issues, error detection, measurement, and correction techniques are investigated, with quantum error correction methods playing a crucial role in mitigating noise and imperfections, ensuring accurate quantum information transmission, and enhancing the overall efficiency of quantum communication systems. Beyond conventional networks, quantum communication holds vast potential for cybersecurity applications, paving the way for next-generation secure communication frameworks.
Quantum entanglement is the most popular kind of quantum correlations. Its role in several tasks in quantum information theory like quantum cryptography, quantum dense coding and quantum teleportation is indisputable. The role of entanglement in quantum algorithms has also attracted enormous amount of attention in the literature. The research in this direction is motivated by the finding that a quantum computer can efficiently factorize arbitrary integer numbers. Since no classical algorithm is known today that can solve this problem efficiently, this example clearly demonstrates the superiority of a quantum computer compared to its classical counterpart. In this context, entanglement also plays a crucial role: if the quantum computer operates on a pure state without entanglement, then the computational process can be simulated efficiently on a classical computer. In this case entanglement is the key ingredient that makes the difference between a quantum and a classical computer.
However, the situation is more involved if the computational process is not perfect. In this case the quantum computer operates on a mixed state, and the role of entanglement is less obvious. A seminal result in this direction is a quantum algorithm known under the acronym DQC1. This algorithm operates on an almost maximally mixed state with vanishingly little entanglement. However, DQC1 can still perform tasks efficiently for which no efficient classical algorithm is known today. Thus, it is reasonable to assume that entanglement in general is not related to the efficiency of a quantum algorithm.
Triggered by this observation other kinds of quantum correlations have been studied. In this context a particular measure of quantum correlations known as quantum discord is referred to frequently in the literature. Quantum discord is a measure of quantum correlations beyond entanglement, i.e., a quantum state can have no entanglement, but nonvanishing quantum discord. Quantum discord is also regarded as the key resource in the DQC1 algorithm. Although this statement is still controversial, it was shown under very general assumptions that quantum discord is required if a quantum computer is to show an exponential speedup over any classical algorithm.
In this thesis we give a short introduction into the theory of entanglement and general quantum correlations, and further discuss our results. In particular, we show that two different kinds of entanglement measures can coincide. This result is used to build an algorithm for computing entanglement. We also consider the role of quantum correlations for the distribution of entanglement and for the quantum measurement process. We further discuss the behavior of quantum correlations under local noise, and their monogamy properties.
Quantum cryptography promises secure communication protocols that surpass the limitations of classical cryptography. By leveraging the principles of quantum mechanics, particularly the phenomenon of quantum entanglement and the uncertainty principle, quantum cryptography protocols offer provable security guarantees against eavesdropping attacks. In this paper, we provide an overview of quantum cryptography, discussing its theoretical foundations, key protocols such as quantum key distribution (QKD), and experimental implementations. We highlight the advantages of quantum cryptography over classical cryptographic techniques and explore its potential applications in secure communication networks, financial transactions, and data privacy. Furthermore, we discuss ongoing research efforts and challenges in the practical deployment of quantum cryptography systems, including the development of robust quantum hardware and the integration of quantum cryptographic protocols into existing communication infrastructures. Overall, quantum cryptography holds great promise for enabling secure communication channels that are resilient to quantum attacks, paving the way for a new era of ultra-secure information exchange.
The Bennett-Brassard 1984 (BB84) protocol is the most widely implemented quantum key distribution (QKD) scheme. However, despite enormous theoretical and experimental efforts in the past decades, the security of this protocol with imperfect sources has not yet been rigorously established. In this paper, we address this shortcoming and prove the security of the BB84 protocol in the presence of multiple source imperfections, including state preparation flaws and side channels, such as Trojan-horse attacks, mode dependencies and classical correlations between the emitted pulses. To do so, we consider a modified BB84 protocol that exploits the basis mismatched events, which are often discarded in standard security analyses of this scheme; and employ the reference technique, a powerful mathematical tool to accommodate source imperfections in the security analysis of QKD. Moreover, we compare the achievable secret-key rate of the modified BB84 protocol with that of the three-state loss-tolerant protocol, and show that the addition of a fourth state, while redundant in ideal conditions, significantly improves the estimation of the leaked information in the presence of source imperfections, resulting in a better performance. This paper demonstrates the relevance of the BB84 protocol in guaranteeing implementation security, taking us a step further towards closing the existing gap between theory and practice of QKD.