Penalty models for bitstrings of constant Hamming weight
To program a quantum annealer, one must construct objective functions whose minima encode hard constraints imposed by the underlying problem. For such "penalty models," one desires the additional property that the gap in the objective value between such minima and states that fail the cons...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Lackey, Brad |
| description | To program a quantum annealer, one must construct objective functions whose
minima encode hard constraints imposed by the underlying problem. For such
"penalty models," one desires the additional property that the gap in the
objective value between such minima and states that fail the constraints is
maximized amongst the allowable objective functions. In this short note, we
prove the standard penalty model for the constraint that a bitstring has given
Hamming weight is optimal with respect to objective value gap. |
| doi_str_mv | 10.48550/arxiv.1704.07290 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1704_07290</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1704_07290</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-70479796e4481a98903192582f924f42f5fc0b711801d73fec4a7c6517b5822a3</originalsourceid><addsrcrecordid>eNotj81OwzAQhH3hgFoegFP9Aglrx87ax6oCilSJHnqPNqndWsoPsq2Wvj2hcBppNJqZj7FnAaUyWsMLxe9wKQWCKgGlhUdm9m6kPt_4MB1dn7ifIm9DTjmG8ZT45Hk3jSnTmPmWhmE2-dWF0zkv2YOnPrmnf12ww9vrYbMtdp_vH5v1rqAaoZiX0KKtnVJGkDUWKmGlNtJbqbySXvsOWhTCgDhi5V2nCLtaC2znkKRqwVZ_tffrzVcMA8Vb84vQ3BGqH1ROP6k</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Penalty models for bitstrings of constant Hamming weight</title><source>arXiv.org</source><creator>Lackey, Brad</creator><creatorcontrib>Lackey, Brad</creatorcontrib><description>To program a quantum annealer, one must construct objective functions whose
minima encode hard constraints imposed by the underlying problem. For such
"penalty models," one desires the additional property that the gap in the
objective value between such minima and states that fail the constraints is
maximized amongst the allowable objective functions. In this short note, we
prove the standard penalty model for the constraint that a bitstring has given
Hamming weight is optimal with respect to objective value gap.</description><identifier>DOI: 10.48550/arxiv.1704.07290</identifier><language>eng</language><subject>Physics - Quantum Physics</subject><creationdate>2017-04</creationdate><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,782,887</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1704.07290$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1704.07290$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Lackey, Brad</creatorcontrib><title>Penalty models for bitstrings of constant Hamming weight</title><description>To program a quantum annealer, one must construct objective functions whose
minima encode hard constraints imposed by the underlying problem. For such
"penalty models," one desires the additional property that the gap in the
objective value between such minima and states that fail the constraints is
maximized amongst the allowable objective functions. In this short note, we
prove the standard penalty model for the constraint that a bitstring has given
Hamming weight is optimal with respect to objective value gap.</description><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj81OwzAQhH3hgFoegFP9Aglrx87ax6oCilSJHnqPNqndWsoPsq2Wvj2hcBppNJqZj7FnAaUyWsMLxe9wKQWCKgGlhUdm9m6kPt_4MB1dn7ifIm9DTjmG8ZT45Hk3jSnTmPmWhmE2-dWF0zkv2YOnPrmnf12ww9vrYbMtdp_vH5v1rqAaoZiX0KKtnVJGkDUWKmGlNtJbqbySXvsOWhTCgDhi5V2nCLtaC2znkKRqwVZ_tffrzVcMA8Vb84vQ3BGqH1ROP6k</recordid><startdate>20170424</startdate><enddate>20170424</enddate><creator>Lackey, Brad</creator><scope>GOX</scope></search><sort><creationdate>20170424</creationdate><title>Penalty models for bitstrings of constant Hamming weight</title><author>Lackey, Brad</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-70479796e4481a98903192582f924f42f5fc0b711801d73fec4a7c6517b5822a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Lackey, Brad</creatorcontrib><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lackey, Brad</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Penalty models for bitstrings of constant Hamming weight</atitle><date>2017-04-24</date><risdate>2017</risdate><abstract>To program a quantum annealer, one must construct objective functions whose
minima encode hard constraints imposed by the underlying problem. For such
"penalty models," one desires the additional property that the gap in the
objective value between such minima and states that fail the constraints is
maximized amongst the allowable objective functions. In this short note, we
prove the standard penalty model for the constraint that a bitstring has given
Hamming weight is optimal with respect to objective value gap.</abstract><doi>10.48550/arxiv.1704.07290</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1704.07290 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1704_07290 |
| source | arXiv.org |
| subjects | Physics - Quantum Physics |
| title | Penalty models for bitstrings of constant Hamming weight |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-02T23%3A51%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Penalty%20models%20for%20bitstrings%20of%20constant%20Hamming%20weight&rft.au=Lackey,%20Brad&rft.date=2017-04-24&rft_id=info:doi/10.48550/arxiv.1704.07290&rft_dat=%3Carxiv_GOX%3E1704_07290%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |