Superdense Coding, Teleportation Algorithms, and Bell's Inequality Test in Qiskit and IBM Circuit Composer

作     者：Kocak, Yasemin Poyraz Sevgen, Selcuk 

作者机构：Istanbul Univ Cerrahpasa Dept Comp Programming Istanbul Turkey Istanbul Univ Cerrahpasa Dept Comp Engn Istanbul Turkey 

出 版 物：《ELECTRICA》 (Electrica)

年 卷 期：2022年第22卷第2期

页      面：120-131页

核心收录：

主　　题：Superdense coding quantum teleportation Bell's inequality 

摘      要：Quantum teleportation is a technique of sending information from one place to another place. Distance between two points can be hundreds of thousands of light-years. For quantum teleportation, there is no need for a channel between two points when sending a state vector from one place to another. Since classical information sharing is possible, it is also possible to send a state vector from one place to another place. Teleportation is the transfer of a quantum state from one place to another through classical channels. Superdense coding, a dual to teleportation, uses a single quantum bit to transmit two bits classical information. Superdense coding uses a qubit to transfer two classical bits, while teleportation performs one qubit transfer using two classical bits. In this article, teleportation, superdense coding algorithms, and the Bell s inequality test in which Bell s inequality is violated with quantum mechanics are performed on both Qiskit and International Business Machines circuit composer, and results are compared and presented in detail. The results revealed that whether a faster-than-light signal transfer is possible using quantum mechanics depends on whether a copy of the quantum state is created or not. Finally, Bell s inequality created by classical logic violated by quantum mechanics is shown by experimental results.