Related papers: Combinatorial Entanglement
For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…
The classification of electron systems according to their topology has been at the forefront of condensed matter research in recent years. It has been found that systems of the same symmetry, previously thought of as equivalent, may in fact…
Entangled coherent states are useful for various applications in quantum information processing but they are are sensitive to loss. We propose a scheme to generate distributed entangled coherent states over a lossy environment in such a way…
Graph states -- one of the most representative families of multipartite entangled states, are important resources for multiparty quantum communication, quantum error correction, and quantum computation. Device-independent certification of…
Highly entangled graph states of photons have applications in universal quantum computing and in quantum communications. In the latter context, they have been proposed as the key ingredient in the establishment of long-distance entanglement…
A graph $G$ is said to be chordal if it has no induced cycles of length four or more. In a recent preprint Culbertson, Guralnik, and Stiller give a new characterization of chordal graphs in terms of sequences of what they call…
The coupling of a quantum system to an environment leads generally to decoherence, and it is detrimental to quantum correlations within the system itself. Yet some forms of quantum correlations can be robust to the presence of an…
Entanglement is the key resource for quantum technologies and is at the root of exciting many-body phenomena. However, quantifying the entanglement between two parts of a real-world quantum system is challenging when it interacts with its…
Graph states are a family of stabilizer states which can be tailored towards various applications in photonic quantum computing and quantum communication. In this paper, we present a modular design based on quantum dot emitters coupled to a…
Entanglement is a fundamental feature of quantum mechanics and a key resource for quantum information processing. Among multipartite entangled states, Dicke states $|D_n^k\rangle$ are distinguished by their permutation symmetry, which…
We present a criterion for multiparticle entanglement based on covariance matrices. On the one hand, the criterion allows to detect bound entangled states which are not detected by other criteria; on the other hand, some strongly entangled…
We consider a collection of bosonic modes corresponding to the vertices of a graph $\Gamma.$ Quantum tunneling can occur only along the edges of $\Gamma$ and a local self-interaction term is present. Quantum entanglement of one vertex with…
In many physical scenarios, close relations between the bulk properties of quantum systems and theories associated to their boundaries have been observed. In this work, we provide an exact duality mapping between the bulk of a quantum spin…
Spectral embedding is a procedure which can be used to obtain vector representations of the nodes of a graph. This paper proposes a generalisation of the latent position network model known as the random dot product graph, to allow…
Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure…
The control and manipulation of quantum-entangled non-local states is a crucial step for the development of quantum information processing. A promising route to achieve such states on a wide scale is to couple solid-state quantum emitters…
We address the question of quantifying entanglement in pure graph states. Evaluation of multipartite entanglement measures is extremely hard for most pure quantum states. In this paper we demonstrate how solving one problem in graph theory,…
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…
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank…
By combining the beam splitter and the Fresnel transform, a protocol is proposed to generate a new entangled state representation, called the intermediate coherent-entangled state (ICES) representation. The properties, such as eigenvalue…