相关论文: Entangled Graphs
With any state of a multipartite quantum system its separability polytope is associated. This is an algebro-topological object (non-trivial only for mixed states) which captures the localisation of entanglement of the state. Particular…
We propose a unified mathematical scheme, based on a classical tensor isomorphism, for characterizing entanglement that works for pure states of multipartite systems of any number of particles. The degree of entanglement is indicated by a…
We characterize the linear maps that preserve maximally entangled states in $L(\mathcal X \otimes \mathcal Y)$ in the case where $\dim(\mathcal X)$ divides $\dim(\mathcal Y)$.
Steering criteria are conditions whose violation excludes the possibility of describing the observed measurement statistics with local hidden state (LHS) models. When the available data do not allow to exclude arbitrary LHS models, it may…
We propose that the entanglement of mixed states is characterised properly in terms of a probability density function $\mathcal{P}(\mathcal{E})$. There is a need for such a measure since the prevalent measures (such as \textit{concurrence}…
We introduce a divisibility-type condition for directed graphs that is necessary for $\mathcal{Z}$-stability of the corresponding graph $C^*$-algebra. We prove that this condition is sufficient if either the graph $E$ has no cycles or the…
Entanglement is fundamental inasmuch because it rephrases the quest for the classical-quantum demarcation line, and it also has potentially enormous practical applications in modern information technology. In this work, employing the…
Detection of entanglement through partial knowledge of the quantum state is a challenge to implement efficiently. Here we propose a separability criterion for detecting bipartite entanglement in arbitrary dimensional quantum states using…
We experimentally generate and tomographically characterize a mixed, genuinely non-Gaussian bipartite continuous-variable entangled state. By testing entanglement in 2$\times$2-dimensional two-qubit subspaces, entangled qubits are localized…
We explore some basic entanglement features of multiqubit systems that are relevant for the development of algorithms for searching highly entangled states. In particular, we compare the behaviours of multiqubit entanglement measures based…
Entanglement criteria for general (pure or mixed) states of systems consisting of two identical fermions are introduced. These criteria are based on appropriate inequalities involving the entropy of the global density matrix describing the…
We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in…
We study the entanglement detection by using mutually unbiased measurements and provide a quantum separability criterion that can be experimentally implemented for arbitrary $d$-dimensional bipartite systems. We show that this criterion is…
In this paper, we discuss the entanglement properties of graph-diagonal states, with particular emphasis on calculating the threshold for the transition between the presence and absence of entanglement (i.e. the separability point). Special…
We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using…
We derive a many-particle inseparability criterion for mixed states using the relation between single-mode and many-particle nonclassicalities. It works very well not only in the vicinity of the Dicke states, but also for the superposition…
We consider the problem of learning the weighted edges of a balanced mixture of two undirected graphs from epidemic cascades. While mixture models are popular modeling tools, algorithmic development with rigorous guarantees has lagged.…
Recent efforts have focused on characterizing the set of separable states that cannot be made entangled by any global unitary transformation. Here we characterize the set of states whose entanglement content cannot be increased under any…
Entanglement plays an important role in our ability to understand, simulate, and harness quantum many-body phenomena. In this work, we investigate the entanglement spectrum for open one-dimensional systems, and propose a natural quantifier…
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the…