Oblivious transfer and quantum channels as communication resources
We show that from a communication-complexity perspective, the primitive called oblivious transfer —which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as non-local boxes are of maximally entangled qubits. More explicitly, one r...
Gespeichert in:
| Veröffentlicht in: | Natural computing 2013-03, Vol.12 (1), p.13-17 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 17 |
|---|---|
| container_issue | 1 |
| container_start_page | 13 |
| container_title | Natural computing |
| container_volume | 12 |
| creator | Gisin, Nicolas Popescu, Sandu Scarani, Valerio Wolf, Stefan Wullschleger, Jürg |
| description | We show that from a communication-complexity perspective, the primitive called
oblivious transfer
—which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as
non-local boxes
are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one qubit and measuring it in an orthogonal basis. On the other hand, a qubit channel allows for realizing non-cryptographic oblivious transfer with probability roughly 85 %, whereas 75 % is the classical limit. |
| doi_str_mv | 10.1007/s11047-012-9350-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671507819</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1671507819</sourcerecordid><originalsourceid>FETCH-LOGICAL-c349t-fe049b84347bb4263658935879e4c3ee3a37938a67bfdfeee73b48fa4a854803</originalsourceid><addsrcrecordid>eNp1kE9LxDAQxYMouK5-AG8FL16qSZM2yVEX_8HCXvYe0uxEu7TpbqYV_Pam1IMInmYGfvPmzSPkmtE7Rqm8R8aokDllRa55SXN9QhaslGmSujqd-krmUjF1Ti4Q95QWrCzZgjxu6rb5bPoRsyHagB5iZsMuO442DGOXuQ8bArSYWcxc33VjaJwdmj5kEbAfowO8JGfetghXP3VJts9P29Vrvt68vK0e1rnjQg-5Byp0rQQXsq5FUfGqVMmqkhqE4wDccqm5spWs_c4DgOS1UN4Kq0qhKF-S21n2EPvjCDiYrkEHbWsDJPuGVZKVNL2oE3rzB90nqyGZM4wzQdOZQiaKzZSLPWIEbw6x6Wz8MoyaKVQzh2pSqGYK1UzKxbyDiQ3vEH8p_7v0DfVKeVw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1314093827</pqid></control><display><type>article</type><title>Oblivious transfer and quantum channels as communication resources</title><source>SpringerLink Journals - AutoHoldings</source><creator>Gisin, Nicolas ; Popescu, Sandu ; Scarani, Valerio ; Wolf, Stefan ; Wullschleger, Jürg</creator><creatorcontrib>Gisin, Nicolas ; Popescu, Sandu ; Scarani, Valerio ; Wolf, Stefan ; Wullschleger, Jürg</creatorcontrib><description>We show that from a communication-complexity perspective, the primitive called
oblivious transfer
—which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as
non-local boxes
are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one qubit and measuring it in an orthogonal basis. On the other hand, a qubit channel allows for realizing non-cryptographic oblivious transfer with probability roughly 85 %, whereas 75 % is the classical limit.</description><identifier>ISSN: 1567-7818</identifier><identifier>EISSN: 1572-9796</identifier><identifier>DOI: 10.1007/s11047-012-9350-9</identifier><language>eng</language><publisher>Dordrecht: Springer Netherlands</publisher><subject>Analogue ; Artificial Intelligence ; Channels ; Communication ; Complex Systems ; Computation ; Computer Science ; Computer simulation ; Cryptography ; Evolutionary Biology ; Processor Architectures ; Quantum theory ; Qubits (quantum computing) ; Theory of Computation</subject><ispartof>Natural computing, 2013-03, Vol.12 (1), p.13-17</ispartof><rights>Springer Science+Business Media Dordrecht 2012</rights><rights>Springer Science+Business Media Dordrecht 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c349t-fe049b84347bb4263658935879e4c3ee3a37938a67bfdfeee73b48fa4a854803</citedby><cites>FETCH-LOGICAL-c349t-fe049b84347bb4263658935879e4c3ee3a37938a67bfdfeee73b48fa4a854803</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11047-012-9350-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11047-012-9350-9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Gisin, Nicolas</creatorcontrib><creatorcontrib>Popescu, Sandu</creatorcontrib><creatorcontrib>Scarani, Valerio</creatorcontrib><creatorcontrib>Wolf, Stefan</creatorcontrib><creatorcontrib>Wullschleger, Jürg</creatorcontrib><title>Oblivious transfer and quantum channels as communication resources</title><title>Natural computing</title><addtitle>Nat Comput</addtitle><description>We show that from a communication-complexity perspective, the primitive called
oblivious transfer
—which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as
non-local boxes
are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one qubit and measuring it in an orthogonal basis. On the other hand, a qubit channel allows for realizing non-cryptographic oblivious transfer with probability roughly 85 %, whereas 75 % is the classical limit.</description><subject>Analogue</subject><subject>Artificial Intelligence</subject><subject>Channels</subject><subject>Communication</subject><subject>Complex Systems</subject><subject>Computation</subject><subject>Computer Science</subject><subject>Computer simulation</subject><subject>Cryptography</subject><subject>Evolutionary Biology</subject><subject>Processor Architectures</subject><subject>Quantum theory</subject><subject>Qubits (quantum computing)</subject><subject>Theory of Computation</subject><issn>1567-7818</issn><issn>1572-9796</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1kE9LxDAQxYMouK5-AG8FL16qSZM2yVEX_8HCXvYe0uxEu7TpbqYV_Pam1IMInmYGfvPmzSPkmtE7Rqm8R8aokDllRa55SXN9QhaslGmSujqd-krmUjF1Ti4Q95QWrCzZgjxu6rb5bPoRsyHagB5iZsMuO442DGOXuQ8bArSYWcxc33VjaJwdmj5kEbAfowO8JGfetghXP3VJts9P29Vrvt68vK0e1rnjQg-5Byp0rQQXsq5FUfGqVMmqkhqE4wDccqm5spWs_c4DgOS1UN4Kq0qhKF-S21n2EPvjCDiYrkEHbWsDJPuGVZKVNL2oE3rzB90nqyGZM4wzQdOZQiaKzZSLPWIEbw6x6Wz8MoyaKVQzh2pSqGYK1UzKxbyDiQ3vEH8p_7v0DfVKeVw</recordid><startdate>20130301</startdate><enddate>20130301</enddate><creator>Gisin, Nicolas</creator><creator>Popescu, Sandu</creator><creator>Scarani, Valerio</creator><creator>Wolf, Stefan</creator><creator>Wullschleger, Jürg</creator><general>Springer Netherlands</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2P</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20130301</creationdate><title>Oblivious transfer and quantum channels as communication resources</title><author>Gisin, Nicolas ; Popescu, Sandu ; Scarani, Valerio ; Wolf, Stefan ; Wullschleger, Jürg</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c349t-fe049b84347bb4263658935879e4c3ee3a37938a67bfdfeee73b48fa4a854803</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Analogue</topic><topic>Artificial Intelligence</topic><topic>Channels</topic><topic>Communication</topic><topic>Complex Systems</topic><topic>Computation</topic><topic>Computer Science</topic><topic>Computer simulation</topic><topic>Cryptography</topic><topic>Evolutionary Biology</topic><topic>Processor Architectures</topic><topic>Quantum theory</topic><topic>Qubits (quantum computing)</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gisin, Nicolas</creatorcontrib><creatorcontrib>Popescu, Sandu</creatorcontrib><creatorcontrib>Scarani, Valerio</creatorcontrib><creatorcontrib>Wolf, Stefan</creatorcontrib><creatorcontrib>Wullschleger, Jürg</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</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>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</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>ProQuest Central Basic</collection><jtitle>Natural computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gisin, Nicolas</au><au>Popescu, Sandu</au><au>Scarani, Valerio</au><au>Wolf, Stefan</au><au>Wullschleger, Jürg</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Oblivious transfer and quantum channels as communication resources</atitle><jtitle>Natural computing</jtitle><stitle>Nat Comput</stitle><date>2013-03-01</date><risdate>2013</risdate><volume>12</volume><issue>1</issue><spage>13</spage><epage>17</epage><pages>13-17</pages><issn>1567-7818</issn><eissn>1572-9796</eissn><abstract>We show that from a communication-complexity perspective, the primitive called
oblivious transfer
—which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as
non-local boxes
are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one qubit and measuring it in an orthogonal basis. On the other hand, a qubit channel allows for realizing non-cryptographic oblivious transfer with probability roughly 85 %, whereas 75 % is the classical limit.</abstract><cop>Dordrecht</cop><pub>Springer Netherlands</pub><doi>10.1007/s11047-012-9350-9</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1567-7818 |
| ispartof | Natural computing, 2013-03, Vol.12 (1), p.13-17 |
| issn | 1567-7818 1572-9796 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1671507819 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Analogue Artificial Intelligence Channels Communication Complex Systems Computation Computer Science Computer simulation Cryptography Evolutionary Biology Processor Architectures Quantum theory Qubits (quantum computing) Theory of Computation |
| title | Oblivious transfer and quantum channels as communication resources |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T18%3A47%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Oblivious%20transfer%20and%20quantum%20channels%20as%20communication%20resources&rft.jtitle=Natural%20computing&rft.au=Gisin,%20Nicolas&rft.date=2013-03-01&rft.volume=12&rft.issue=1&rft.spage=13&rft.epage=17&rft.pages=13-17&rft.issn=1567-7818&rft.eissn=1572-9796&rft_id=info:doi/10.1007/s11047-012-9350-9&rft_dat=%3Cproquest_cross%3E1671507819%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1314093827&rft_id=info:pmid/&rfr_iscdi=true |