SearcharxivSearch

arXiv subjects

R. Sufiani

Publications and source records attributed to R. Sufiani.

At least 19 recordsLinked to original sources

Quantum Correlation Dynamics for an Open Multi Qutrit System

We study the correlation dynamics of a system composed of arbitrary numbers of qutrits interacting with a common environment. Initially, the system is assumed to be in a low dimensional subspace of the Hamiltonian called "decoherence-free subspace". Environment induced quantum entanglement and discord is calculated between pair of qutrits of the system as measures of non-classical correlations. Finally the steady state distribution of entanglement and discord is determined with respect to the total number of qutrits of the system.

quant-ph

Quantum state transfer on distance regular spin networks with intrinsic decoherence

By considering distance-regular graphs as spin networks, we investigate the state transfer fidelity in this class of networks. The effect of environment on the dynamics of state transfer is modeled using Milburn's intrinsic decoherence [G. J. Milburn, Phys. Rev. A 44, 5401 (1991)]. We consider a particular type of spin Hamiltonians which are extended version of those of Christandl et al [Phys. Rev. A 71, 032312 (2005)]. It is shown that decoherence destroys perfect communication channels. Using optimal coupling strengths derived by Jafarizadeh and Sufiani [Phys. Rev. A 77, 022315 (2008)], we show that destructive effect of environment on the communication channel increases by increasing the decoherence rate, however the state transfer fidelity reaches a steady value as time approaches infinity which is independent of the decoherence rate. Moreover, it is shown that for a given decoherence rate, the fidelity of transfer decreases by increasing the distance between the sender and the receiver.

quant-ph

Quantum state transfer in atom-cavity systems with uncolored Cayley interacting networks

Considering the two-photon exchange interaction between n coupled cavities each of them containing a two level atom, the atomic and photonic state transfer is investigated. In fact, n atom-cavity systems are considered to be distributed on the nodes of an uncolored Cayley network and interact with each other via the adjacency matrix of the corresponding network. Then, by employing the photon-excitation conservation and also the algebraic structure of the networks, such as irreducible characters of the groups associated with the networks, some suitable basis for the atom-cavity state space is introduced based on the corresponding generalized Fourier transform, so that the Hamiltonian of the whole system, is block diagonalized with two-dimensional blocks. Then, by solving the corresponding Schrodinger equation exactly, quantum state transfer and also entanglement generation between the atoms or the photons are discussed. For instance, the probability amplitudes associated with the photon transition between the cavities or excitation transition between the atoms are obtained in terms of the irreducibles characters of the corresponding network and the hopping parameter ? between the cavities.

quant-ph

Generation of quantum entanglement between three level atoms via $n$ coupled cavities

Based on two-photon exchange interaction between $n$ coupled optical cavities each of them containing a single three level atom, the $n$-qubit and $n$-photonic state transfer is investigated. In fact, following the approach of Ref.\cite{Alex1}, we consider $n$ coupled cavities instead of two cavities and generalize the discussions about quantum state transfer, photon transition between cavities and entanglement generations between $n$ atoms. More clearly, by employing the consistency of number of photons (the symmetry of Hamiltonian), the hamiltonian of the system is reduced from $3^n$ dimensional space into 2n dimensional one. Moreover, by introducing suitable basis for the atom-cavity state space based on Fourier transform, the reduced Hamiltonian is block-diagonalized, with 2 dimensional blocks. Then, the initial state of the system is evolved under the corresponding Hamiltonian and the suitable times $T$ at which the initially unentangled atoms, become maximally entangled, are determined in terms of the hopping strength $ξ$ between cavities.

quant-ph

Quantum search in structured database using local adiabatic evolution and spectral methods

Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state space of a graph. The algorithm is based on a local diabatic evolution of the Hamiltonian associated with the graph. The main new idea is to apply some techniques such as Krylov bspace projection methods, Lanczos algorithm and spectral distribution methods. Indeed, using these techniques together with the second-order perturbation theory, we give a systematic method for calculating the approximate search time at which the marked state can be reached. That is, for any undirected regular connected graph which is considered as the state space of the database, the introduced algorithm provides a systematic and programmable way for evaluation of the search time, in terms of the corresponding graph polynomials.

quant-ph

Minimum error discrimination between similarity transformed quantum states

Using the known necessary and sufficient conditions for minimum error discrimination (MED), first it is shown that a Helstrom family of ensembles is equivalent to these conditions and then by a convex combination of the initial states (the states which we try to discriminate them) and the corresponding conjugate states, a more suitable and convenient form for the MED conditions is extracted, so that optimal set of measurements and corresponding optimal success probability of discrimination can be determined. Then, using the introduced identity, MED between N similarity transformed equiprobable quantum states is investigated. As a special case, MED between the so called group covariant or symmetric states is considered.

quant-ph

Generating GHZ state in 2m-qubit spin network

We consider a pure 2m-qubit initial state to evolve under a particular quantum me- chanical spin Hamiltonian, which can be written in terms of the adjacency matrix of the Johnson network J(2m;m). Then, by using some techniques such as spectral dis- tribution and stratification associated with the graphs, employed in [1, 2], a maximally entangled GHZ state is generated between the antipodes of the network. In fact, an explicit formula is given for the suitable coupling strengths of the hamiltonian, so that a maximally entangled state can be generated between antipodes of the network. By using some known multipartite entanglement measures, the amount of the entanglement of the final evolved state is calculated, and finally two examples of four qubit and six qubit states are considered in details.

quant-ph

Perfect state transfer over interacting boson networks associated with group schemes

It is shown how to perfectly transfer an arbitrary qudit state in interacting boson networks. By defining a family of Hamiltonians related to Bose-Hubbard model, we describe a possible method for state transfer through bosonic atoms trapped in these networks with different kinds of coupling strengths between them. Particularly, by taking the underlying networks of so called group schemes as interacting boson networks, we show how choose suitable coupling strengths between the nodes, in order that an arbitrary qudit state be transferred from one node to its antipode, perfectly. In fact, by employing the group theory properties of these networks, an explicit formula for suitable coupling strengths has been given in order that perfect state transfer (PST) be achieved. Finally, as examples, PST on the underlying networks associated with cyclic group C2m, dihedral group D2n, Clifford group CL(n), and the groups U6n and V8n has been considered in details. Keywords: Bose-Hubbard Hamiltonian, Interacting boson networks, Perfect state transfer (PST), Qudit state, Underlying networks, Group schemes PACs Index: 01.55.+b, 02.10.Yn

quant-ph

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

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

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

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

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

Evaluation of effective resistances in pseudo-distance-regular resistor networks

In Refs.[1] and [2], calculation of effective resistances on distance-regular networks was investigated, where in the first paper, the calculation was based on the stratification of the network 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 called pseudo-distance-regular networks [21] or QD type networks \cite{obata} is investigated, where we use the stratification of these networks and show that the effective resistances between a given node such as $α$ and all of the nodes $β$ belonging to the same stratum with respect to $α$ ($R_{αβ^{(m)}}$, $β$ belonging to the $m$-th stratum with respect to the $α$) are the same. Then, based on the spectral techniques, an analytical formula for effective resistances $R_{αβ^{(m)}}$ such that $L^{-1}_{αα}=L^{-1}_{ββ}$ (those nodes $α$, $β$ of the network such that the network is symmetric with respect to them) is given in terms of the first and second orthogonal polynomials associated with the network, where $L^{-1}$ is the pseudo-inverse of the Laplacian of the network. From the fact that in distance-regular networks, $L^{-1}_{αα}=L^{-1}_{ββ}$ is satisfied for all nodes $α,β$ of the network, the effective resistances $R_{αβ^{(m)}}$ for $m=1,2,...,d$ ($d$ is diameter of the network which is the same as the number of strata) are calculated directly, by using the given formula.

cond-mat.stat-mech

Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity

Recently in \cite{jss1}, the authors have given a method for calculation of the effective resistance (resistance distance) on distance-regular networks, where the calculation was based on stratification introduced in \cite{js} and Stieltjes transform of the spectral distribution (Stieltjes function) associated with the network. Also, in Ref. \cite{jss1} it has been shown that the resistance distances between a node $α$ and all nodes $β$ belonging to the same stratum with respect to the $α$ ($R_{αβ^{(i)}}$, $β$ belonging to the $i$-th stratum with respect to the $α$) are the same. In this work, an algorithm for recursive calculation of the resistance distances in an arbitrary distance-regular resistor network is provided, where the derivation of the algorithm is based on the Bose-Mesner algebra, stratification of the network, spectral techniques and Christoffel-Darboux identity. It is shown that the effective resistance on a distance-regular network is an strictly increasing function of the shortest path distance defined on the network. In the other words, the two-point resistance $R_{αβ^{(m+1)}}$ is strictly larger than $R_{αβ^{(m)}}$. The link between the resistance distance and random walks on distance-regular networks is discussed, where the average commute time (CT) and its square root (called Euclidean commute time (ECT)) as a distance are related to the effective resistance. Finally, for some important examples of finite distance- regular networks, the resistance distances are calculated. {\bf Keywords: resistance distance, association scheme, stratification, distance-regular networks, Christoffel-Darboux identity} {\bf PACs Index: 01.55.+b, 02.10.Yn}

math.CO

Investigation of continuous-time quantum walks via spectral analysis and Laplace transform

Continuous-time quantum walk (CTQW) on a given graph is investigated by using the techniques of the spectral analysis and inverse Laplace transform of the Stieltjes function (Stieltjes transform of the spectral distribution) associated with the graph. It is shown that, the probability amplitude of observing the CTQW at a given site at time $t$ is related to the inverse Laplace transformation of the Stieltjes function, namely, one can calculate the probability amplitudes only by taking the inverse laplace transform of the function $iG_μ(is)$, where $G_μ(x)$ is the Stieltjes function of the graph. The preference of this procedure is that, there is no any need to know the spectrum of the graph

quant-ph

Calculating two-point resistances in distance-regular resistor networks

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 stratification introduced in \cite{js} and Stieltjes transform of the spectral distribution (Stieltjes function) associated with the network. It is shown that the resistances between a node $α$ and all nodes $β$ belonging to the same stratum with respect to the $α$ ($R_{αβ^{(i)}}$, $β$ belonging to the $i$-th stratum with respect to the $α$) are the same. Also, the analytical formulas for two-point resistances $R_{αβ^{(i)}}, i=1,2,3$ are given in terms of the the size of the network and corresponding intersection numbers. In particular, the two-point resistances in a strongly regular network are given in terms of the its parameters ($v,κ,λ,μ$). Moreover, the lower and upper bounds for two-point resistances in strongly regular networks are discussed. Keywords:two-point resistance, association scheme, distance-regular networks, Stieltjes function PACs Index: 01.55.+b, 02.10.Yn

cond-mat.stat-mech

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

The continuous-time quantum walk (CTQW) on root lattice $A_n$ (known as hexagonal lattice for $n=2$) and honeycomb one is investigated by using spectral distribution method. To this aim, some association schemes are constructed from abelian group $Z^{\otimes n}_m$ and two copies of finite hexagonal lattices, such that their underlying graphs tend to root lattice $A_n$ and honeycomb one, as the size of the underlying graphs grows to infinity. The CTQW on these underlying graphs is investigated by using the spectral distribution method and stratification of the graphs based on Terwilliger algebra, where we get the required results for root lattice $A_n$ and honeycomb one, from large enough underlying graphs. Moreover, by using the stationary phase method, the long time behavior of CTQW on infinite graphs is approximated with finite ones. Also it is shown that the Bose-Mesner algebras of our constructed association schemes (called $n$-variable $P$-polynomial) can be generated by $n$ commuting generators, where raising, flat and lowering operators (as elements of Terwilliger algebra) are associated with each generator. A system of $n$-variable orthogonal polynomials which are special cases of \textit{generalized} Gegenbauer polynomials is constructed, where the probability amplitudes are given by integrals over these polynomials or their linear combinations. Finally the suppersymmetric structure of finite honeycomb lattices is revealed. Keywords: underlying graphs of association schemes, continuous-time quantum walk, orthogonal polynomials, spectral distribution. PACs Index: 03.65.Ud

math-ph