Related papers: Combinatorial Approaches in Quantum Information Th…
Distributed quantum information processing is a promising platform for scaling up quantum information processing, where small- and intermediate-scale quantum devices are connected by a network of quantum channels for communicating quantum…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…
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…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…
Distributed quantum communication and quantum computing offer many new opportunities for quantum information processing. Here networks based on highly nonlocal quantum resources with complex entanglement structures have been proposed for…
We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored merging}, based on the monotonicity feature of entanglement…
In this paper, we investigate properties of some multi-particle entangled states and, from the properties applying the secret sharing present a new type of quantum key distribution protocols as generalization of quantum key distribution…
Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages…
Secret sharing is a multi-party cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed).…
Multiparty quantum key distribution (QKD) is useful for many applications that involve secure communication or collaboration among multiple parties. While it can be achieved using pairwise QKD, a more efficient approach is to achieve it…
Two dual questions in quantum information theory are to determine the communication cost of simulating a bipartite unitary gate, and to determine their communication capacities. We present a bipartite unitary gate with two surprising…
We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.
Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum…
Quantum information science breaks limitations of conventional information transfer, cryptography and computation by using quantum superpositions or entanglement as resources for information processing. Here, we report on the experimental…
Multipartite entanglement plays a crucial role for the design of the Quantum Internet, due to its potentiality of significantly increasing the network performance. In this paper, we design an entanglement access control protocol for…
This thesis presents a study of the structure of bipartite quantum states. In the first part, the representation theory of the unitary and symmetric groups is used to analyse the spectra of quantum states. In particular, it is shown how to…
We present new combinatorial objects, which we call grid-labelled graphs, and show how these can be used to represent the quantum states arising in a scenario which we refer to as the faulty emitter scenario: we have a machine designed to…
We introduce a family of QKD protocols for distributing shared random keys within a network of $n$ users. The advantage of these protocols is that any possible key structure needed within the network, including broadcast keys shared among…
We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods…
Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances. The practical side of theoretical computer…