Modelling Quantum Networking with Teleportation

Nobuyuki Takei, Hidehiro Yonezawa, Takao Aoki +1 more

Ri‐Gui Zhou, Xiao-Xue Zhang, Lin-Tao Du

Ni-Ni Huang, Wei-Hao Huang, Che‐Ming Li

Quantum teleportation enables networking participants to move an unknown quantum state between the nodes of a quantum network, and hence constitutes an essential element in constructing large-sale quantum processors with a quantum modular architecture. Herein, we propose two protocols for teleporting qubits through an N-node quantum network in a highly-entangled box-cluster state or chain-type cluster state. The proposed protocols are systematically scalable to an arbitrary finite number N and applicable to arbitrary size of modules. The protocol based on a box-cluster state is implemented on a 14-qubit IBM quantum computer for N up to 12. To identify faithful networking teleportation, namely that the elements on real devices required for the networking teleportation process are all qualified for achieving teleportation task, we quantify quantum-mechanical processes using a generic classical-process model through which any classical strategies of mimicry of teleportation can be ruled out. From the viewpoint of achieving a genuinely quantum-mechanical process, the present work provides a novel toolbox consisting of the networking teleportation protocols and the criteria for identifying faithful teleportation for universal quantum computers with modular architectures and facilitates further improvements in the reliability of quantum-information processing.

Amit Kumar Pani, Swarnabha Kar, Siddhant Saha +3 more

Quantum teleportation is a fundamental protocol enabling the transfer of quantum states between remote nodes without physical transmission. As the Quantum Internet evolves, optimizing quantum teleportation becomes crucial due to entanglement degradation, resource constraints, and network efficiency. This paper proposes a game-theoretic framework for managing quantum teleportation by modeling quantum nodes as rational agents competing or cooperating to maximize teleportation fidelity and entanglement utility. We introduce cooperative and non-cooperative game models, analyze Nash equilibrium strategies for teleportation efficiency, and propose a Shapley-value-based entanglement allocation for fair resource distribution. Our system model incorporates graph-theoretic representations of quantum networks, utility functions, and incentive mechanisms to encourage efficient teleportation strategies. A Qiskit-based simulation evaluates teleportation fidelity and resource efficiency, comparing game-theoretic strategies with classical resource allocation methods. Our findings demonstrate that game-theoretic approaches significantly enhance teleportation efficiency, entanglement utilization, and robustness in a dynamic Quantum Internet environment.

Vikram Verma, Ravi Shankar Singh

Nikolai Lauk, Raju Valivarthi, Samantha I. Davis +16 more

We apply phase space methods to simulate time-bin qubit teleportation experiments at the Caltech Quantum Network (CQNET) and Fermilab Quantum Network (FQNET) [1]. Our model includes all experimentally relevant parameters and contributions from the multi-photon events.