Efficient Quantum Walk on a Quantum Processor
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms. In this paper, we present explicit efficient quantum circuits...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2015-10 |
|---|---|
| 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 | Qiang, Xiaogang Loke, Thomas Montanaro, Ashley Kanin Aungskunsiri Zhou, Xiaoqi O'Brien, Jeremy L Wang, Jingbo Matthews, Jonathan C F |
| description | The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms. In this paper, we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks which could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle we have experimentally implemented the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor. |
| doi_str_mv | 10.48550/arxiv.1510.08657 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1510_08657</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2080129570</sourcerecordid><originalsourceid>FETCH-LOGICAL-a520-e2020fe9970b5612e14cf1414536a14ff1a83baf50dc6027e52ad310f6708a153</originalsourceid><addsrcrecordid>eNo9j11Lw0AQRRdBsNT-AJ8M-Jw6M7uz2T5KqR9QUKHgY5imu5DaJnU3Ef33xlZ8unC4XO5R6gphahwz3Er8qj-nyAMAZ7k4UyPSGnNniC7UJKUtAJAtiFmPVL4Ioa5q33TZay9N1--zN9m9Z22TyT95iW3lU2rjpToPskt-8pdjtbpfrOaP-fL54Wl-t8yFCXJPQBD8bFbAmi2SR1MFNGhYW0ETAorTawkMm8oCFZ5JNhoh2AKcIOuxuj7NHl3KQ6z3Er_LX6fy6DQ0bk6NQ2w_ep-6ctv2sRk-lQQOkGZcgP4BH4ZMiQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2080129570</pqid></control><display><type>article</type><title>Efficient Quantum Walk on a Quantum Processor</title><source>arXiv.org</source><source>Open Access: Freely Accessible Journals by multiple vendors</source><creator>Qiang, Xiaogang ; Loke, Thomas ; Montanaro, Ashley ; Kanin Aungskunsiri ; Zhou, Xiaoqi ; O'Brien, Jeremy L ; Wang, Jingbo ; Matthews, Jonathan C F</creator><creatorcontrib>Qiang, Xiaogang ; Loke, Thomas ; Montanaro, Ashley ; Kanin Aungskunsiri ; Zhou, Xiaoqi ; O'Brien, Jeremy L ; Wang, Jingbo ; Matthews, Jonathan C F</creatorcontrib><description>The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms. In this paper, we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks which could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle we have experimentally implemented the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1510.08657</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Circuits ; Complexity theory ; Computation ; Computer simulation ; Graphs ; Microprocessors ; Photonics ; Physics - Quantum Physics ; Qubits (quantum computing) ; Random walk ; Task complexity</subject><ispartof>arXiv.org, 2015-10</ispartof><rights>2015. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.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://arxiv.org/licenses/nonexclusive-distrib/1.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,27924</link.rule.ids><backlink>$$Uhttps://doi.org/10.1038/ncomms11511$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1510.08657$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Qiang, Xiaogang</creatorcontrib><creatorcontrib>Loke, Thomas</creatorcontrib><creatorcontrib>Montanaro, Ashley</creatorcontrib><creatorcontrib>Kanin Aungskunsiri</creatorcontrib><creatorcontrib>Zhou, Xiaoqi</creatorcontrib><creatorcontrib>O'Brien, Jeremy L</creatorcontrib><creatorcontrib>Wang, Jingbo</creatorcontrib><creatorcontrib>Matthews, Jonathan C F</creatorcontrib><title>Efficient Quantum Walk on a Quantum Processor</title><title>arXiv.org</title><description>The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms. In this paper, we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks which could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle we have experimentally implemented the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.</description><subject>Algorithms</subject><subject>Circuits</subject><subject>Complexity theory</subject><subject>Computation</subject><subject>Computer simulation</subject><subject>Graphs</subject><subject>Microprocessors</subject><subject>Photonics</subject><subject>Physics - Quantum Physics</subject><subject>Qubits (quantum computing)</subject><subject>Random walk</subject><subject>Task complexity</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</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>eNo9j11Lw0AQRRdBsNT-AJ8M-Jw6M7uz2T5KqR9QUKHgY5imu5DaJnU3Ef33xlZ8unC4XO5R6gphahwz3Er8qj-nyAMAZ7k4UyPSGnNniC7UJKUtAJAtiFmPVL4Ioa5q33TZay9N1--zN9m9Z22TyT95iW3lU2rjpToPskt-8pdjtbpfrOaP-fL54Wl-t8yFCXJPQBD8bFbAmi2SR1MFNGhYW0ETAorTawkMm8oCFZ5JNhoh2AKcIOuxuj7NHl3KQ6z3Er_LX6fy6DQ0bk6NQ2w_ep-6ctv2sRk-lQQOkGZcgP4BH4ZMiQ</recordid><startdate>20151029</startdate><enddate>20151029</enddate><creator>Qiang, Xiaogang</creator><creator>Loke, Thomas</creator><creator>Montanaro, Ashley</creator><creator>Kanin Aungskunsiri</creator><creator>Zhou, Xiaoqi</creator><creator>O'Brien, Jeremy L</creator><creator>Wang, Jingbo</creator><creator>Matthews, Jonathan C F</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>20151029</creationdate><title>Efficient Quantum Walk on a Quantum Processor</title><author>Qiang, Xiaogang ; Loke, Thomas ; Montanaro, Ashley ; Kanin Aungskunsiri ; Zhou, Xiaoqi ; O'Brien, Jeremy L ; Wang, Jingbo ; Matthews, Jonathan C F</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a520-e2020fe9970b5612e14cf1414536a14ff1a83baf50dc6027e52ad310f6708a153</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Circuits</topic><topic>Complexity theory</topic><topic>Computation</topic><topic>Computer simulation</topic><topic>Graphs</topic><topic>Microprocessors</topic><topic>Photonics</topic><topic>Physics - Quantum Physics</topic><topic>Qubits (quantum computing)</topic><topic>Random walk</topic><topic>Task complexity</topic><toplevel>online_resources</toplevel><creatorcontrib>Qiang, Xiaogang</creatorcontrib><creatorcontrib>Loke, Thomas</creatorcontrib><creatorcontrib>Montanaro, Ashley</creatorcontrib><creatorcontrib>Kanin Aungskunsiri</creatorcontrib><creatorcontrib>Zhou, Xiaoqi</creatorcontrib><creatorcontrib>O'Brien, Jeremy L</creatorcontrib><creatorcontrib>Wang, Jingbo</creatorcontrib><creatorcontrib>Matthews, Jonathan C F</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</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>Qiang, Xiaogang</au><au>Loke, Thomas</au><au>Montanaro, Ashley</au><au>Kanin Aungskunsiri</au><au>Zhou, Xiaoqi</au><au>O'Brien, Jeremy L</au><au>Wang, Jingbo</au><au>Matthews, Jonathan C F</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient Quantum Walk on a Quantum Processor</atitle><jtitle>arXiv.org</jtitle><date>2015-10-29</date><risdate>2015</risdate><eissn>2331-8422</eissn><abstract>The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms. In this paper, we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks which could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle we have experimentally implemented the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1510.08657</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2015-10 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1510_08657 |
| source | arXiv.org; Open Access: Freely Accessible Journals by multiple vendors |
| subjects | Algorithms Circuits Complexity theory Computation Computer simulation Graphs Microprocessors Photonics Physics - Quantum Physics Qubits (quantum computing) Random walk Task complexity |
| title | Efficient Quantum Walk on a Quantum Processor |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T16%3A19%3A10IST&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=Efficient%20Quantum%20Walk%20on%20a%20Quantum%20Processor&rft.jtitle=arXiv.org&rft.au=Qiang,%20Xiaogang&rft.date=2015-10-29&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1510.08657&rft_dat=%3Cproquest_arxiv%3E2080129570%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=2080129570&rft_id=info:pmid/&rfr_iscdi=true |