A new kind of flexible quantum teleportation of an arbitrary multi-qubit state by multi-walker quantum walks

Li, Heng-Ji; Chen, Xiu-Bo; Wang, Yalan; Hou, Yuexian; Li, Jian

doi:10.1007/s11128-019-2374-7

Cited by 17 publications

(10 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Protocol execution is performed by the operators defined in (22) and (21) as specified in the previous section, although the operators K v are now defined to generate entanglement in the nodes as the walker passes by. Let q vj0 and q vj1 denote the pair of qubits inside node v ∈ p j \ {A, B} that need to be entangled together by walker j.…”

Section: A Multi-path Entanglement Distribution With Bsmsmentioning

confidence: 99%

“…The goal of this article is to propose a control protocol for distributed quantum computing based on discrete time quantum walks [15]. Quantum walks are universal for quantum computing [16]- [18] and have been successfully employed in the quantum network scenario to perform perfect state transfer (PST) between network nodes [19], [20], teleportation [21], [22] and quantum key distribution (QKD) [23]. Previous works describe ways of distributing entanglement be-tween nodes on a quantum network using the coin space of the walker to propel entanglement generation between qubits [20], [21].…”

Section: Introductionmentioning

confidence: 99%

“…Quantum walks are universal for quantum computing [16]- [18] and have been successfully employed in the quantum network scenario to perform perfect state transfer (PST) between network nodes [19], [20], teleportation [21], [22] and quantum key distribution (QKD) [23]. Previous works describe ways of distributing entanglement be-tween nodes on a quantum network using the coin space of the walker to propel entanglement generation between qubits [20], [21]. In addition, the formalism of quantum walks with multiple coins enabled the description of an entanglement routing protocol, which interprets qubits within a network node as vertices of an abstract graph used by a quantum walker to generate entanglement [24].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A quantum walk control plane for distributed quantum computing in quantum networks

Andrade¹,

Dai²,

Guha³

et al. 2021

Preprint

View full text Add to dashboard Cite

Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum computation among quantum computers. In this work, we describe a quantum walk protocol to perform distributed quantum computing in a quantum network. The protocol uses a quantum walk as a quantum control signal to perform distributed quantum operations. We consider a generalization of the discrete-time coined quantum walk model that accounts for the interaction between a quantum walker system in the network graph with quantum registers inside the network nodes. The protocol logically captures distributed quantum computing, abstracting hardware implementation and the transmission of quantum information through channels. Control signal transmission is mapped to the propagation of the walker system across the network, while interactions between the control layer and the quantum registers are embedded into the application of coin operators. We demonstrate how to use the quantum walker system to perform a distributed CNOT operation, which shows the universality of the protocol for distributed quantum computing. Furthermore, we apply the protocol to the task of entanglement distribution in a quantum network.

show abstract

Section: A Multi-path Entanglement Distribution With Bsmsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A quantum walk control plane for distributed quantum computing in quantum networks

Andrade¹,

Dai²,

Guha³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Step 1.1. As we know, QKD can realize reliable transfers of classical and quantum states over long distances [43], [44]. The verifier Bob would discover the counterfeiting of the plain text in Step 5.6 if the condition |P 0 = |P 0 is not met in this attack.…”

Section: ) External Attackersmentioning

confidence: 99%

Sequential Quantum Multiparty Signature Based on Quantum Fourier Transform and Chaotic System

et al. 2020

Self Cite

View full text Add to dashboard Cite

Motivated by the quantum Fourier transform (QFT), a sequential quantum multiparty signature (QMS) scheme is proposed. Several signatories jointly accomplish the task in a chaotic encryption system. Alice generates and sends the encrypted message with the quantum Fourier transform. Signatories provide individual signatures in a certain order, while Bob verifies the authenticity of the combined multiple signatures after the eavesdropping check phase with help of the arbitrator. Analysis shows the correctness and security of the proposed scheme. This QMS protocol increases the efficiency of verification compared to arbitrated quantum signatures and broadcasting multiparty signature. This QMS protocol will be widely used for online e-government and e-business systems.

show abstract

“…Here, we focus on coined QWs. Different classes of coined QWs have been explored in the past decades, such as QWs with many coins [14][15][16][17][18][19][20][21][22][23][24][25][26], multiple walkers [27][28][29][30][31][32][33][34][35][36][37][38][39], and nonhomogeneous coin operators [40][41][42][43][44][45][46][47][48][49][50][51]. Very recently, coined QWs have found several applications ranging from quantum computation [37,52,53] to quantum information [18-26, 36, 38, 39, 48-50, 54].…”

Section: Introductionmentioning

confidence: 99%

Generalized quantum teleportation of shared quantum secret with quantum walks

Li¹,

Li²,

Chen³

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Very recently, Lee et al. proposed the first secure quantum teleporation protocol, where quantum information shared by an arbitrary number of senders can be transferred to another arbitrary number of receivers. Here, by introducing quantum walks, a novel secure (n, m) quantum teleportation of shared quantum secret between n senders and m receivers is presented. Firstly, two kinds of (n, 2) teleportation schemes are proposed by n-walker quantum walks on the line, the first walker of which is driven by three coins, respectively, based on two kinds of coin operators: the homogeneous coins and the position-dependent coins. Secondly, by increasing the amount of the coins of the first walker to m + 1, the previous (n, 2) scheme can be generalized to (n, m) teleportation scheme. Then, we give the proof of the information security of our proposed scheme, in which neither any single nor subparties of senders and receivers can fully access the secret quantum information. Moreover, the projective measurements are needed, instead of the joint Bell measurements that are necessary in Lee et al.'s protocol. Our work can also be extended further to QWs on the cycle. This work provides an additional relevant instance of the richness of quantum walks for quantum information processing tasks and thus opens the wider application purpose of quantum walks.

show abstract

A new kind of flexible quantum teleportation of an arbitrary multi-qubit state by multi-walker quantum walks

Cited by 17 publications

References 54 publications

A quantum walk control plane for distributed quantum computing in quantum networks

A quantum walk control plane for distributed quantum computing in quantum networks

Sequential Quantum Multiparty Signature Based on Quantum Fourier Transform and Chaotic System

Generalized quantum teleportation of shared quantum secret with quantum walks

Contact Info

Product

Resources

About