Mathematical problems of quantum teleportation
Yoshiharu Tanaka, Masanari Asano, Masanori Ohya
Abstract
Yoshiharu Tanaka, Masanari Asano, Masanori Ohya
Abstract
It has been considered that a maximal entangled state is needed for complete quantum teleportation. However, Kossakowski and Ohya proposed a scheme of complete teleportation for nonmaximal entangled state [1]. Basing on their scheme, we proposed a teleportation model of 2‐level state with a non‐maximal entangled state [2]. In the present study, we construct its expanded model, in which Alice can teleport m‐level state even if non‐maximal entangled state is used.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It has been considered that a maximal entangled state is needed for complete quantum teleportation. However, Kossakowski and Ohya proposed a scheme of complete teleportation for nonmaximal entangled state [1]. Basing on their scheme, we proposed a teleportation model of 2‐level state with a non‐maximal entangled state [2]. In the present study, we construct its expanded model, in which Alice can teleport m‐level state even if non‐maximal entangled state is used.
Key concepts: Quantum teleportation, Teleportation, Superdense coding, W state, No-teleportation theorem, Quantum channel, State (computer science), One-way quantum computer