arXiv subjects

M. A. Jafarizadeh

Publications and source records attributed to M. A. Jafarizadeh.

At least 55 records · Page 3Linked to original sources

arXiv2009

Quantifying entanglement of two relativistic particles via decomposable optimal entanglement witnesses

The study of Entanglement of Formation of a mixed state of a bipartite system in high-dimensional Hilbert space is not easy in general. So, we focus on determining the amount of entanglement for a bipartite mixed state based on the concept of decomposable optimal entanglement witness (DOEW), that can be calculated as a minimum distance of an entangled state from the edge of positive partial transpose (PPT) states which has the most negative (positive) expectation value for non-PPT (bound) entangled states. We have constructed DOEWs based on the convex optimization method, then by using of it we quantify the degree of entanglement for two spin half particles under the Lorentz transformations. For convenience, we restrict ourselves to 2D momentum subspace and under this constraint when the momentum and the Lorentz boost are parallel, we have shown that the entanglement is not relativistic invariant. Keywords : Relativistic entanglement, Measure of entanglement, Optimal entanglement witnesses, Convex optimization PACS numbers: 03.67.Hk, 03.65.Ta

quant-ph↗

arXiv2009

Nonlinear and linear entanglement witnesses for bipartite systems via exact convex optimization

Linear and nonlinear entanglement witnesses for a given bipartite quantum systems are constructed. Using single particle feasible region, a way of constructing effective entanglement witnesses for bipartite systems is provided by exact convex optimization. Examples for some well known two qutrit quantum systems show these entanglement witnesses in most cases, provide necessary and sufficient conditions for separability of given bipartite system. Also this method is applied to a class of bipartite qudit quantum systems with details for d=3, 4 and 5. Keywords: non-linear and linear entanglement witnesses PACS number(s): 03.67.Mn, 03.65.Ud

quant-ph↗

arXiv2009

The minimum-error discrimination via Helstrom family of ensembles and Convex Optimization

Using the convex optimization method and Helstrom family of ensembles introduced in Ref. [1], we have discussed optimal ambiguous discrimination in qubit systems. We have analyzed the problem of the optimal discrimination of N known quantum states and have obtained maximum success probability and optimal measurement for N known quantum states with equiprobable prior probabilities and equidistant from center of the Bloch ball, not all of which are on the one half of the Bloch ball and all of the conjugate states are pure. An exact solution has also been given for arbitrary three known quantum states. The given examples which use our method include: 1. Diagonal N mixed states; 2. N equiprobable states and equidistant from center of the Bloch ball which their corresponding Bloch vectors are inclined at the equal angle from z axis; 3. Three mirror-symmetric states; 4. States that have been prepared with equal prior probabilities on vertices of a Platonic solid. Keywords: minimum-error discrimination, success probability, measurement, POVM elements, Helstrom family of ensembles, convex optimization, conjugate states PACS Nos: 03.67.Hk, 03.65.Ta

quant-ph↗

arXiv2009

Optimal Entanglement Provision over Underlying Networks of Group Association Schemes

We investigate creation of optimal entanglement in symmetric networks. The proposed network is one in which the connections are organized by a group table in other words a group association scheme. We show that optimal entanglement can be provided over such networks by adjusting couplings and initial state. We find that the optimal initial state is a simple local excited state. Moreover we obtain an analytic formula for entanglement achievable between vertex pairs located in the same strata and calculate their relevant optimal couplings. For those pairs located in different strata two upper bounds are presented. These results are also checked numerically.

quant-ph↗

arXiv2009

Continuous-Time Classical and Quantum Random Walk on Direct Product of Cayley Graphs

In this paper we define direct product of graphs and give a recipe for obtained probability of observing particle on vertices in the continuous-time classical and quantum random walk. In the recipe, the probability of observing particle on direct product of graph obtain by multiplication of probability on the corresponding to sub-graphs, where this method is useful to determine probability of walk on complicated graphs. Using this method, we calculate the probability of continuous-time classical and quantum random walks on many of finite direct product cayley graphs (complete cycle, complete $K_n$, charter and $n$-cube). Also, we inquire that the classical state the stationary uniform distribution is reached as $t\longrightarrow \infty$ but for quantum state is not always satisfy.

quant-ph↗

arXiv2009

Perfect state transfer of a qudit over underlying networks of group association schemes

As generalizations of results of Christandl et al.\cite{8,9""} and Facer et al.\cite{Facer}, Bernasconi et al.\cite{godsil,godsil1} studied perfect state transfer (PST) between two particles in quantum networks modeled by a large class of cubelike graphs (e.g., the hypercube) which are the Cayley graphs of the elementary abelian group $Z_2^n$. In Refs. \cite{PST,psd}, respectively, PST of a qubit over distance regular spin networks and optimal state transfer (ST) of a $d$-level quantum state (qudit) over pseudo distance regular networks were discussed, where the networks considered there were not in general related with a certain finite group. In this paper, PST of a qudit over antipodes of more general networks called underlying networks of association schemes, is investigated. In particular, we consider the underlying networks of group association schemes in order to employ the group properties (such as irreducible characters) and use the algebraic structure of these networks (such as Bose-Mesner algebra) in order to give an explicit analytical formula for coupling constants in the Hamiltonians so that the state of a particular qudit initially encoded on one site will perfectly evolve to the opposite site without any dynamical control. It is shown that the only necessary condition in order to PST over these networks be achieved is that the centers of the corresponding groups be non-trivial. Therefore, PST over the underlying networks of the group association schemes over all the groups with non-trivial centers such as the abelian groups, the dihedral group $D_{2n}$ with even $n$, the Clifford group CL(n) and all of the $p$-groups can be achieved.

quant-ph↗

arXiv2009

A general algorithm for manipulating non-linear and linear entanglement witnesses by using exact convex optimization

A generic algorithm is developed to reduce the problem of obtaining linear and nonlinear entanglement witnesses of a given quantum system, to convex optimization problem. This approach is completely general and can be applied for the entanglement detection of any N-partite quantum system. For this purpose, a map from convex space of separable density matrices to a convex region called feasible region is defined, where by using exact convex optimization method, the linear entanglement witnesses can be obtained from polygonal shape feasible regions, while for curved shape feasible regions, envelope of the family of linear entanglement witnesses can be considered as nonlinear entanglement witnesses. This method proposes a new methodological framework within which most of previous EWs can be studied. To conclude and in order to demonstrate the capability of the proposed approach, besides providing some nonlinear witnesses for entanglement detection of density matrices in unextendible product bases, W-states, and GHZ with W-states, some further examples of three qubits systems and their classification and entanglement detection are included. Also it is explained how one can manipulate most of the non-decomposable linear and nonlinear three qubits entanglement witnesses appearing in some of the papers published by us and other authors, by the method proposed in this paper. Keywords: non-linear and linear entanglement witnesses, convex optimization. PACS number(s): 03.67.Mn, 03.65.Ud

quant-ph↗

arXiv2008

Perfect transfer of m-qubit GHZ states

By using some techniques such as spectral distribution and stratification associated with the graphs, employed in [1,2] for the purpose of Perfect state transfer (PST) of a single qubit over antipodes of distance-regular spin networks and PST of a $d$-level quantum state over antipodes of pseudo-distance regular networks, PST of an m-qubit GHZ state is investigated. To do so, we employ the particular distance-regular networks (called Johnson networks) J(2m,m) to transfer an m-qubit GHZ state initially prepared in an arbitrary node of the network (called the reference node) to the corresponding antipode, perfectly. Keywords: Perfect state transferenc, GHZ states, Johnson network, Stratification, Spectral distribution PACs Index: 01.55.+b, 02.10.Yn

quant-ph↗

arXiv2008

Perfect transference of a d-level quantum state over pseudo-distance-regular networks

Following the prescription of Ref. \cite{PST} in which perfect state transference (PST) of a qubit over distance regular spin networks was discussed, in this paper PST of an arbitrary $d$-level quantum state (qudit) over antipodes of more general networks called pseudo distance-regular networks, is investigated. In fact, the spectral analysis techniques used in the previous work \cite{PST}, and algebraic structures of pseudo distance-regular graphs are employed to give an explicit formula for suitable coupling constants in the Hamiltonians so that the state of a particular qudit initially encoded on one site will evolve freely to the opposite site without any dynamical control, i.e., we show that how to derive the parameters of the system so that PST can be achieved. Keywords:Perfect state transfer, $d$-level quantum state, Stratification, Pseudo-distance-regular network PACs Index: 01.55.+b, 02.10.Yn

quant-ph↗

arXiv2008

Two-qutrit Entanglement Witnesses and Gell-Mann Matrices

The Gell-Mann $λ$ matrices for Lie algebra su(3) are the natural basis for the Hilbert space of Hermitian operators acting on the states of a three-level system(qutrit). So the construction of EWs for two-qutrit states by using these matrices may be an interesting problem. In this paper, several two-qutrit EWs are constructed based on the Gell-Mann matrices by using the linear programming (LP) method exactly or approximately. The decomposability and non-decomposability of constructed EWs are also discussed and it is shown that the $λ$-diagonal EWs presented in this paper are all decomposable but there exist non-decomposable ones among $λ$-non-diagonal EWs.

quant-ph↗

arXiv2008

Investigating a Class of $2\otimes2\otimes d$ Chessboard Density Matrices via Linear and Non-linear Entanglement Witnesses Constructed by Exact Convex Optimization

Here we consider a class of $2\otimes2\otimes d$ chessboard density matrices starting with three-qubit ones which have positive partial transposes with respect to all subsystems. To investigate the entanglement of these density matrices, we use the entanglement witness approach. For constructing entanglement witnesses (EWs) detecting these density matrices, we attempt to convert the problem to an exact convex optimization problem. To this aim, we map the convex set of separable states into a convex region, named feasible region, and consider cases that the exact geometrical shape of feasible region can be obtained. In this way, various linear and non-linear EWs are constructed. The optimality and decomposability of some of introduced EWs are also considered. Furthermore, the detection of the density matrices by introduced EWs are discussed analytically and numerically. {\bf Keywords: chessboard density matrices, optimal non-linear entanglement witnesses, convex optimization} {\bf PACs Index: 03.65.Ud}

quant-ph↗

arXiv2008

Quantum tomography with wavelet transform in Banach space on Homogeneous space

The intimate connection between the Banach space wavelet reconstruction method on homogeneous spaces with both singular and nonsingular vacuum vectors, and some of well known quantum tomographies, such as: Moyal-representation for a spin, discrete phase space tomography, tomography of a free particle, Homodyne tomography, phase space tomography and SU(1,1) tomography is explained. Also both the atomic decomposition and banach frame nature of these quantum tomographic examples is explained in details. Finally the connection between the wavelet formalism on Banach space and Q-function is discussed.

quant-ph↗

arXiv2008

Detecting three-qubit bound MUB diagonal entangled states via Nonlinear optimal entanglement witnesses

One of the important approaches to detect quantum entanglement is using linear entanglement witnesses EWs. In this paper, by determining the envelope of the boundary hyper-planes defined by a family of linear EWs, a set of powerful nonlinear optimal EWs is manipulated. These EWs enable us to detect some three qubits bound MUB (mutually unbiased bases) diagonal entangled states, i.e., the PPT (positive partial transpose) entangled states. Also, in some particular cases, the introduced nonlinear optimal EWs are powerful enough to separate the bound entangled regions from the separable ones. Finally, we present numerical examples to demonstrate the practical accessibility of this approach. Keywords :nonlinear optimal entanglement witnesses, mutually unbiased bases, MUB diagonal states

quant-ph↗

arXiv2007

Multi-qubit stabilizer and cluster entanglement witnesses

One of the problems concerning entanglement witnesses (EWs) is the construction of them by a given set of operators. Here several multi-qubit EWs called stabilizer EWs are constructed by using the stabilizer operators of some given multi-qubit states such as GHZ, cluster and exceptional states. The general approach to manipulate the multi-qubit stabilizer EWs by exact(approximate) linear programming (LP) method is described and it is shown that the Clifford group play a crucial role in finding the hyper-planes encircling the feasible region. The optimality, decomposability and non-decomposability of constructed stabilizer EWs are discussed.

quant-ph↗

arXiv2007

Calculating effective resistances on underlying networks of association schemes

Recently, in Refs. \cite{jsj} and \cite{res2}, calculation of effective resistances on distance-regular networks was investigated, where in the first paper, the calculation was based on stratification and Stieltjes function associated with the network, whereas in the latter one a recursive formula for effective resistances was given based on the Christoffel-Darboux identity. In this paper, evaluation of effective resistances on more general networks which are underlying networks of association schemes is considered, where by using the algebraic combinatoric structures of association schemes such as stratification and Bose-Mesner algebras, an explicit formula for effective resistances on these networks is given in terms of the parameters of corresponding association schemes. Moreover, we show that for particular underlying networks of association schemes with diameter $d$ such that the adjacency matrix $A$ possesses $d+1$ distinct eigenvalues, all of the other adjacency matrices $A_i$, $i\neq 0,1$ can be written as polynomials of $A$, i.e., $A_i=P_i(A)$, where $P_i$ is not necessarily of degree $i$. Then, we use this property for these particular networks and assume that all of the conductances except for one of them, say $c\equiv c_1=1$, are zero to give a procedure for evaluating effective resistances on these networks. The preference of this procedure is that one can evaluate effective resistances by using the structure of their Bose-Mesner algebra without any need to know the spectrum of the adjacency matrices.

math-ph↗

arXiv2007

Bell-states diagonal entanglement witnesses for relativistic and non-relativistic multispinor systems in arbitrary dimensions

Two kinds of Bell-states diagonal (BSD) entanglement witnesses (EW) are constructed by using the algebra of Dirac $γ$ matrices in the space-time of arbitrary dimension $d$, where the first kind can detect some BSD relativistic and non-relativistic $m$-partite multispinor bound entangled states in Hilbert space of dimension $2^{m\lfloor d/2\rfloor}$, including the bipartite Bell-type and iso-concurrence type states in the four-dimensional space-time ($d=4$). By using the connection between Hilbert-Schmidt measure and the optimal EWs associated with states, it is shown that as far as the spin quantum correlations is concerned, the amount of entanglement is not a relativistic scalar and has no invariant meaning. The introduced EWs are manipulated via the linear programming (LP) which can be solved exactly by using simplex method. The decomposability or non-decomposability of these EWs is investigated, where the region of non-decomposable EWs of the first kind is partially determined and it is shown that, all of the EWs of the second kind are decomposable. These EWs have the preference that in the bipartite systems, they can determine the region of separable states, i.e., bipartite non-detectable density matrices of the same type as the EWs of the first kind are necessarily separable. Also, multispinor EWs with non-polygon feasible regions are provided, where the problem is solved by approximate LP, and in contrary to the exactly manipulatable EWs, both the first and second kind of the optimal approximate EWs can detect some bound entangled states. Keywords: Relativistic entanglement, Entanglement Witness, Multispinor, Linear Programming, Feasible Region. PACs Index: 03.65.Ud

quant-ph↗

arXiv2007

Perfect state transfer over distance-regular spin networks

By considering distance-regular graphs as spin networks, first we introduce some particular spin Hamiltonians which are extended version of those of Refs.\cite{8,9''}. Then, by using spectral analysis techniques and algebraic combinatoric structure of distance-regular graphs such as stratification introduced in \cite{obata, js} and Bose-Mesner algebra, we give a method for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site of a network will evolve freely to the opposite site without any dynamical controls, i.e., we show that how to derive the parameters of the system so that perfect state transfer (PST) can be achieved. As examples, the cycle networks with even number of vertices and $d$-dimensional hypercube networks are considered in details and the method is applied for some important distance-regular networks in appendix.

quant-ph↗

arXiv2007

Optimal Unambiguous Discrimination of Quantum States

Unambiguously distinguishing between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this work, an exact analytic solution to an optimum measurement problem involving an arbitrary number of pure linearly independent quantum states is presented. To this end, the relevant semi-definite programming task is reduced to a linear programming one with a feasible region of polygon type which can be solved via simplex method. The strength of the method is illustrated through some explicit examples. Also using the close connection between the Lewenstein-Sanpera decomposition(LSD) and semi-definite programming approach, the optimal positive operator valued measure for some of the well-known examples is obtain via Lewenstein-Sanpera decomposition method. {\bf Keywords:} Optimal Unambiguous State Discrimination, Linear Programming, Lewenstein-Sanpera decomposition. {\bf PACs Index: 03.67.Hk, 03.65.Ta, 42.50.-p

quant-ph↗