Qubit state transfer via discrete-time quantum walks

Yalçınkaya, I.; Gedik, Zafer

doi:10.1088/1751-8113/48/22/225302

Cited by 35 publications

(45 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By discrete-time quantum walk search algorithm, M. Stefaňàk et al discussed state transfer on star graphs and complete bipartite graphs [24]. Yalcinkaya et al [25] designed qubit state transfer with discrete-time quantum walk on a N -circle and N -line by adding some recovery operator to the whole system. However, for the N -circle protocol, N should be even number, and the transferred state can only be transmitted to the opposite site on the circle.…”

Section: Introductionmentioning

confidence: 99%

Quantum communication protocols by quantum walks with two coins

Shang

Wang

et al. 2019

EPL

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

Quantum communication protocols by quantum walks with two coins

Shang

Wang

et al. 2019

EPL

View full text Add to dashboard Cite

show abstract

“…A state transfer is required in such quantum algorithms. It is, however, difficult to control the state transfer because the quantum walk is inherently random [5,9,16,17]. One of the propositions to solve this problem is a coin that has a part in determining the movement of the quantum walk.…”

Section: Introductionmentioning

confidence: 99%

Theoretical Studies on Quantum Walks with a Time-varying Coin

Katayama

Hatakenaka

Fujii

2020

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically time-varying coin both numerically and analytically, in order to explore the controllability of quantum walks while preserving its random nature. Quantum walk with a time-varying coinLet us consider a quantum walk with a time-varying coin on a line. In random walks, the walker moves one step to right or left depending on the outcome of the coin toss. A quantum walk is a quantummechanical counterpart of the classical random walk. Then, a quantum walk lives in a bipartite system comprising positions and coin degrees of freedom represented as an entire Hilbert space H = H p ⊗ H c ,

show abstract

“…Barr et al [6] investigated discrete quantum walks on variants of cycles, and found some families such as K 2 + C n that admit perfect state transfer with appropriately chosen coins and initial states. In [34], Yalcnkaya and Gedik proposed a scheme to achieve perfect state transfer on paths and cycles using a recovery operator. With various setting of coin flippings, Zhan et al [36] also showed that an arbitrary unknown two-qubit state can be perfectly transfered in one-dimensional or two-dimensional lattices.…”

Section: Introductionmentioning

confidence: 99%