Persistent entanglement in arrays of interacting particles
read the original abstract
We study the entanglement properties of a class of $N$ qubit quantum states that are generated in arrays of qubits with an Ising-type interaction. These states contain a large amount of entanglement as given by their Schmidt measure. They have also a high {\em persistency of entanglement} which means that $\sim N/2$ qubits have to be measured to disentangle the state. These states can be regarded as an entanglement resource since one can generate a family of other multi-particle entangled states such as the generalized GHZ states of $<N/2$ qubits by simple measurements and classical communication (LOCC).
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
The Structure of Circle Graph States
Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.
-
The $S=\frac{1}{2}$ XY and XYZ models on the two or higher dimensional hypercubic lattice do not possess nontrivial local conserved quantities
The S=1/2 XY and XYZ models on d≥2 hypercubic lattices possess no nontrivial local conserved quantities.
-
On the existence of fully inseparable biseparable Gaussian states
Numerical evidence from projections and witnesses on specific Gaussian families leads to the conjecture that full inseparability implies genuine multipartite entanglement for all Gaussian states.
-
Experimental verification of multi-copy activation of genuine multipartite entanglement
Experimental demonstration that two copies of a biseparable three-qubit state exhibit genuine multipartite entanglement when combined on a trapped-ion device.
-
Entanglement Certification $-$ From Theory to Experiment
Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.