Quantum communication scheme to teleport arbitrary quantum state via discrete time quantum walks

TL;DR

This paper presents a quantum communication protocol utilizing 2-step discrete time quantum walks with two coins on a graph, enabling teleportation of arbitrary quantum states by calculating the final state and recovery operators.

Contribution

It introduces a novel quantum teleportation scheme based on discrete time quantum walks on specific graph structures, advancing quantum communication methods.

Findings

Successfully calculates the final quantum state after the walk.

Develops recovery operators to reconstruct the initial state.

Provides a fundamental block for quantum teleportation on cycle and path graphs.

Abstract

In this article, we propose a quantum communication protocol via 2-step discrete time quantum walks with two coins on a graph of 10 vertices containing both cycles and paths. Quantum walks are known for their ability to integrate quantum mechanics dynamics like superposition and entanglement during the procedure. We calculate the total final quantum state of the system as well as the recovery operators to rescue the initial quantum state back at the receiver's location. Our work provides a fundamental block for a quantum teleportation scheme on a specific series of cycle and path graphs.