Related papers: Matrix Pencils and Entanglement Classification
We investigate the behavior of quantum states under stochastic local quantum operations and classical communication (SLOCC) for fixed numbers of qubits. We explicitly exhibit the homomorphism between complex and real groups for two-qubits,…
Based on the generators of $SU(n)$ we present inequalities for detecting quantum entanglement for $2 \otimes d$ and $M \otimes N$ systems. These inequalities provide a sufficient condition of entanglement for bipartite mixed states and give…
We investigate the proportional relationships for spectrums and for SJNFs (Standard Jordan Normal Forms) of the matrices constructed from coefficient matrices of two SLOCC (stochastic local operations and classical communication) equivalent…
Suppose a set of $m$-partite, $m\geq3$, pure orthogonal fully separable states is given. We consider the task of distinguishing these states perfectly by local operations and classical communication (LOCC) in different $k$-partitions,…
We study how well answer to the question ``Is the given quantum state equal to a certain maximally entangled state?'' using LOCC, in the context of hypothesis testing. Under several locality and invariance conditions, optimal tests will be…
We introduce a new family of strong linearizations of matrix polynomials---which we call "block Kronecker pencils"---and perform a backward stability analysis of complete polynomial eigenproblems. These problems are solved by applying any…
Summary. A simple derivation of finite Schmidt decomposition of pure states describing finite dimensional systems interacting with the infinite dimensional ones is presented. In particular, maximally entangled pure states in such systems…
We present an entanglement criterion for two mode squeezed states which relies on particle counting only. The proposed inequality is optimal for the state under consideration and robust against particle losses up to 2/3. As it does not…
We study how the realignment criterion (also called computable cross-norm criterion) succeeds asymptotically in detecting whether random states are separable or entangled. We consider random states on $\C^d \otimes \C^d$ obtained by partial…
Entanglement is a key resource for quantum computing, sensing, and communication, however it is highly susceptible to decoherence. To address this, quantum optics has explored filtering techniques like photon ancillas and Rydberg atom…
Based on the realignment moments of density matrix, we study parameterized entanglement criteria for bipartite and multipartite states. By adjusting the different parameter values, our criterion can detect not only bound entangled states,…
Understanding multipartite entanglement is vital, as it underpins a wide range of phenomena across physics. The study of transformations of states via Local Operations assisted by Classical Communication (LOCC) allows one to quantitatively…
A multipartite quantum state is entangled if it is not separable. Quantum entanglement plays a fundamental role in many applications of quantum information theory, such as quantum teleportation. Stochastic local quantum operations and…
Linearization is a standard method in the computation of eigenvalues and eigenvectors of matrix polynomials. In the last decade a variety of linearization methods have been developed in order to deal with algebraic structures and in order…
Quantifying entanglement is one of the most important tasks in the entanglement theory. In this paper, we establish entanglement monotones in terms of an operational approach, which is closely connected with the state conversion from pure…
We classify the completely-positive maps acting on two $d$-dimensional systems which commute with all $U\otimes U$ unitaries, where $U\in SU(d)$. This set of operations map Werner states to Werner states. We find a simple condition for a…
One of the main challenges of quantum information is the reliable verification of quantum entanglement. The conventional detection schemes require repeated measurement on a large number of identically prepared systems. This is hard to…
We present a quasipolynomial-time algorithm for solving the weak membership problem for the convex set of separable, i.e. non-entangled, bipartite density matrices. The algorithm decides whether a density matrix is separable or whether it…
We show there are at least 28 distinct true SLOCC entanglement classes for four-qubits by means of SLOCC invariant and semi-invariants and derive the number of the degenerated SLOCC classes for n-qubits.
So far, various multi-photon entangled states have been observed experimentally by using different experimental set-ups. Here, we present a scheme to realize many SLOCC-inequivalent states of three and four qubits via projective…