Quantum Walks Assisted Bidirectional Remote State Preparation
K. K. Naseeda, Jumana Muhammed Abdul Asharaf, N. C. Randeep

TL;DR
This paper introduces a quantum walk-based scheme for bidirectional remote state preparation that generates entanglement dynamically, eliminating the need for pre-shared entanglement, and compares controlled and uncontrolled implementations.
Contribution
It proposes a novel quantum walk approach for bidirectional remote state preparation that does not require pre-shared entanglement and analyzes controlled versus uncontrolled schemes.
Findings
Quantum walks can generate entanglement during remote state preparation.
The scheme works on systems with two and four vertices.
Controlled and uncontrolled schemes show consistent behavior.
Abstract
We present a scheme for bidirectional remote state preparation (BRSP) using quantum walks on two independent one-dimensional lattices and two independent cycles with two and four vertices, employing nearest-neighbor jumps with coin outcomes. The protocol is implemented in two distinct ways: one without the involvement of a controller and the other assisted by a controller . In this approach, the quantum walk dynamics generate entanglement during the remote state preparation process, thereby eliminating the need for any pre-shared initial entanglement between the communicating parties. Finally, we show that the bidirectional remote state preparation schemes based on quantum walks on a two-vertex and four-vertex system exhibit consistent behavior under the respective uncontrolled and controlled configurations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
