Related papers: Separable Operations, Graph Codes and the Location…
We consider deeply the relation between the orthogonality and the distinguishability of a set of arbitrary states (including multi-partite states). It is shown that if a set of arbitrary states can be distinguished by local operations and…
Quantum information is nonlocal in the sense that local measurements on a composite quantum system, prepared in one of many mutually orthogonal states, may not reveal in which state the system was prepared. It is shown that in the many copy…
Understanding multipartite entanglement is a key goal in quantum information. Entanglement in pure states can be characterised by considering transformations under Local Operations assisted by Classical Communication (LOCC). However, it has…
The conditional disclosure of secrets (CDS) setting is among the most basic primitives studied in information-theoretic cryptography. Motivated by a connection to non-local quantum computation and position-based cryptography, CDS with…
We study here the conditions to perform the distribution of a pure state on a quantum network using quantum operations which can succeed with a non-zero probability, the Stochastic Local Operation and Classical Communication (SLOCC)…
We can only perform a finite rounds of measurements in protocols with local operations and classical communication (LOCC). In this paper, we propose a set of product states, which require infinite rounds of measurements in order to…
It is well known that the classification of pure multiparticle entangled states according to stochastic local operations leads to a natural classification of mixed states in terms of convex sets. We present a simple algorithmic procedure to…
We investigate the information-theoretic power of spatial superposition by analyzing tasks in which infor- mation is locally encoded at multiple distant sites and must be acquired by a single information carrier, such as a particle. Within…
Quantum information theory studies the fundamental limits that physical laws impose on information processing tasks such as data compression and data transmission on noisy channels. This thesis presents general techniques that allow one to…
This paper addresses the challenge of integrating semantic communication principles into operated networks, traditionally optimized based on network-centric metrics rather than application-specific needs. Operated networks strongly adhere…
We solve the entanglement classification under stochastic local operations and classical communication (SLOCC) for all multipartite symmetric states in the general $N$-qubit case. For this purpose, we introduce 2 parameters playing a…
Divisible codes are defined by the property that codeword weights share a common divisor greater than one. They are used to design signals for communications and sensing, and this paper explores how they can be used to protect quantum…
Nonlocal properties (globalness) of a non-separable unitary determine how the unitary affects the entanglement properties of a quantum state. We apply a given two-qubit unitary on a quadpartite system including two reference systems and…
The main purpose of thispaper is to show that composite quantum-like (QL) systems can closely mimic the separable states of quantum systems, and that suitable physical systems exhibiting these states exist. It is shown that QL graphs can…
We provide a first operational method for checking indistinguishability of orthogonal states by local operations and classical communication (LOCC). This method originates from the one introduced by Ghosh et al. (Phys. Rev. Lett. 87, 5807…
Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed…
Graph states are a key resource for measurement-based quantum computation and quantum networking, but state-preparation costs limit their practical use. Graph states related by local complement (LC) operations are equivalent up to…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
Classifying locally equivalent graph states, and stabilizer states more broadly, is a significant problem in the theories of quantum information and multipartite entanglement. A special focus is given to those graph states for which…
We introduce an operational entanglement classification of symmetric mixed states for an arbitrary number of qubits based on stochastic local operations assisted with classical communication (SLOCC operations). We define families of SLOCC…