Parity Quantum Optimization: Encoding Constraints

Parity Quantum Optimization: Encoding Constraints

Constraints make hard optimization problems even harder to solve on quantum devices because they are implemented with large energy penalties and additional qubit overhead. The parity mapping, which has been introduced as an alternative to the spin encoding, translates the problem to a representation...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-03
Hauptverfasser: Drieb-Schön, Maike, Kilian Ender, Javanmard, Younes, Lechner, Wolfgang
Format: Artikel
Sprache:eng
Schlagworte:
Optimization
Parity
Physics - Quantum Physics
Qubits (quantum computing)
Representations
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 Drieb-Schön, Maike
Kilian Ender
Javanmard, Younes
Lechner, Wolfgang
description Constraints make hard optimization problems even harder to solve on quantum devices because they are implemented with large energy penalties and additional qubit overhead. The parity mapping, which has been introduced as an alternative to the spin encoding, translates the problem to a representation using only parity variables that encodes products of spin variables. In combining exchange interaction and single spin flip terms in the parity representation, constraints on sums and products of arbitrary k-body terms can be implemented without additional overhead in two-dimensional quantum systems.
doi_str_mv 10.48550/arxiv.2105.06235
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2105_06235</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2527379661</sourcerecordid><originalsourceid>FETCH-LOGICAL-a955-e3927a9ebb57228de9a2b25b0e8e82f7df54e95c8cf0612f21de32592b748c8a3</originalsourceid><addsrcrecordid>eNotj0FLwzAYhoMgbMz9gJ0seG5NvvRrEm9SphMGU9i9pG0qGTatSSrOX-_cPL2Xh5fnIWTFaJZLRHqv_bf9yoBRzGgBHK_IHDhnqcwBZmQZwoFSCoUARD4n7FV7G4_J26RdnPpkN0bb2x8d7eAekrVrhta696QcXIheWxfDDbnu9Ecwy_9dkP3Tel9u0u3u-aV83KZaIaaGKxBambpGASBbozTUgDU10kjoRNthbhQ2sulowaAD1hoOqKAWuWyk5gtye7k991Sjt732x-qvqzp3nYi7CzH64XMyIVaHYfLu5FQBguBCFQXjv5XsT8A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2527379661</pqid></control><display><type>article</type><title>Parity Quantum Optimization: Encoding Constraints</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Drieb-Schön, Maike ; Kilian Ender ; Javanmard, Younes ; Lechner, Wolfgang</creator><creatorcontrib>Drieb-Schön, Maike ; Kilian Ender ; Javanmard, Younes ; Lechner, Wolfgang</creatorcontrib><description>Constraints make hard optimization problems even harder to solve on quantum devices because they are implemented with large energy penalties and additional qubit overhead. The parity mapping, which has been introduced as an alternative to the spin encoding, translates the problem to a representation using only parity variables that encodes products of spin variables. In combining exchange interaction and single spin flip terms in the parity representation, constraints on sums and products of arbitrary k-body terms can be implemented without additional overhead in two-dimensional quantum systems.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2105.06235</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Optimization ; Parity ; Physics - Quantum Physics ; Qubits (quantum computing) ; Representations</subject><ispartof>arXiv.org, 2023-03</ispartof><rights>2023. 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,27924</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2105.06235$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.22331/q-2023-03-17-951$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Drieb-Schön, Maike</creatorcontrib><creatorcontrib>Kilian Ender</creatorcontrib><creatorcontrib>Javanmard, Younes</creatorcontrib><creatorcontrib>Lechner, Wolfgang</creatorcontrib><title>Parity Quantum Optimization: Encoding Constraints</title><title>arXiv.org</title><description>Constraints make hard optimization problems even harder to solve on quantum devices because they are implemented with large energy penalties and additional qubit overhead. The parity mapping, which has been introduced as an alternative to the spin encoding, translates the problem to a representation using only parity variables that encodes products of spin variables. In combining exchange interaction and single spin flip terms in the parity representation, constraints on sums and products of arbitrary k-body terms can be implemented without additional overhead in two-dimensional quantum systems.</description><subject>Optimization</subject><subject>Parity</subject><subject>Physics - Quantum Physics</subject><subject>Qubits (quantum computing)</subject><subject>Representations</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</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>eNotj0FLwzAYhoMgbMz9gJ0seG5NvvRrEm9SphMGU9i9pG0qGTatSSrOX-_cPL2Xh5fnIWTFaJZLRHqv_bf9yoBRzGgBHK_IHDhnqcwBZmQZwoFSCoUARD4n7FV7G4_J26RdnPpkN0bb2x8d7eAekrVrhta696QcXIheWxfDDbnu9Ecwy_9dkP3Tel9u0u3u-aV83KZaIaaGKxBambpGASBbozTUgDU10kjoRNthbhQ2sulowaAD1hoOqKAWuWyk5gtye7k991Sjt732x-qvqzp3nYi7CzH64XMyIVaHYfLu5FQBguBCFQXjv5XsT8A</recordid><startdate>20230308</startdate><enddate>20230308</enddate><creator>Drieb-Schön, Maike</creator><creator>Kilian Ender</creator><creator>Javanmard, Younes</creator><creator>Lechner, Wolfgang</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>20230308</creationdate><title>Parity Quantum Optimization: Encoding Constraints</title><author>Drieb-Schön, Maike ; Kilian Ender ; Javanmard, Younes ; Lechner, Wolfgang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a955-e3927a9ebb57228de9a2b25b0e8e82f7df54e95c8cf0612f21de32592b748c8a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Optimization</topic><topic>Parity</topic><topic>Physics - Quantum Physics</topic><topic>Qubits (quantum computing)</topic><topic>Representations</topic><toplevel>online_resources</toplevel><creatorcontrib>Drieb-Schön, Maike</creatorcontrib><creatorcontrib>Kilian Ender</creatorcontrib><creatorcontrib>Javanmard, Younes</creatorcontrib><creatorcontrib>Lechner, Wolfgang</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><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Drieb-Schön, Maike</au><au>Kilian Ender</au><au>Javanmard, Younes</au><au>Lechner, Wolfgang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Parity Quantum Optimization: Encoding Constraints</atitle><jtitle>arXiv.org</jtitle><date>2023-03-08</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>Constraints make hard optimization problems even harder to solve on quantum devices because they are implemented with large energy penalties and additional qubit overhead. The parity mapping, which has been introduced as an alternative to the spin encoding, translates the problem to a representation using only parity variables that encodes products of spin variables. In combining exchange interaction and single spin flip terms in the parity representation, constraints on sums and products of arbitrary k-body terms can be implemented without additional overhead in two-dimensional quantum systems.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2105.06235</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-03
issn 2331-8422
language eng
recordid cdi_arxiv_primary_2105_06235
source arXiv.org; Free E- Journals
subjects Optimization
Parity
Physics - Quantum Physics
Qubits (quantum computing)
Representations
title Parity Quantum Optimization: Encoding Constraints
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T23%3A54%3A26IST&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=Parity%20Quantum%20Optimization:%20Encoding%20Constraints&rft.jtitle=arXiv.org&rft.au=Drieb-Sch%C3%B6n,%20Maike&rft.date=2023-03-08&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2105.06235&rft_dat=%3Cproquest_arxiv%3E2527379661%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=2527379661&rft_id=info:pmid/&rfr_iscdi=true