A degree reduction method for an efficient QUBO formulation for the graph coloring problem

A degree reduction method for an efficient QUBO formulation for the graph coloring problem

We introduce a new degree reduction method for homogeneous symmetric polynomials on binary variables that generalizes the conventional degree reduction methods on monomials introduced by Freedman and Ishikawa. We also design an degree reduction algorithm for general polynomials on binary variables,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hong, Namho, Jung, Hyunwoo, Kang, Hyosang, Lim, Hyunjin, Seol, Chaehwan, Um, Seokhyun
Format: Artikel
Sprache:eng
Schlagworte:
Physics - Quantum Physics
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 Hong, Namho
Jung, Hyunwoo
Kang, Hyosang
Lim, Hyunjin
Seol, Chaehwan
Um, Seokhyun
description We introduce a new degree reduction method for homogeneous symmetric polynomials on binary variables that generalizes the conventional degree reduction methods on monomials introduced by Freedman and Ishikawa. We also design an degree reduction algorithm for general polynomials on binary variables, simulated on the graph coloring problem for random graphs, and compared the results with the conventional methods. The simulated results show that our new method produces reduced quadratic polynomials that contains less variables than the reduced quadratic polynomials produced by the conventional methods.
doi_str_mv 10.48550/arxiv.2306.12081
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2306_12081</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2306_12081</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-9a71e9ea57e5284512a4cbac9185319c723610ca1b0493ff831fe6e147ae00eb3</originalsourceid><addsrcrecordid>eNotj81qhDAURrOZRZn2AbpqXkCba4yJy5mhfzAwDEw33cg13mhAjaROad--aLv64ONw4DB2DyLNjVLiEeO3_0ozKYoUMmHghn3seENtJOKRmqudfRj5QHMXGu5C5Dhycs5bT-PMz-_70_IO1x5XcCHmjngbceq4DX2Ifmz5FEPd03DLNg77T7r73y27PD9dDq_J8fTydtgdEyw0JCVqoJJQaVKZyRVkmNsabQlGSSitzmQBwiLUIi-lc0aCo4Ig10hCUC237OFPu8ZVU_QDxp9qiazWSPkLaMlMvw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A degree reduction method for an efficient QUBO formulation for the graph coloring problem</title><source>arXiv.org</source><creator>Hong, Namho ; Jung, Hyunwoo ; Kang, Hyosang ; Lim, Hyunjin ; Seol, Chaehwan ; Um, Seokhyun</creator><creatorcontrib>Hong, Namho ; Jung, Hyunwoo ; Kang, Hyosang ; Lim, Hyunjin ; Seol, Chaehwan ; Um, Seokhyun</creatorcontrib><description>We introduce a new degree reduction method for homogeneous symmetric polynomials on binary variables that generalizes the conventional degree reduction methods on monomials introduced by Freedman and Ishikawa. We also design an degree reduction algorithm for general polynomials on binary variables, simulated on the graph coloring problem for random graphs, and compared the results with the conventional methods. The simulated results show that our new method produces reduced quadratic polynomials that contains less variables than the reduced quadratic polynomials produced by the conventional methods.</description><identifier>DOI: 10.48550/arxiv.2306.12081</identifier><language>eng</language><subject>Physics - Quantum Physics</subject><creationdate>2023-06</creationdate><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,778,883</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2306.12081$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2306.12081$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Hong, Namho</creatorcontrib><creatorcontrib>Jung, Hyunwoo</creatorcontrib><creatorcontrib>Kang, Hyosang</creatorcontrib><creatorcontrib>Lim, Hyunjin</creatorcontrib><creatorcontrib>Seol, Chaehwan</creatorcontrib><creatorcontrib>Um, Seokhyun</creatorcontrib><title>A degree reduction method for an efficient QUBO formulation for the graph coloring problem</title><description>We introduce a new degree reduction method for homogeneous symmetric polynomials on binary variables that generalizes the conventional degree reduction methods on monomials introduced by Freedman and Ishikawa. We also design an degree reduction algorithm for general polynomials on binary variables, simulated on the graph coloring problem for random graphs, and compared the results with the conventional methods. The simulated results show that our new method produces reduced quadratic polynomials that contains less variables than the reduced quadratic polynomials produced by the conventional methods.</description><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj81qhDAURrOZRZn2AbpqXkCba4yJy5mhfzAwDEw33cg13mhAjaROad--aLv64ONw4DB2DyLNjVLiEeO3_0ozKYoUMmHghn3seENtJOKRmqudfRj5QHMXGu5C5Dhycs5bT-PMz-_70_IO1x5XcCHmjngbceq4DX2Ifmz5FEPd03DLNg77T7r73y27PD9dDq_J8fTydtgdEyw0JCVqoJJQaVKZyRVkmNsabQlGSSitzmQBwiLUIi-lc0aCo4Ig10hCUC237OFPu8ZVU_QDxp9qiazWSPkLaMlMvw</recordid><startdate>20230621</startdate><enddate>20230621</enddate><creator>Hong, Namho</creator><creator>Jung, Hyunwoo</creator><creator>Kang, Hyosang</creator><creator>Lim, Hyunjin</creator><creator>Seol, Chaehwan</creator><creator>Um, Seokhyun</creator><scope>GOX</scope></search><sort><creationdate>20230621</creationdate><title>A degree reduction method for an efficient QUBO formulation for the graph coloring problem</title><author>Hong, Namho ; Jung, Hyunwoo ; Kang, Hyosang ; Lim, Hyunjin ; Seol, Chaehwan ; Um, Seokhyun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-9a71e9ea57e5284512a4cbac9185319c723610ca1b0493ff831fe6e147ae00eb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Hong, Namho</creatorcontrib><creatorcontrib>Jung, Hyunwoo</creatorcontrib><creatorcontrib>Kang, Hyosang</creatorcontrib><creatorcontrib>Lim, Hyunjin</creatorcontrib><creatorcontrib>Seol, Chaehwan</creatorcontrib><creatorcontrib>Um, Seokhyun</creatorcontrib><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hong, Namho</au><au>Jung, Hyunwoo</au><au>Kang, Hyosang</au><au>Lim, Hyunjin</au><au>Seol, Chaehwan</au><au>Um, Seokhyun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A degree reduction method for an efficient QUBO formulation for the graph coloring problem</atitle><date>2023-06-21</date><risdate>2023</risdate><abstract>We introduce a new degree reduction method for homogeneous symmetric polynomials on binary variables that generalizes the conventional degree reduction methods on monomials introduced by Freedman and Ishikawa. We also design an degree reduction algorithm for general polynomials on binary variables, simulated on the graph coloring problem for random graphs, and compared the results with the conventional methods. The simulated results show that our new method produces reduced quadratic polynomials that contains less variables than the reduced quadratic polynomials produced by the conventional methods.</abstract><doi>10.48550/arxiv.2306.12081</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2306.12081
ispartof
issn
language eng
recordid cdi_arxiv_primary_2306_12081
source arXiv.org
subjects Physics - Quantum Physics
title A degree reduction method for an efficient QUBO formulation for the graph coloring problem
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T12%3A44%3A37IST&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=A%20degree%20reduction%20method%20for%20an%20efficient%20QUBO%20formulation%20for%20the%20graph%20coloring%20problem&rft.au=Hong,%20Namho&rft.date=2023-06-21&rft_id=info:doi/10.48550/arxiv.2306.12081&rft_dat=%3Carxiv_GOX%3E2306_12081%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