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:1909.03617 · Quantum Science and Technology

Experimental realization of state transfer by quantum walks with two coins

Yun Shang, Meng Li

Published Dec 9, 2019• 14 citations
arXivHTMLPDF

Abstract

Abstract Quantum state transfer is an important task for scalable quantum complex networks. By selecting quantum walks with two coins as the basic model and two coin spaces as the communication carriers, we successfully implement some perfect state transfer tasks on various graphs (Shang et al 2019 Europhys. Lett. 124 60009). Here, we provide the first experimental realization of this scheme by IBM Quantum Experience platform. Especially, we demonstrate the transfer of Bell state, GHZ state and W state on complete graph through this quantum apparatus. Furthermore, we notice that our protocols have high fidelity by performing quantum state tomography.

DOI
10.1088/2058-9565/ab6025

Related papers

Quantum communication protocols by quantum walks with two coins

Yun Shang, Wang, Yu, Li, Meng +1 more

We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the information on coin 1 state at target position only by at most two times of flipping operation. Based on quantum walks with two coins either on the line or on the $N$-circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins either on complete graphs or regular graphs, we can first implement perfect qudit state transfer by quantum walks. Compared with existing schemes driven by one coin, more general graph structures can be used to perfectly transfer more general state. Moreover, the external control of coin operator during the transmitting process can be decreased greatly. Selecting coin 1 as the sender and coin 2 as the receiver, we also study how to realize generalized teleportation over long steps of walks by the above quantum walk models. Because quantum walks is an universal quantum computation model, our schemes may provide an universal platform for the design of quantum network and quantum computer.

arXiv:1802.02400•Feb 7, 2018•3 citations

Entangled state generation via quantum walks with multiple coins

Meng Li, Yun Shang

Abstract Generation of entangled state is of paramount importance both from quantum theoretical foundation and technology applications. Entanglement swapping provides an efficient method to generate entanglement in quantum communication protocols. However, perfect Bell measurements for qudits, the key to entanglement swapping, have been proven impossible to achieve by using only linear elements and particle detectors. To avoid this bottleneck, we propose a scheme to generate entangled state including two-qubit entangled state, two-qudit entangled state, three-qubit GHZ state and three-qudit GHZ state between several designate parties via the model of quantum walks with multiple coins. Then we conduct experimental realization of Bell state and three-qubit GHZ state between several designate parties on IBM quantum platform and the result has high fidelity by performing quantum tomography. In the end, we give a practical application of our scheme in multiparty quantum secret sharing.

npj Quantum Information•May 7, 2021•13 citations

Quantum communication protocols by quantum walks with two coins

Yun Shang, Yu Wang, Meng Li +1 more

We introduce some new perfect state transfer and generalized long-distance teleportation schemes by quantum walks with two coins. By encoding the transferred information in the coin-1 state and alternately using two coin operators, we can perfectly recover the information in the coin-1 state at the target position by at most two flipping operations. On the basis of quantum walks with two coins on either a line or an N -circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins on regular graphs, we can first implement a perfect qudit state transfer by quantum walks. Compared with existing schemes driven by one coin, more general graph structures can be used to perfectly transfer a more general state. We also study how to realize generalized teleportation over long-distance walks by the above quantum walk models.

Europhysics Letters (EPL)•Jan 10, 2019•51 citations

Entangled state generation via quantum walks with multiple coins

Meng Li, Yun Shang

Generation of entangled state is of paramount importance both from quantum theoretical foundation and technology applications. Entanglement swapping provides an efficient method to generate entanglement in quantum communication protocols. However, perfect Bell measurements for qudits, the key to entanglement swapping, have been proven impossible to achieve by using only linear elements and particle detectors. To avoid this bottleneck, we propose a novel scheme to generate entangled state including two-qubit entangled state, two-qudit entangled state, three-qubit GHZ state and three-qudit GHZ state between several designate parties via the model of quantum walks with multiple coins. Then we conduct experimental realization of Bell state and three-qubit GHZ state between several designate parties on IBM quantum platform and the result has high fidelity by preforming quantum tomography. In the end, we give a practical application of our scheme in multiparty quantum secret sharing.

arXiv:2011.01643•Nov 3, 2020•1 citation

Perfect state transfer by means of discrete-time quantum walk on the complete bipartite graph

J.S.T. Huang, Dan Li, Panlong Li +2 more

Abstract Perfect state transfer has attracted a great deal of attention recently due to its crucial role in quantum communication and scalable quantum computation. In this paper, we propose the perfect state transfer algorithms with a pair of sender-receiver and two pairs of sender-receiver on the complete bipartite graph respectively. The algorithm with a pair of sender-receiver is implemented through discrete-time quantum walk, flexibly setting the coin operators based on the positions of the sender and receiver. The algorithm with two pairs of sender-receiver ensures that the two quantum states are distributed on both sides of the complete bipartite graph during the process, thereby achieving perfect state transfer. In addition, the quantum circuits corresponding to the algorithms are provided. The algorithms can transfer an arbitrary quantum state and can simultaneously transfer two arbitrary quantum states from the senders to the receivers in any case. Moreover, the algorithms are not only applicable to complete bipartite graphs but also to more graph structures with complete bipartite subgraphs, which will provide potential applications for quantum information processing.

Physica Scripta•Dec 7, 2023•1 citation

Quantum state transfer on the complete bipartite graph

Raqueline A. M. Santos

Abstract Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the graph and when the sender and receiver are in opposite partitions of the same size. By changing the coin operator, we analyze the state transfer problem and we show that it is still possible to achieve state transfer with high fidelity even when the sender and receiver are in different partitions with different sizes. Moreover, it is also possible to use an active switch approach using lackadaisical quantum walks where the marked vertex is switched between the sender and receiver during the algorithm.

arXiv:2111.13197•Journal of Physics A Mathematical and Theoretical•Feb 4, 2022•8 citations
Abstract Quantum state transfer is an important task for scalable quantum complex networks. By selecting quantum walks with two coins as the basic model and two coin spaces as the communication carriers, we successfully implement some perfect state transfer tasks on various graphs (Shang et al 2019 Europhys. Lett. 124 60009). Here, we provide the first experimental realization of this scheme by IBM Quantum Experience platform. Especially, we demonstrate the transfer of Bell state, GHZ state and W state on complete graph through this quantum apparatus. Furthermore, we notice that our protocols have high fidelity by performing quantum state tomography.
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the information on coin 1 state at target position only by at most two times of flipping operation. Based on quantum walks with two coins either on the line or on the NNN-circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins either on complete graphs or regular graphs, we can first implement perfect qudit state transfer by quantum walks. Compared with existing schemes driven by one coin, more general graph structures can be used to perfectly transfer more general state. Moreover, the external control of coin operator during the transmitting process can be decreased greatly. Selecting coin 1 as the sender and coin 2 as the receiver, we also study how to realize generalized teleportation over long steps of walks by the above quantum walk models. Because quantum walks is an universal quantum computation model, our schemes may provide an universal platform for the design of quantum network and quantum computer.
Abstract Generation of entangled state is of paramount importance both from quantum theoretical foundation and technology applications. Entanglement swapping provides an efficient method to generate entanglement in quantum communication protocols. However, perfect Bell measurements for qudits, the key to entanglement swapping, have been proven impossible to achieve by using only linear elements and particle detectors. To avoid this bottleneck, we propose a scheme to generate entangled state including two-qubit entangled state, two-qudit entangled state, three-qubit GHZ state and three-qudit GHZ state between several designate parties via the model of quantum walks with multiple coins. Then we conduct experimental realization of Bell state and three-qubit GHZ state between several designate parties on IBM quantum platform and the result has high fidelity by performing quantum tomography. In the end, we give a practical application of our scheme in multiparty quantum secret sharing.
We introduce some new perfect state transfer and generalized long-distance teleportation schemes by quantum walks with two coins. By encoding the transferred information in the coin-1 state and alternately using two coin operators, we can perfectly recover the information in the coin-1 state at the target position by at most two flipping operations. On the basis of quantum walks with two coins on either a line or an N -circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins on regular graphs, we can first implement a perfect qudit state transfer by quantum walks. Compared with existing schemes driven by one coin, more general graph structures can be used to perfectly transfer a more general state. We also study how to realize generalized teleportation over long-distance walks by the above quantum walk models.
Generation of entangled state is of paramount importance both from quantum theoretical foundation and technology applications. Entanglement swapping provides an efficient method to generate entanglement in quantum communication protocols. However, perfect Bell measurements for qudits, the key to entanglement swapping, have been proven impossible to achieve by using only linear elements and particle detectors. To avoid this bottleneck, we propose a novel scheme to generate entangled state including two-qubit entangled state, two-qudit entangled state, three-qubit GHZ state and three-qudit GHZ state between several designate parties via the model of quantum walks with multiple coins. Then we conduct experimental realization of Bell state and three-qubit GHZ state between several designate parties on IBM quantum platform and the result has high fidelity by preforming quantum tomography. In the end, we give a practical application of our scheme in multiparty quantum secret sharing.
Abstract Perfect state transfer has attracted a great deal of attention recently due to its crucial role in quantum communication and scalable quantum computation. In this paper, we propose the perfect state transfer algorithms with a pair of sender-receiver and two pairs of sender-receiver on the complete bipartite graph respectively. The algorithm with a pair of sender-receiver is implemented through discrete-time quantum walk, flexibly setting the coin operators based on the positions of the sender and receiver. The algorithm with two pairs of sender-receiver ensures that the two quantum states are distributed on both sides of the complete bipartite graph during the process, thereby achieving perfect state transfer. In addition, the quantum circuits corresponding to the algorithms are provided. The algorithms can transfer an arbitrary quantum state and can simultaneously transfer two arbitrary quantum states from the senders to the receivers in any case. Moreover, the algorithms are not only applicable to complete bipartite graphs but also to more graph structures with complete bipartite subgraphs, which will provide potential applications for quantum information processing.
Abstract Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the graph and when the sender and receiver are in opposite partitions of the same size. By changing the coin operator, we analyze the state transfer problem and we show that it is still possible to achieve state transfer with high fidelity even when the sender and receiver are in different partitions with different sizes. Moreover, it is also possible to use an active switch approach using lackadaisical quantum walks where the marked vertex is switched between the sender and receiver during the algorithm.