Related papers: Formulas for Generalized Two-Qubit Separability Pr…
A new necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L.A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The new…
A complete description of the multitudinous ways in which quantum particles can be entangled requires the use of high-dimensional abstract mathematical spaces. We report here a particularly interesting feature of the nine-dimensional convex…
We generalize Grover algorithm with two arbitrary phases in a density matrix set up. We give exact analytic expressions for the success probability after arbitrary number of iteration of the generalized Grover operator as a function of…
A general separability condition on the second moment (covariance matrix) for continuous variable two-party systems is derived by an analysis analogous to the derivation of the Kennard's uncertainty relation without referring to the…
We extend Gleason's theorem to the two-dimensional Hilbert space of a qubit by invoking the standard axiom that describes composite quantum systems. The tensor-product structure allows us to derive density matrices and Born's rule for $d=2$…
A discussion of discrete Wigner functions in phase space related to mutually unbiased bases is presented. This approach requires mathematical assumptions which limits it to systems with density matrices defined on complex Hilbert spaces of…
We give a method to embed the q-series in a (p,q)-series and derive the corresponding (p,q)-extensions of the known q-identities. The (p,q)-hypergeometric series, or twin-basic hypergeometric series (diferent from the usual bibasic…
In this paper, an intuitive approach is employed to generalize the full separability criterion of tripartite quantum states of qubits to the higher-dimensional systems (Phys. Rev. A \textbf{72}, 022333 (2005)). A distinct characteristic of…
The main aim of the present work is to give some interesting the $q$-analogues of various $q$-recurrence relations, $q$-recursion formulas, $q$-partial derivative relations, $q$-integral representations, transformation and summation…
A hierarchical structure of isomorphic arithmetics is defined by a bijection $g_\mathbb{R}:\mathbb{R}\to \mathbb{R}$. It entails a hierarchy of probabilistic models, with probabilities $p_k=g^k(p)$, where $g$ is the restriction of…
We show how generalized parton distributions (GPDs) can be determined in the case where hadrons are described in terms of their partonic degrees of freedom through solutions of dynamical equations. We demonstrate our approach on the example…
Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are…
For two qubits and for general bipartite quantum systems, we give a simple spectral condition in terms of the ordered eigenvalues of the density matrix which guarantees that the corresponding state is separable.
In a Generalised Probabilistic Theory (GPT) equipped additionally with some extra geometric structure we define the morphophoric measurements as those for which the measurement map sending states to distributions of the measurement results…
In a previous study (quant-ph/9911058), several remarkably simple exact results were found, in certain specialized m-dimensional scenarios (m<5), for the a priori probability that a pair of qubits is unentangled/separable. The measure used…
Zyczkowski, Horodecki, Sanpera, and Lewenstein (ZHSL) recently proposed a ``natural measure'' on the N-dimensional quantum systems (quant-ph/9804024), but expressed surprise when it led them to conclude that for N = 2 x 2, disentangled…
Separability and entanglement for n-qubits systems are quantified by using Hilbert-Schmidt (HS) decompositions in which the density matrices are decomposed into various terms representing certain one qubit, two-qubits,and larger qubits…
Many protocols of quantum information processing use entangled states. Hence, separability criteria are of great importance. We propose new separability conditions for a bipartite finite-dimensional system. They are derived by using…
We develop separability criteria to identify non-$k$-separability $(k = 2,3,\ldots,n)$ and genuine multipartite entanglement in different classes of mixed $n$-partite quantum states using elements of density matrices. With the help of these…
We study the computational complexity of the problem SFT (Sum-free Formula partial Trace): given a tensor formula F over a subsemiring of the complex field (C,+,.) plus a positive integer k, under the restrictions that all inputs are column…