A novel \(2\) \& \(3\) player scheme for Quantum Direct Communication

This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same novel method to embed the secret information in the entangle...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2024-12
Hauptverfasser: Andronikos, Theodore, Sirokofskich, Alla
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Andronikos, Theodore
Sirokofskich, Alla
description This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same novel method to embed the secret information in the entangled compound system. The way of encoding the information is the main novelty of this paper and the distinguishing feature compared to previous works in this field. The most critical advantage of this method is that it is easily scalable and extensible because it can be seamlessly generalized to a setting involving three, or even more, players, as demonstrated with the second protocol. This trait can be extremely beneficial when many spatially separated players posses only part the secret information that must be combined and transmitted to Alice, so that she can obtain the complete secret. Using the three player protocol, this task can be achieved in one go, without the need to apply a typical QSDC protocol twice, where Alice first receives Bob's information and afterwards Charlie's information. The proposed protocol doesn't require pre-shared keys or quantum signatures, making it less complicated and more straightforward. Finally, by employing only standard CNOT and Hadamard gates, it offers the important practical advantage of being implementable on contemporary quantum computers, especially in view of the coming era of quantum distributed computing.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2833810861</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2833810861</sourcerecordid><originalsourceid>FETCH-proquest_journals_28338108613</originalsourceid><addsrcrecordid>eNqNiksKwjAUAIMgWLR3eCCILgrpi63ZSq24FVwGSigptjRJzUfw9nbhAVzNwMyCJMhYnvEj4oqk3g-UUixPWBQsIfUZjH2rEcQexQHEbhY2yzTKj3Lg26fSCjrr4B6lCVHDpXeqDVBZraPpWxl6azZk2cnRq_THNdle60d1yyZnX1H50Aw2OjOnBjljPKe8zNl_1xcfpDid</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2833810861</pqid></control><display><type>article</type><title>A novel \(2\) \&amp; \(3\) player scheme for Quantum Direct Communication</title><source>Freely Accessible Journals</source><creator>Andronikos, Theodore ; Sirokofskich, Alla</creator><creatorcontrib>Andronikos, Theodore ; Sirokofskich, Alla</creatorcontrib><description>This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same novel method to embed the secret information in the entangled compound system. The way of encoding the information is the main novelty of this paper and the distinguishing feature compared to previous works in this field. The most critical advantage of this method is that it is easily scalable and extensible because it can be seamlessly generalized to a setting involving three, or even more, players, as demonstrated with the second protocol. This trait can be extremely beneficial when many spatially separated players posses only part the secret information that must be combined and transmitted to Alice, so that she can obtain the complete secret. Using the three player protocol, this task can be achieved in one go, without the need to apply a typical QSDC protocol twice, where Alice first receives Bob's information and afterwards Charlie's information. The proposed protocol doesn't require pre-shared keys or quantum signatures, making it less complicated and more straightforward. Finally, by employing only standard CNOT and Hadamard gates, it offers the important practical advantage of being implementable on contemporary quantum computers, especially in view of the coming era of quantum distributed computing.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Players ; Protocol</subject><ispartof>arXiv.org, 2024-12</ispartof><rights>2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Andronikos, Theodore</creatorcontrib><creatorcontrib>Sirokofskich, Alla</creatorcontrib><title>A novel \(2\) \&amp; \(3\) player scheme for Quantum Direct Communication</title><title>arXiv.org</title><description>This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same novel method to embed the secret information in the entangled compound system. The way of encoding the information is the main novelty of this paper and the distinguishing feature compared to previous works in this field. The most critical advantage of this method is that it is easily scalable and extensible because it can be seamlessly generalized to a setting involving three, or even more, players, as demonstrated with the second protocol. This trait can be extremely beneficial when many spatially separated players posses only part the secret information that must be combined and transmitted to Alice, so that she can obtain the complete secret. Using the three player protocol, this task can be achieved in one go, without the need to apply a typical QSDC protocol twice, where Alice first receives Bob's information and afterwards Charlie's information. The proposed protocol doesn't require pre-shared keys or quantum signatures, making it less complicated and more straightforward. Finally, by employing only standard CNOT and Hadamard gates, it offers the important practical advantage of being implementable on contemporary quantum computers, especially in view of the coming era of quantum distributed computing.</description><subject>Players</subject><subject>Protocol</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNiksKwjAUAIMgWLR3eCCILgrpi63ZSq24FVwGSigptjRJzUfw9nbhAVzNwMyCJMhYnvEj4oqk3g-UUixPWBQsIfUZjH2rEcQexQHEbhY2yzTKj3Lg26fSCjrr4B6lCVHDpXeqDVBZraPpWxl6azZk2cnRq_THNdle60d1yyZnX1H50Aw2OjOnBjljPKe8zNl_1xcfpDid</recordid><startdate>20241210</startdate><enddate>20241210</enddate><creator>Andronikos, Theodore</creator><creator>Sirokofskich, Alla</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20241210</creationdate><title>A novel \(2\) \&amp; \(3\) player scheme for Quantum Direct Communication</title><author>Andronikos, Theodore ; Sirokofskich, Alla</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_28338108613</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Players</topic><topic>Protocol</topic><toplevel>online_resources</toplevel><creatorcontrib>Andronikos, Theodore</creatorcontrib><creatorcontrib>Sirokofskich, Alla</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Andronikos, Theodore</au><au>Sirokofskich, Alla</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>A novel \(2\) \&amp; \(3\) player scheme for Quantum Direct Communication</atitle><jtitle>arXiv.org</jtitle><date>2024-12-10</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same novel method to embed the secret information in the entangled compound system. The way of encoding the information is the main novelty of this paper and the distinguishing feature compared to previous works in this field. The most critical advantage of this method is that it is easily scalable and extensible because it can be seamlessly generalized to a setting involving three, or even more, players, as demonstrated with the second protocol. This trait can be extremely beneficial when many spatially separated players posses only part the secret information that must be combined and transmitted to Alice, so that she can obtain the complete secret. Using the three player protocol, this task can be achieved in one go, without the need to apply a typical QSDC protocol twice, where Alice first receives Bob's information and afterwards Charlie's information. The proposed protocol doesn't require pre-shared keys or quantum signatures, making it less complicated and more straightforward. Finally, by employing only standard CNOT and Hadamard gates, it offers the important practical advantage of being implementable on contemporary quantum computers, especially in view of the coming era of quantum distributed computing.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2024-12
issn 2331-8422
language eng
recordid cdi_proquest_journals_2833810861
source Freely Accessible Journals
subjects Players
Protocol
title A novel \(2\) \& \(3\) player scheme for Quantum Direct Communication
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T07%3A32%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=A%20novel%20%5C(2%5C)%20%5C&%20%5C(3%5C)%20player%20scheme%20for%20Quantum%20Direct%20Communication&rft.jtitle=arXiv.org&rft.au=Andronikos,%20Theodore&rft.date=2024-12-10&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2833810861%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2833810861&rft_id=info:pmid/&rfr_iscdi=true