A number of quantum-based protocols exists for distributed parties to share correlated information, including distributed entanglement, and quantum key distribution, where the shared information or bits, are determined probabilistically. Such correlated information or bits can be used for security applications such as encryption, but in this paper, we show how such correlated information or bits, with the use of a priori agreed action-tables, can be used for probabilistic coordination schemes among multiple parties, which we term abstractly as agents (e.g., agents could be processes running on different computers across the Internet, different computer nodes, robots, or vehicles). We identify the properties of such a coordination approach, including fairness and built-in quantum security. We also outline a number of applications of such a coordination approach.
A number of quantum-based protocols exists for distributed parties to share correlated information, including distributed entanglement, and quantum key distribution, where the shared information or bits, are determined probabilistically. Such correlated information or bits can be used for security applications such as encryption, but in this paper, we show how such correlated information or bits, with the use of a priori agreed action-tables, can be used for probabilistic coordination schemes among multiple parties, which we term abstractly as agents (e.g., agents could be processes running on different computers across the Internet, different computer nodes, robots, or vehicles). We identify the properties of such a coordination approach, including fairness and built-in quantum security. We also outline a number of applications of such a coordination approach.
A number of quantum-based protocols exists for distributed parties to share correlated information, including distributed entanglement, and quantum key distribution, where the shared information or bits, are determined probabilistically. Such correlated information or bits can be used for security applications such as encryption, but in this paper, we show how such correlated information or bits, with the use of a priori agreed action-tables, can be used for probabilistic coordination schemes among multiple parties, which we term abstractly as agents (e.g., agents could be processes running on different computers across the Internet, different computer nodes, robots, or vehicles). We identify the properties of such a coordination approach, including fairness and built-in quantum security. We also outline a number of applications of such a coordination approach.
Coordination is a fundamental primitive in communication and information theory, in which distributed systems must collectively generate correlated behavior rather than merely exchange messages. In quantum networks, the nature of entanglement, quantum measurements, and nonclassical correlations introduces coordination possibilities unavailable classically. This article reviews recent advances in coordination over classical and quantum communication networks, focusing on empirical and strong coordination in multi-user settings.
We consider the implications of coordination for nonlocal games, showing how it provides a natural framework for understanding the correlations that enable spatially separated players to improve their probability of winning. We present a unified framework for coordination using classical or quantum communication and pre-shared correlation resources. The review covers simulation of both entanglement and separable correlations across a variety of network architectures, including two-node, cascade, broadcast, and multiple-access networks. We study the operational differences between empirical and strong coordination, and the tradeoffs between communication and correlation resources, such as pre-shared randomness and entanglement.
Coordination plays a major role in device-independent quantum key distribution (DI-QKD) schemes, in which parties can generate a secret key even if the devices used in the process have been prepared by an adversary. Furthermore, we examine the role of coordination in quantum repeaters, where distributed entanglement serves as a resource for long-distance quantum communication. The review highlights connections between coordination theory and applications such as distributed quantum systems, quantum internet architectures, and future communication networks.
A number of quantum-based protocols exists for distributed parties to share correlated information, including distributed entanglement, and quantum key distribution, where the shared information or bits, are determined probabilistically. Such correlated information or bits can be used for security applications such as encryption, but in this paper, we show how such correlated information or bits, with the use of a priori agreed action-tables, can be used for probabilistic coordination schemes among multiple parties, which we term abstractly as agents (e.g., agents could be processes running on different computers across the Internet, different computer nodes, robots, or vehicles). We identify the properties of such a coordination approach, including fairness and built-in quantum security. We also outline a number of applications of such a coordination approach.
This paper presents a novel protocol for distributed key generation (DKG) leveraging quantum entanglement. The core claim is to demonstrate the secure and efficient generation of a shared secret key among multiple parties using the unique properties of entangled quantum states. The protocol utilizes a specifically designed entangled state shared between the participating nodes. This shared state facilitates the synchronous generation of keys across the distributed network. The key innovation lies in the enhanced security provided by the fundamental laws of quantum mechanics, eliminating the vulnerabilities inherent in classical DKG protocols susceptible to eavesdropping attacks. Furthermore, the protocol aims to improve key generation efficiency by utilizing the inherent correlations present within the entangled state. We detail the mathematical formulation of the protocol, including the state preparation, entanglement distribution, and key extraction phases. The proposed approach offers a promising direction for secure communication in quantum networks.
A quantum information-theoretic primitive is introduced for determining a discrete-valued function that depends on multiple parties' local private inputs. The primitive permits the parties to mutually learn each others' local inputs, and thereby determine function values, while their individual systems remain independent of these inputs. The resulting function values are shared among the parties, but may remain information-theoretically hidden from any external observer, as well as from adversarial state-preparation or measurement processes within the quantum system, in every iteration. In particular, while classically producing a shared function with these information-theoretic properties requires the use of private keys or hidden randomness, in the proposed setting it is achieved using quantum resources alone. I outline the primitive's general properties while applications across a broad range of secure quantum communication and computation settings including: quantum key distribution, multi-party coordination and decision schemes, function evaluation, and in some settings, protocols for fairly generated private coins, are relegated to further publications.
Quantum secret sharing (QSS), as a quantum extension of classical secret sharing, uses the basic principles of quantum mechanics to share information safely among multiple parties, providing a new paradigm for information security. As a key foundation for secure multiparty quantum communication and distributed quantum computing, QSS has attracted considerable attention since its emergence. Currently, research in this field includes both classical and quantum scenarios, and continuous progress has been made in both theoretical and experimental aspects. This paper first reviews the current development of QSS for classical information. In this regard, significant and parallel progress has been made in both discrete-variable QSS and continuous-variable QSS. The QSS protocols for sharing classical information, from entangled states to single photons and then to coherent light, have been continuously optimized to better utilize available resources and achieve more efficient implementation under current technological conditions. Meanwhile, round-robin, measurement-device-independent, and other protocols have been steadily improving the security of QSS. Next, one will focus on QSS scheme for quantum secrets, which begins with the symmetry of access structures and introduces basic (k, n) threshold protocols, dynamic schemes that support adaptive agent groups, and symmetric quantum information splitting through entanglement. It further introduces hierarchical quantum secret sharing schemes for asymmetric splitting of quantum information. Considering practical laboratory conditions of quantum states as resources, an overall discussion is conducted on quantum secret sharing with graph states. Afterwards, the design of a continuous-variable scheme for quantum secret sharing is outlined, and entanglement state sharing and quantum teleportation between multiple senders and receivers are introduced. Finally, this review discusses and outlines the future development directions of QSS, thereby inspiring readers to further study and explore the relevant subjects.