Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0805.1866

Perfect transfer of m-qubit GHZ states

M. A. Jafarizadeh, Rahime Sufiani, Seyed Farid Taghavi, Ehsan Barati

Published May 13, 2008• 1 citation
arXivHTMLPDF

Abstract

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

DOI
10.48550/arxiv.0805.1866

Related papers

Optimal transfer of ad-level quantum state over pseudo-distance-regular networks

M. A. Jafarizadeh, Rahime Sufiani, Seyed Farid Taghavi +1 more

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

arXiv:0803.2334•Journal of Physics A Mathematical and Theoretical•Oct 20, 2008•18 citations

Perfect state transfer over distance-regular spin networks

M. A. Jafarizadeh, Rahime Sufiani

Christandl et al. have noted that the $d$-dimensional hypercube can be projected to a linear chain with $d+1$ sites so that, by considering fixed but different couplings between the qubits assigned to the sites, the perfect state transfer (PST) can be achieved over arbitrarily long distances in the chain [Phys. Rev. Lett. 92, 187902 (2004); Phys. Rev. A 71, 032312 (2005)]. In this work we consider distance-regular graphs as spin networks and note that any such network (not just the hypercube) can be projected to a linear chain and so can allow PST over long distances. We consider some particular spin Hamiltonians which are the extended version of those of Christandl et al. Then, by using techniques such as stratification of distance-regular graphs and spectral analysis methods, we give a procedure for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site will evolve freely to the opposite site without any dynamical control, i.e., we show how to derive the parameters of the system so that PST can be achieved. It is seen that PST is only allowed in distance-regular spin networks for which, starting from an arbitrary vertex as reference vertex (prepared in the initial state which we wish to transfer), the last stratum of the networks with respect to the reference state contains only one vertex; i.e., stratification of these networks plays an important role which determines in which kinds of networks and between which vertices of them, PST can be allowed. As examples, the cycle network with even number of vertices and $d$-dimensional hypercube are considered in details and the method is applied for some important distance-regular networks.

arXiv:0709.0755•Physical Review A•Feb 13, 2008•44 citations

Generating a GHZ state in 2m-qubit spin network

M. A. Jafarizadeh, Rahime Sufiani, Seyed Farid Taghavi +3 more

We consider a pure 2 m -qubit initial state to evolve under a particular quantum mechanical spin Hamiltonian, which can be written in terms of the adjacency matrix of the Johnson network J (2 m , m ). Then, by using some techniques such as spectral distribution and stratification associated with the graphs employed in Jafarizadeh and Sufiani (2008 Phys. Rev. A 77 022315), a maximally entangled GHZ state is generated between the antipodes of the network. In fact, an algorithm is given for determining 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 entanglement of the final evolved state is calculated, and finally two examples of four-qubit and six-qubit states are considered in detail.

arXiv:1101.6040•Journal of Statistical Mechanics Theory and Experiment•May 12, 2011•3 citations

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

M. A. Jafarizadeh, Rahime Sufiani, Seyed Farid Taghavi +1 more

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.

arXiv:0901.4504•Journal of Statistical Mechanics Theory and Experiment•Apr 6, 2009•5 citations

Quantum pure state transfer

Hermie Monterde

Quantum spin systems carry information in the form of quantum states, and the propagation of these quantum states is described by a quantum walk. In order to construct an operational quantum computer, the task of reliably transmitting quantum states from one part of a quantum computer to another must be accomplished. Quantum walks are known to be powerful tools in achieving this task. Pure states are quantum states represented by unit complex vectors. In this thesis, we use algebraic and combinatorial techniques to develop the theory of perfect state transfer on pure states in quantum walks, with emphasis on the adjacency and Laplacian matrices as Hamiltonians of a graph representing a spin network. We prove basic results about eigenvalue supports, periodicity, and strong cospectrality on pure states. We investigate a special type of strong cospectrality called m-strong cospectrality, and show that m-strongly cospectral pure states admit desirable quantum state transfer properties. Several characterisations of perfect state transfer are also given, one for general pure states, one for m-strongly pure states, and another one for real pure states. These characterisations give rise to algebraic and analytic properties of pure states admitting perfect state transfer. Moreover, we determine all complete graphs, complete bipartite graphs, cycles, and paths that admit perfect state transfer between m-strongly pure states. Constructions of infinite families of graphs admitting perfect state transfer are also given. We also characterise perfect state transfer between vertex states in joins and blowup graphs. We determine when the join operation preserves or induces perfect state transfer in the resulting graph. We also use blow-up graphs to construct new families of regular graphs with perfect state transfer. We use these two graph operations to demonstrate that graphs with perfect state transfer can be constructed from graphs that do not exhibit such a property. Finally, we investigate perfect state transfer on s-pair states – pure states that represent entanglement between two vertices. We establish combinatorial and spectral properties of s-pair states with perfect state transfer, and characterise its existence in complete graphs, complete bipartite graphs, paths and distance-regular graphs. Further, we construct infinite families of graphs with s-pair state transfer.

•Aug 14, 2025•0 citations

Perfect state transfer in Grover walks on association schemes and distance-regular graphs

Koushik Bhakta, Bikash Bhattacharjya

This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association scheme. Our focus includes specific association schemes, namely the Hamming and Johnson schemes. We characterize all graphs on the classes of Hamming and Johnson schemes that exhibit perfect state transfer. Furthermore, we study perfect state transfer on distance-regular graphs. We provide complete characterizations for exhibiting perfect state transfer on distance-regular graphs of diameter $2$ and diameter $3$, as well as integral distance-regular graphs.

arXiv:2506.07439•Jun 9, 2025•3 citations
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 ddd-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
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 ddd-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, ddd-level quantum state, Stratification, Pseudo-distance-regular network PACs Index: 01.55.+b, 02.10.Yn
Christandl et al. have noted that the ddd-dimensional hypercube can be projected to a linear chain with d+1d+1d+1 sites so that, by considering fixed but different couplings between the qubits assigned to the sites, the perfect state transfer (PST) can be achieved over arbitrarily long distances in the chain [Phys. Rev. Lett. 92, 187902 (2004); Phys. Rev. A 71, 032312 (2005)]. In this work we consider distance-regular graphs as spin networks and note that any such network (not just the hypercube) can be projected to a linear chain and so can allow PST over long distances. We consider some particular spin Hamiltonians which are the extended version of those of Christandl et al. Then, by using techniques such as stratification of distance-regular graphs and spectral analysis methods, we give a procedure for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site will evolve freely to the opposite site without any dynamical control, i.e., we show how to derive the parameters of the system so that PST can be achieved. It is seen that PST is only allowed in distance-regular spin networks for which, starting from an arbitrary vertex as reference vertex (prepared in the initial state which we wish to transfer), the last stratum of the networks with respect to the reference state contains only one vertex; i.e., stratification of these networks plays an important role which determines in which kinds of networks and between which vertices of them, PST can be allowed. As examples, the cycle network with even number of vertices and ddd-dimensional hypercube are considered in details and the method is applied for some important distance-regular networks.
We consider a pure 2 m -qubit initial state to evolve under a particular quantum mechanical spin Hamiltonian, which can be written in terms of the adjacency matrix of the Johnson network J (2 m , m ). Then, by using some techniques such as spectral distribution and stratification associated with the graphs employed in Jafarizadeh and Sufiani (2008 Phys. Rev. A 77 022315), a maximally entangled GHZ state is generated between the antipodes of the network. In fact, an algorithm is given for determining 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 entanglement of the final evolved state is calculated, and finally two examples of four-qubit and six-qubit states are considered in detail.
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 Z2nZ_2^nZ2n​. In Refs. \cite{PST,psd}, respectively, PST of a qubit over distance regular spin networks and optimal state transfer (ST) of a ddd-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 D2nD_{2n}D2n​ with even nnn, the Clifford group CL(n) and all of the ppp-groups can be achieved.
Quantum spin systems carry information in the form of quantum states, and the propagation of these quantum states is described by a quantum walk. In order to construct an operational quantum computer, the task of reliably transmitting quantum states from one part of a quantum computer to another must be accomplished. Quantum walks are known to be powerful tools in achieving this task. Pure states are quantum states represented by unit complex vectors. In this thesis, we use algebraic and combinatorial techniques to develop the theory of perfect state transfer on pure states in quantum walks, with emphasis on the adjacency and Laplacian matrices as Hamiltonians of a graph representing a spin network. We prove basic results about eigenvalue supports, periodicity, and strong cospectrality on pure states. We investigate a special type of strong cospectrality called m-strong cospectrality, and show that m-strongly cospectral pure states admit desirable quantum state transfer properties. Several characterisations of perfect state transfer are also given, one for general pure states, one for m-strongly pure states, and another one for real pure states. These characterisations give rise to algebraic and analytic properties of pure states admitting perfect state transfer. Moreover, we determine all complete graphs, complete bipartite graphs, cycles, and paths that admit perfect state transfer between m-strongly pure states. Constructions of infinite families of graphs admitting perfect state transfer are also given. We also characterise perfect state transfer between vertex states in joins and blowup graphs. We determine when the join operation preserves or induces perfect state transfer in the resulting graph. We also use blow-up graphs to construct new families of regular graphs with perfect state transfer. We use these two graph operations to demonstrate that graphs with perfect state transfer can be constructed from graphs that do not exhibit such a property. Finally, we investigate perfect state transfer on s-pair states – pure states that represent entanglement between two vertices. We establish combinatorial and spectral properties of s-pair states with perfect state transfer, and characterise its existence in complete graphs, complete bipartite graphs, paths and distance-regular graphs. Further, we construct infinite families of graphs with s-pair state transfer.
This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association scheme. Our focus includes specific association schemes, namely the Hamming and Johnson schemes. We characterize all graphs on the classes of Hamming and Johnson schemes that exhibit perfect state transfer. Furthermore, we study perfect state transfer on distance-regular graphs. We provide complete characterizations for exhibiting perfect state transfer on distance-regular graphs of diameter 222 and diameter 333, as well as integral distance-regular graphs.