Quantum Teleportation in Security


EOI: 10.11242/viva-tech.01.05.112

Download Full Text here



Citation

Ms.Shivani Sanjiv Shukla, Mr. Jayant Pramod Varma"Quantum Teleportation in Security", VIVA-IJRI Volume 1, Issue 5, Article 112, pp. 1-5, 2022. Published by Computer Engineering Department, VIVA Institute of Technology, Virar, India.

Abstract

As world is getting more and more faster day-by-day and craving for more fastest technology. So, this need for getting more faster technology can be fulfilled with the help of Quantum Computers. As our classical computers works on the 2-bit, i.e., 0’s and 1’s. But quantum computers work on the combination of the real numbers between 0 and 1, i.e., 0.0000000…….1 to 0.999999999…….999. Entanglement and superposition are a two different property that helps to find the solution of problem like encryption method, modelling of molecules and the numerical of a number such as factorisation of a number. Quantum teleportation is transfer of message without any medium . It transfers the message in form of energy variation . With help of Quantum teleportation, it is possible to transfer information without interruption of any noise in channel.

Keywords

Bloch-sphere , Entanglement ,Quantum Computers, Qubit, superposition.

References

  1. Henriet, Loic; Beguin, Lucas; Signoles, Adrien; Lahaye, Thierry; Browaeys, Antoine; Reymond, Georges-Olivier; Jurczak, Christophe (22 June 2020). "Quantum computing with neutral atoms". Quantum. 4: 327. arXiv:2006.12326. doi:10.22331/q-2020-09-21-327. S2CID 219966169.
  2. Henriet, Loic; Beguin, Lucas; Signoles, Adrien; Lahaye, Thierry; Browaeys, Antoine; Reymond, Georges-Olivier; Jurczak, Christophe (22 June 2020). "Quantum computing with neutral atoms". Quantum. 4: 327. arXiv:2006.12326. doi:10.22331/q-2020-09-21-327. S2CID 219966169.
  3. Dyakonov, Mikhail. "The Case Against Quantum Computing". IEEE Spectrum. Retrieved 3 December 2019.
  4. Dyakonov, Mikhail (24 March 2020). Will We Ever Have a Quantum Computer?. Springer. ISBN 9783030420185. Retrieved 22 May 2020.[page needed]
  5. Dyakonov, Mikhail (15 November 2018). "The Case Against Quantum Computing". IEEE Spectrum.
  6. Outeiral, Carlos; Strahm, Martin; Morris, Garrett; Benjamin, Simon; Deane, Charlotte; Shi, Jiye. "The prospects of quantum computing in computational molecular biology". Wiley Online Library. Retrieved 4 April 2021.
  7. Benedetti, Marcello; Realpe-Gómez, John; Biswas, Rupak; Perdomo-Ortiz, Alejandro (9 August 2016). "Estimation of effective temperatures in quantum annealers for sampling applications: A case study with possible applications in deep learning". Physical Review A. 94 (2): 022308. arXiv:1510.07611. Bibcode:2016PhRvA..94b2308B. doi:10.1103/PhysRevA.94.022308.
  8. Ajagekar, Akshay; You, Fengqi (5 December 2020). "Quantum computing assisted deep learning for fault detection and diagnosis in industrial process systems". Computers & Chemical Engineering. 143: 107119. arXiv:2003.00264. doi:10.1016/j.compchemeng.2020.107119. ISSN 0098-1354. S2CID 211678230.
  9. Preskill, John (6 August 2018). "Quantum Computing in the NISQ era and beyond". Quantum. 2: 79. doi:10.22331/q-2018-08-06-79. S2CID 44098998.
  10. Lenstra, Arjen K. (2000). "Integer Factoring" (PDF). Designs, Codes, and Cryptography. 19 (2/3): 101–128. doi:10.1023/A:1008397921377. S2CID 9816153. Archived from the original (PDF) on 10 April 2015.
  11. Brassard, Gilles; Høyer, Peter; Tapp, Alain (2016), "Quantum Algorithm for the Collision Problem", in Kao, Ming-Yang (ed.), Encyclopaedia of Algorithms, New York, NY: Springer, pp. 1662–1664, arXiv:quant-ph/9705002, doi:10.1007/978-1-4939-2864-4_304, ISBN 978-1-4939-2864-4, retrieved 6 December 2020
  12. Pakkin, Scott; Coles, Patrick (10 June 2019). "The Problem with Quantum Computers". Scientific American.
  13. Grumbling, Emily; Horowitz, Mark (eds.) The National Academies of Sciences, Engineering, and Medicine (2019).. Quantum Computing: Progress and Prospects (2018). Washington, DC: National Academies Press. p. I-5. doi:10.17226/25196. ISBN 978-0-309-47969-1. OCLC 1081001288.