activity
19992009
most citedPerfect state transfer over distance-regular spin networks

45 citations · 358 across the 33 of their papers we have counts for

collaborators
Showing 2006Show all

8 papers · 1 filter

cond-mat.stat-mech2006

Calculating two-point resistances in distance-regular resistor networks

M. A. Jafarizadeh, R. Sufiani, S. Jafarizadeh

An algorithm for the calculation of the resistance between two arbitrary nodes in an arbitrary distance-regular resistor network is provided, where the calculation is based on stra…

quant-ph200622 cited

Manipulating Multi-qudit Entanglement Witnesses by Using Linear Programming

M. A. Jafarizadeh, G. Najarbashi, H. Habibian

A new class of entanglement witnesses (EWs) called reduction type entanglement witnesses is introduced, which can detect some multi-qudit entangeled states including PPT ones with…

math-ph200620 cited

Investigation of continuous-time quantum walk on root lattice and honeycomb lattice

M. A. Jafarizadeh, R. Sufiani

The continuous-time quantum walk (CTQW) on root lattice (known as hexagonal lattice for ) and honeycomb one is investigated by using spectral distribution method. To thi…

quant-ph2006

Evaluation of relative entropy of entanglement and derivation of optimal Lewenstein-Sanpera decomposition of Bell decomposable states via convex optimization

M. A. Jafarizadeh, M. Mirzaee, M. Rezaee

We provide an analytical expression for optimal Lewenstein-Sanpera decomposition of Bell decomposable states by using semi-definite programming. Also using the Karush-Kuhn-Tucker o…

quant-ph200616 cited

Generalized qudit Choi maps

M. A. Jafarizadeh, M. Rezaeen, S. Ahadpour

Following the linear programming prescription of Ref. \cite{PRA72}, the Bell diagonal entanglement witnesses are provided. By using Jamiolkowski isomorphism, it is sho…

quant-ph200636 cited

Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm

M. A. Jafarizadeh, S. Salimi, R. Sufiani

In papers\cite{js,jsa}, the amplitudes of continuous-time quantum walk on graphs possessing quantum decomposition (QD graphs) have been calculated by a new method based on spectral…