Quantum advantage and noise reduction in distributed quantum computing
Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithm. We show that the dis...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2021-08 |
|---|---|
| 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 | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Avron, J Casper, Ofer Rozen, Ilan |
| description | Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithm. We show that the distributed Simon algorithm retains the exponential advantage, but the complexity deteriorates from O(n) to O(n^2), where n = log2(N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling. |
| doi_str_mv | 10.48550/arxiv.2104.07817 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2104_07817</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2514896951</sourcerecordid><originalsourceid>FETCH-LOGICAL-a521-f95c4a152a936d5e70b5034fd2cda4ecbdb3a409ba4d741514ef2bf93b8ba6993</originalsourceid><addsrcrecordid>eNotj01Lw0AYhBdBsNT-AE8ueE7czyR7lGJVKIjQe3g3uylbzCbdj6L_3tj2NHOYGeZB6IGSUjRSkmcIP-5UMkpESeqG1jdowTinRSMYu0OrGA-EEFbVTEq-QJuvDD7lAYM5zQb2FoM32I8uWhysyV1yo8fOY-NiCk7nZA0-XkvdOEw5Ob-_R7c9fEe7uuoS7Tavu_V7sf18-1i_bAuQjBa9kp0AKhkoXhlpa6Il4aI3rDMgbKeN5iCI0iBMLaikwvZM94rrRkOlFF-ix8vsGbKdghsg_Lb_sO0Zdk48XRJTGI_ZxtQexhz8_Kll816jKiUp_wM50Fh0</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2514896951</pqid></control><display><type>article</type><title>Quantum advantage and noise reduction in distributed quantum computing</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Avron, J ; Casper, Ofer ; Rozen, Ilan</creator><creatorcontrib>Avron, J ; Casper, Ofer ; Rozen, Ilan</creatorcontrib><description>Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithm. We show that the distributed Simon algorithm retains the exponential advantage, but the complexity deteriorates from O(n) to O(n^2), where n = log2(N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2104.07817</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Computer networks ; Distributed processing ; Equivalent circuits ; Microprocessors ; Physics - Quantum Physics ; Quantum computers ; Quantum computing ; Qubits (quantum computing) ; Random sampling</subject><ispartof>arXiv.org, 2021-08</ispartof><rights>2021. 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><rights>http://creativecommons.org/licenses/by/4.0</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>228,230,780,784,885,27923</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2104.07817$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1103/PhysRevA.104.052404$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Avron, J</creatorcontrib><creatorcontrib>Casper, Ofer</creatorcontrib><creatorcontrib>Rozen, Ilan</creatorcontrib><title>Quantum advantage and noise reduction in distributed quantum computing</title><title>arXiv.org</title><description>Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithm. We show that the distributed Simon algorithm retains the exponential advantage, but the complexity deteriorates from O(n) to O(n^2), where n = log2(N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling.</description><subject>Algorithms</subject><subject>Computer networks</subject><subject>Distributed processing</subject><subject>Equivalent circuits</subject><subject>Microprocessors</subject><subject>Physics - Quantum Physics</subject><subject>Quantum computers</subject><subject>Quantum computing</subject><subject>Qubits (quantum computing)</subject><subject>Random sampling</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj01Lw0AYhBdBsNT-AE8ueE7czyR7lGJVKIjQe3g3uylbzCbdj6L_3tj2NHOYGeZB6IGSUjRSkmcIP-5UMkpESeqG1jdowTinRSMYu0OrGA-EEFbVTEq-QJuvDD7lAYM5zQb2FoM32I8uWhysyV1yo8fOY-NiCk7nZA0-XkvdOEw5Ob-_R7c9fEe7uuoS7Tavu_V7sf18-1i_bAuQjBa9kp0AKhkoXhlpa6Il4aI3rDMgbKeN5iCI0iBMLaikwvZM94rrRkOlFF-ix8vsGbKdghsg_Lb_sO0Zdk48XRJTGI_ZxtQexhz8_Kll816jKiUp_wM50Fh0</recordid><startdate>20210819</startdate><enddate>20210819</enddate><creator>Avron, J</creator><creator>Casper, Ofer</creator><creator>Rozen, Ilan</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><scope>GOX</scope></search><sort><creationdate>20210819</creationdate><title>Quantum advantage and noise reduction in distributed quantum computing</title><author>Avron, J ; Casper, Ofer ; Rozen, Ilan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a521-f95c4a152a936d5e70b5034fd2cda4ecbdb3a409ba4d741514ef2bf93b8ba6993</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Computer networks</topic><topic>Distributed processing</topic><topic>Equivalent circuits</topic><topic>Microprocessors</topic><topic>Physics - Quantum Physics</topic><topic>Quantum computers</topic><topic>Quantum computing</topic><topic>Qubits (quantum computing)</topic><topic>Random sampling</topic><toplevel>online_resources</toplevel><creatorcontrib>Avron, J</creatorcontrib><creatorcontrib>Casper, Ofer</creatorcontrib><creatorcontrib>Rozen, Ilan</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & 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><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Avron, J</au><au>Casper, Ofer</au><au>Rozen, Ilan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quantum advantage and noise reduction in distributed quantum computing</atitle><jtitle>arXiv.org</jtitle><date>2021-08-19</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithm. We show that the distributed Simon algorithm retains the exponential advantage, but the complexity deteriorates from O(n) to O(n^2), where n = log2(N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2104.07817</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2021-08 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2104_07817 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Computer networks Distributed processing Equivalent circuits Microprocessors Physics - Quantum Physics Quantum computers Quantum computing Qubits (quantum computing) Random sampling |
| title | Quantum advantage and noise reduction in distributed quantum computing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T18%3A38%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quantum%20advantage%20and%20noise%20reduction%20in%20distributed%20quantum%20computing&rft.jtitle=arXiv.org&rft.au=Avron,%20J&rft.date=2021-08-19&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2104.07817&rft_dat=%3Cproquest_arxiv%3E2514896951%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2514896951&rft_id=info:pmid/&rfr_iscdi=true |