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:1302.0366 · Communications in computer and information science

Transfers of Entangled Qudit States in Quantum Networks

Marek Sawerwain, Joanna Wiśniewska

Published Jan 1, 2013• 0 citations
arXivHTMLPDF
DOI
10.1007/978-3-642-38865-1_35

Related papers

Transfer of Quantum Continuous Variable and Qudit States in Quantum Networks

Marek Sawerwain, Roman Gielerak

Communications in computer and information science•Jan 1, 2012•3 citations

Multi‐hop joint remote state preparation of general hybrid entangled multi‐qudit states via distinct Einstein‐Podolsky‐Rosen channels

Zongyi Li, Yuzhen Wei, Min Jiang

Abstract Joint Remote State Preparation provides a useful way to securely transfer the known quantum states to the distant nodes. However, the limitation of resources often leads to the quantum channels constructed by distributed entangled pairs being incompatible with the transmitted states. In order to overcome this problem, a novel Joint Remote State Preparation protocol was proposed for transmitting general multi‐qudit states over quantum networks, providing a promising pathway to utilise the available Einstein‐Podolsky‐Rosen (EPR) channels with different levels. Several scenarios under noisy environments were discussed and some properties of the fidelity when transmitting the multi‐qudit state were demonstrated. It was demonstrated that both the prepared state and the kind of the noises could restrict the number of the participant nodes. Our scheme leverages the existing quantum resources, which addresses the issue of insufficient entanglement resources. This approach is easily adaptable to other quantum network structures, offering a potential solution for constructing a universal quantum network.

IET Quantum Communication•Jan 27, 2024•1 citation

Quantum Networks and Multi-Particle Entanglement

H. J. Briegel, S. J. van Enk, J. I. Cirac +9 more

Springer eBooks•Jan 1, 2000•4 citations

Multi‐hop teleportation of arbitrary multi‐qudit states based on d ‐level GHZ channels

Yi Ding, Min Jiang

Abstract The combination of quantum communication technology and wireless networks brings a flexible and secure communication method that adapts to a more complex and open network environment. A new multi‐hop teleportation scheme is investigated for transferring arbitrary unknown multi‐qudit states between two distant parties. Based on a more general quantum routing protocol, intermediate nodes are introduced and linked with each other via d ‐level entangled Greenberger‐Horne‐Zeilinger states as quantum channels. In this multi‐hop teleportation protocol, the source node and all the intermediate nodes can perform the entanglement measurement and transmit the measurement results simultaneously, thus reducing the time consumption largely. Furthermore, a general matrix formula is derived between the measurement results and the receiver's state, which enables the receiver to restore the unknown state efficiently. Compared with previous multi‐hop teleportation protocols, the teleportation protocol of arbitrary unknown multi‐qudit states of the authors can transfer more information, and it demonstrates lower computational complexity and higher flexibility.

IET Quantum Communication•Jan 27, 2023•3 citations

Extended entanglement to quantum networks

Sami Ul Haq, Farhan Saif

Optik•Aug 13, 2013•5 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
Abstract Joint Remote State Preparation provides a useful way to securely transfer the known quantum states to the distant nodes. However, the limitation of resources often leads to the quantum channels constructed by distributed entangled pairs being incompatible with the transmitted states. In order to overcome this problem, a novel Joint Remote State Preparation protocol was proposed for transmitting general multi‐qudit states over quantum networks, providing a promising pathway to utilise the available Einstein‐Podolsky‐Rosen (EPR) channels with different levels. Several scenarios under noisy environments were discussed and some properties of the fidelity when transmitting the multi‐qudit state were demonstrated. It was demonstrated that both the prepared state and the kind of the noises could restrict the number of the participant nodes. Our scheme leverages the existing quantum resources, which addresses the issue of insufficient entanglement resources. This approach is easily adaptable to other quantum network structures, offering a potential solution for constructing a universal quantum network.
Abstract The combination of quantum communication technology and wireless networks brings a flexible and secure communication method that adapts to a more complex and open network environment. A new multi‐hop teleportation scheme is investigated for transferring arbitrary unknown multi‐qudit states between two distant parties. Based on a more general quantum routing protocol, intermediate nodes are introduced and linked with each other via d ‐level entangled Greenberger‐Horne‐Zeilinger states as quantum channels. In this multi‐hop teleportation protocol, the source node and all the intermediate nodes can perform the entanglement measurement and transmit the measurement results simultaneously, thus reducing the time consumption largely. Furthermore, a general matrix formula is derived between the measurement results and the receiver's state, which enables the receiver to restore the unknown state efficiently. Compared with previous multi‐hop teleportation protocols, the teleportation protocol of arbitrary unknown multi‐qudit states of the authors can transfer more information, and it demonstrates lower computational complexity and higher flexibility.
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.