Efficient quantum programming using EASE gates on a trapped-ion quantum computer
Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2022-01 |
|---|---|
| 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 | Grzesiak, Nikodem Maksymov, Andrii Niroula, Pradeep Nam, Yunseong |
| description | Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show an \(n\)-qubit Clifford circuit can be implemented using \(6\log(n)\) EASE gates, an \(n\)-qubit multiply-controlled NOT gate can be implemented using \(3n/2\) EASE gates, and an \(n\)-qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general. |
| doi_str_mv | 10.48550/arxiv.2107.07591 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2107_07591</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2553212380</sourcerecordid><originalsourceid>FETCH-LOGICAL-a520-8cbfa81b3baa2b7ea38e30a68731e2133e76a41618d7b55b0a17f66881a490623</originalsourceid><addsrcrecordid>eNo1z1lLw0AQB_BFECy1H8AnF3xO3CN79LGUeEBBwb6H2XQTtpije4h-e5NWX2YY-M8wP4TuKMkLLQR5BP_tvnJGicqJEmt6hRaMc5rpgrEbtArhSAhhUjEh-AK9l03jamf7iE8J-pg6PPqh9dB1rm9xCnMtNx8lbiHagIceA44extEeMjdN_1v10I0pWn-Lrhv4DHb115do_1Tuty_Z7u35dbvZZSAYyXRtGtDUcAPAjLLAteUEpFacWkY5t0pCQSXVB2WEMASoaqTUmkKxJpLxJbq_nD1zq9G7DvxPNbOrM3tKPFwSk-eUbIjVcUi-n36qZjqjjGvCfwFgT1on</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2553212380</pqid></control><display><type>article</type><title>Efficient quantum programming using EASE gates on a trapped-ion quantum computer</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Grzesiak, Nikodem ; Maksymov, Andrii ; Niroula, Pradeep ; Nam, Yunseong</creator><creatorcontrib>Grzesiak, Nikodem ; Maksymov, Andrii ; Niroula, Pradeep ; Nam, Yunseong</creatorcontrib><description>Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show an \(n\)-qubit Clifford circuit can be implemented using \(6\log(n)\) EASE gates, an \(n\)-qubit multiply-controlled NOT gate can be implemented using \(3n/2\) EASE gates, and an \(n\)-qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2107.07591</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Computational efficiency ; Computer Science - Emerging Technologies ; Gates (circuits) ; Parallel operation ; Pattern matching ; Permutations ; Physics - Quantum Physics ; Quantum chemistry ; Quantum computers ; Quantum computing ; Quantum entanglement ; Qubits (quantum computing)</subject><ispartof>arXiv.org, 2022-01</ispartof><rights>2022. 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,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.22331/q-2022-01-27-634$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2107.07591$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Grzesiak, Nikodem</creatorcontrib><creatorcontrib>Maksymov, Andrii</creatorcontrib><creatorcontrib>Niroula, Pradeep</creatorcontrib><creatorcontrib>Nam, Yunseong</creatorcontrib><title>Efficient quantum programming using EASE gates on a trapped-ion quantum computer</title><title>arXiv.org</title><description>Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show an \(n\)-qubit Clifford circuit can be implemented using \(6\log(n)\) EASE gates, an \(n\)-qubit multiply-controlled NOT gate can be implemented using \(3n/2\) EASE gates, and an \(n\)-qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general.</description><subject>Algorithms</subject><subject>Computational efficiency</subject><subject>Computer Science - Emerging Technologies</subject><subject>Gates (circuits)</subject><subject>Parallel operation</subject><subject>Pattern matching</subject><subject>Permutations</subject><subject>Physics - Quantum Physics</subject><subject>Quantum chemistry</subject><subject>Quantum computers</subject><subject>Quantum computing</subject><subject>Quantum entanglement</subject><subject>Qubits (quantum computing)</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</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>eNo1z1lLw0AQB_BFECy1H8AnF3xO3CN79LGUeEBBwb6H2XQTtpije4h-e5NWX2YY-M8wP4TuKMkLLQR5BP_tvnJGicqJEmt6hRaMc5rpgrEbtArhSAhhUjEh-AK9l03jamf7iE8J-pg6PPqh9dB1rm9xCnMtNx8lbiHagIceA44extEeMjdN_1v10I0pWn-Lrhv4DHb115do_1Tuty_Z7u35dbvZZSAYyXRtGtDUcAPAjLLAteUEpFacWkY5t0pCQSXVB2WEMASoaqTUmkKxJpLxJbq_nD1zq9G7DvxPNbOrM3tKPFwSk-eUbIjVcUi-n36qZjqjjGvCfwFgT1on</recordid><startdate>20220124</startdate><enddate>20220124</enddate><creator>Grzesiak, Nikodem</creator><creator>Maksymov, Andrii</creator><creator>Niroula, Pradeep</creator><creator>Nam, Yunseong</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>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220124</creationdate><title>Efficient quantum programming using EASE gates on a trapped-ion quantum computer</title><author>Grzesiak, Nikodem ; Maksymov, Andrii ; Niroula, Pradeep ; Nam, Yunseong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a520-8cbfa81b3baa2b7ea38e30a68731e2133e76a41618d7b55b0a17f66881a490623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Computational efficiency</topic><topic>Computer Science - Emerging Technologies</topic><topic>Gates (circuits)</topic><topic>Parallel operation</topic><topic>Pattern matching</topic><topic>Permutations</topic><topic>Physics - Quantum Physics</topic><topic>Quantum chemistry</topic><topic>Quantum computers</topic><topic>Quantum computing</topic><topic>Quantum entanglement</topic><topic>Qubits (quantum computing)</topic><toplevel>online_resources</toplevel><creatorcontrib>Grzesiak, Nikodem</creatorcontrib><creatorcontrib>Maksymov, Andrii</creatorcontrib><creatorcontrib>Niroula, Pradeep</creatorcontrib><creatorcontrib>Nam, Yunseong</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 Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Grzesiak, Nikodem</au><au>Maksymov, Andrii</au><au>Niroula, Pradeep</au><au>Nam, Yunseong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient quantum programming using EASE gates on a trapped-ion quantum computer</atitle><jtitle>arXiv.org</jtitle><date>2022-01-24</date><risdate>2022</risdate><eissn>2331-8422</eissn><abstract>Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show an \(n\)-qubit Clifford circuit can be implemented using \(6\log(n)\) EASE gates, an \(n\)-qubit multiply-controlled NOT gate can be implemented using \(3n/2\) EASE gates, and an \(n\)-qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2107.07591</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2022-01 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2107_07591 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Computational efficiency Computer Science - Emerging Technologies Gates (circuits) Parallel operation Pattern matching Permutations Physics - Quantum Physics Quantum chemistry Quantum computers Quantum computing Quantum entanglement Qubits (quantum computing) |
| title | Efficient quantum programming using EASE gates on a trapped-ion quantum computer |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T00%3A19%3A07IST&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%20programming%20using%20EASE%20gates%20on%20a%20trapped-ion%20quantum%20computer&rft.jtitle=arXiv.org&rft.au=Grzesiak,%20Nikodem&rft.date=2022-01-24&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2107.07591&rft_dat=%3Cproquest_arxiv%3E2553212380%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=2553212380&rft_id=info:pmid/&rfr_iscdi=true |