We investigate the exploitation of various combinatorial properties of graphs and set systems to study several issues in quantum information theory. We characterize the combinatorics of distributed EPR pairs for preparing multi-partite entanglement in a real communication network. This combinatorics helps in the study of various problems in multi-party case by just reducing to the two-party case. Particularly, we use this combinatorics to (1) study various possible and impossible transformations of multi-partite states under LOCC, thus presenting an entirely new approach, not based on entropic criterion, to study such state transformations. (2) present a protocol and proof of its unconditional security for quantum key distribution amongst several trusted parties. (3) propose an idea to combine the features of quantum key distribution and quantum secret sharing. We investigate all the above issues in great detail and finally conclude briefly with some open research directions based on our research.
We investigate the exploitation of various combinatorial properties of graphs and set systems to study several issues in quantum information theory. We characterize the combinatorics of distributed EPR pairs for preparing multi-partite entanglement in a real communication network. This combinatorics helps in the study of various problems in multi-party case by just reducing to the two-party case. Particularly, we use this combinatorics to (1) study various possible and impossible transformations of multi-partite states under LOCC, thus presenting an entirely new approach, not based on entropic criterion, to study such state transformations. (2) present a protocol and proof of its unconditional security for quantum key distribution amongst several trusted parties. (3) propose an idea to combine the features of quantum key distribution and quantum secret sharing. We investigate all the above issues in great detail and finally conclude briefly with some open research directions based on our research.
We develop protocols for preparing a GHZ state and, in general,a pure multi-partite maximally entangled state in a distributed network with apriori quantum entanglement between agents using classical communication and local operations. We investigate and characterize the minimal combinatorics of the sharing of EPR pairs required amongst agents in a network for the creation of multi-partite entanglement. We also characterize the minimal combinatorics of agents in the creation of pure maximal multi-partite entanglement amongst the set N of n agents in a network using apriori multi-partite entanglement states amongst subsets of N. We propose protocols for establishing multi-partite entanglement in the above cases.
Computations in a distributed environment comprising a network of spatially separated nodes may require the exchange of classical and quantum information. The amount of classical communication may be reduced in such computations by using multipartite entanglement. Following the combinatorial approach developed in [25, 27], we study entanglement configurations over a set of nodes, where each entanglement configuration is a collection of multipartite entanglement (CAT or GHZ) states shared within different combinations of subsets of nodes. The main problem is to determine whether LOCC transformations can generate an entanglement configuration B from another entanglement configuration A, written as B < LOCC A. We characterize the resulting partial order introduced on unitarily equivalent classes of entanglement configurations due to LOCC transformations. This study includes the communication complexity of generating higher cardinality multipartite CAT states from smaller sized CAT state configurations. We also study classes of incomparable entanglement configurations where no pair (A, B) of configurations satisfies A < LOCC B. This leads us to investigate certain combinatorial properties of hypergraphs and hypertrees following initial results in [25, 27]. We study the unique reconstruction of vertex labelled r‐uniform hypertrees on n vertices, where r ⩽ n is a constant, and each hyperedge has the same number r, of vertices. We conclude by discussing several problems and open questions in the context of entanglement configurations.
In the rapidly developing field of quantum cryptography, graph theory provides a useful mathematical foundation for complex relationships and structures.Applications for it are becoming more and more common.Vertices, edges, connectivity, and graph states, all components of graph theory help illustrate multi-party entanglement, network connection, and protocol designs in quantum cryptography systems.The connection between graph theory and quantum cryptography is examined in this article.It shows that, graph theory and quantum cryptography design can be used to create scalable, reliable quantum secure networks.The basics of graph theory, including network modeling and graph-state entanglement, are covered.It then gives a summary of modern graph-based quantum cryptography methods, including those used for secure computing, secret sharing, and key distribution.The study highlights current issues while contrasting their approaches and resource requirements.Graph states are used in current methods for secret sharing and multi-party key agreement.Additionally, they use graph structures for protocol creation and graph networks for routing in quantum key distribution (QKD).However, significant obstacles remain, such as the experimental construction of large graph-state networks, securing against different types of assaults, and using sophisticated graphtheoretic methods.Novel graph structures such as hypergraphs and quotient graphs should be the focus of future research.It should also develop graph-based solutions for post-quantum and multi-party cryptographic primitives and include classical-quantum network analysis.
The security of classical cryptography based on computational complexity assumptions has been severely challenged with the rapid development of quantum computers and quantum algorithms. Quantum cryptography, which offers unconditional security based on some principles of quantum mechanics, has become a significant branch and hotspot in the field of modern cryptography research. In this paper, we review the research and development of several important and well-studied branches of quantum cryptography in terms of theory and experiment, including quantum key distribution, quantum secret sharing, quantum secure direct communication, quantum signature, and quantum private query. We also briefly review the research and development of some other branches which are currently in the stage of theoretical research but receive widespread concern from academia, including quantum private comparison, quantum anonymous voting, quantum secure multi-party summation, quantum sealed-bid auction, quantum public key cryptosystem, quantum key agreement, quantum dialogue, and quantum identity authentication. In addition, we discuss some open issues and future research directions for the branches referred to above.
Quantum secret sharing is an important foundation for building a distributed quantum network security mechanism. Its core lies in utilizing the non-orthogonality, entanglement correlation and measurement perturbation characteristics of quantum states to achieve the secure distribution and recovery of secrets under the condition of multiparty collaboration. As the related protocols and technical branches become increasingly complex, the intrinsic physical connections among different technical routes have been blurred to a certain extent. From the perspective of quantum state encoding resources, this paper provides a systematic review of the physical mechanisms, protocol constructions, and security features of typical quantum state resources in current quantum secret sharing protocols. For discrete-variable systems, it analyzes the operational roles of various resources, including two- and multi-basis encodings, Bell states, GHZ (Greenberger-Horne-Zeilinger) states, W states, graph states, and orthogonal product states, in secret encoding, share distribution, and collaborative recovery processes. For continuous-variable systems, it examines the paradigm differences between Gaussian entangled states and non-Gaussian states in terms of entanglement structure, security modeling, and practical realizability. The paper compares and analyzes the performance characteristics and security thresholds of different quantum state resources across multiple dimensions, such as fidelity, trace distance, entanglement measures, key generation rate, and resource efficiency, and systematically summarizes the security boundaries and detection mechanisms of various protocols under different attack models. It is pointed out that cross-platform compatibility, measurement device-independent architecture, security proof under limited key conditions, and unified performance evaluation for actual noise environments in heterogeneous quantum networks will become important development directions for quantum secret sharing.
Entanglement is one of the fundamental features of quantum information science.\nThough bipartite entanglement has been analyzed thoroughly in theory and shown to\nbe an important resource in quantum computation and communication protocols, the\ntheory of entanglement shared between more than two parties, which is called multipartite\nentanglement, is still not complete. Specifically, the classification of multipartite\nentanglement and the transformation property between different multipartite states by\nlocal operators and classical communications (LOCC) are two fundamental questions in\nthe theory of multipartite entanglement.\nIn this thesis, we present results related to the LOCC transformation between multipartite\nentangled states. Firstly, we investigate the bounds on the LOCC transformation\nprobability between multipartite states, especially the GHZ class states. By analyzing\nthe involvement of 3-tangle and other entanglement measures under weak two-outcome\nmeasurement, we derive explicit upper and lower bound on the transformation probability\nbetween GHZ class states. After that, we also analyze the transformation between\nN-party W type states, which is a special class of multipartite entangled states that\nhas an explicit unique expression and a set of analytical entanglement monotones. We\npresent a necessary and sufficient condition for a known upper bound of transformation\nprobability between two N-party W type states to be achieved.\nWe also further investigate a novel entanglement transformation protocol, the random\ndistillation, which transforms multipartite entanglement into bipartite entanglement\nii\nshared by a non-deterministic pair of parties. We find upper bounds for the random distillation\nprotocol for general N-party W type states and find the condition for the upper\nbounds to be achieved. What is surprising is that the upper bounds correspond to entanglement\nmonotones that can be increased by Separable Operators (SEP), which gives\nthe first set of analytical entanglement monotones that can be increased by SEP.\nFinally, we investigate the idea of a new class of multipartite entangled states, the\nAbsolutely Maximal Entangled (AME) states, which is characterized by the fact that\nany bipartition of the states would give a maximal entangled state between the two sets.\nThe relationship between AME states and Quantum secret sharing (QSS) protocols is\nexhibited and the application of AME states in novel quantum communication protocols\nis also explored.