Approximation Algorithms for Noncommutative CSPs

Noncommutative constraint satisfaction problems (CSPs) are higher-dimensional operator extensions of classical CSPs. Their approximability remains largely unexplored. A notable example of a noncommutative CSP that is not solvable in polynomial time is NC-Max-3-Cut. We present a 0.864-approximation a...

Full description

Saved in:
Bibliographic Details
Published inProceedings / annual Symposium on Foundations of Computer Science pp. 920 - 929
Main Authors Culf, Eric, Mousavi, Hamoon, Spirig, Taro
Format Conference Proceeding
LanguageEnglish
Published IEEE 27.10.2024
Subjects
Approximation algorithms
Computer science
constraint satisfaction problems
noncommutative polynomial optimization
Polynomials
quantum complexity
Quantum computing
Online AccessGet full text
ISSN2575-8454
DOI10.1109/FOCS61266.2024.00061

Cover

Abstract Noncommutative constraint satisfaction problems (CSPs) are higher-dimensional operator extensions of classical CSPs. Their approximability remains largely unexplored. A notable example of a noncommutative CSP that is not solvable in polynomial time is NC-Max-3-Cut. We present a 0.864-approximation algorithm for this problem. Our approach extends to a broader class of both classical and noncommutative CSPs. We introduce three key concepts: approximate isometry, relative distribution, and generalized anticommutation, which may be of independent interest.
AbstractList Noncommutative constraint satisfaction problems (CSPs) are higher-dimensional operator extensions of classical CSPs. Their approximability remains largely unexplored. A notable example of a noncommutative CSP that is not solvable in polynomial time is NC-Max-3-Cut. We present a 0.864-approximation algorithm for this problem. Our approach extends to a broader class of both classical and noncommutative CSPs. We introduce three key concepts: approximate isometry, relative distribution, and generalized anticommutation, which may be of independent interest.
Author Culf, Eric
Mousavi, Hamoon
Spirig, Taro
Author_xml – sequence: 1
  givenname: Eric
  surname: Culf
  fullname: Culf, Eric
  email: eculf@uwaterloo.ca
  organization: University of Waterloo,Waterloo,Canada
– sequence: 2
  givenname: Hamoon
  surname: Mousavi
  fullname: Mousavi, Hamoon
  email: hmousavi@berkeley.edu
  organization: University of California, Berkeley,Berkeley,USA
– sequence: 3
  givenname: Taro
  surname: Spirig
  fullname: Spirig, Taro
  email: tasp@math.ku.dk
  organization: University of Copenhagen,Copenhagen,Denmark
BookMark eNotjs1Kw0AURkdRsK19gy7yAon3zv8sQ7BWKFaorstMZkYjTSYkUfTtDejqW5zD4VuSqy51gZANQoEI5m57qI4SqZQFBcoLAJB4QdZGGc0YCpSK4yVZUKFErrngN2Q5jh8AHATwBYGy74f03bR2alKXlee3NDTTeztmMQ3ZU-rq1Laf00y_QlYdn8dbch3teQzr_12R1-39S7XL94eHx6rc5w0qOeVcM2NZbaP1zFnHOAsyempMZC5Q7qWnOmhnBGpjYFaj9xyMd6jqWjlgK7L56zYhhFM_zA-HnxOCEhKlZL-37Ucy
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/FOCS61266.2024.00061
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISBN 9798331516741
EISSN 2575-8454
EndPage 929
ExternalDocumentID 10756166
Genre orig-research
GrantInformation_xml – fundername: European Union
  grantid: 101078107
  funderid: 10.13039/501100000780
– fundername: Office of Science
  grantid: 101078107
  funderid: 10.13039/100006132
– fundername: U.S. Department of Energy
  grantid: 101078107
  funderid: 10.13039/100000015
– fundername: VILLUM FONDEN
  grantid: 37532
  funderid: 10.13039/100008398
GroupedDBID --Z
6IE
6IH
6IK
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIE
RIO
ID FETCH-LOGICAL-i176t-4839a3cafad3bab343e6fd299f3be24d6d28e8b95189909a3fdd409db17cc7b03
IEDL.DBID RIE
IngestDate Wed Aug 27 03:04:08 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i176t-4839a3cafad3bab343e6fd299f3be24d6d28e8b95189909a3fdd409db17cc7b03
PageCount 10
ParticipantIDs ieee_primary_10756166
PublicationCentury 2000
PublicationDate 2024-Oct.-27
PublicationDateYYYYMMDD 2024-10-27
PublicationDate_xml – month: 10
  year: 2024
  text: 2024-Oct.-27
  day: 27
PublicationDecade 2020
PublicationTitle Proceedings / annual Symposium on Foundations of Computer Science
PublicationTitleAbbrev FOCS
PublicationYear 2024
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0040504
Score 2.2817397
Snippet Noncommutative constraint satisfaction problems (CSPs) are higher-dimensional operator extensions of classical CSPs. Their approximability remains largely...
SourceID ieee
SourceType Publisher
StartPage 920
SubjectTerms Approximation algorithms
Computer science
constraint satisfaction problems
noncommutative polynomial optimization
Polynomials
quantum complexity
Quantum computing
Title Approximation Algorithms for Noncommutative CSPs
URI https://ieeexplore.ieee.org/document/10756166
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fS8MwED7cnvRlOif-pg--dqZNm6SPYziGsDmYg72N5kd1qKtsHYh_vZe03UAQfCuhkHBH8t0l930HcCfx1Bcqiv2U89i2MCN-QiX1My2UQjgyzElsjMZsOIse5_G8Iqs7LowxxhWfma79dG_5Oldbe1WGO5wj3DPWgAYXrCRr1ccuBh4kqrhxAUnuB0_9KaI3s2UIoVXIJk4He99BxQHIoAXjeuqybuStuy1kV33_UmX899qOobPn6nmTHQqdwIFZtaFVN2vwqr3bhqPRTqB1cwqkZ7XEv5YlcdHrvb_k62Xx-rHxMIj1xvlKWeJI4VTBvf50sunAbPDw3B_6VfMEfxlwVthLwiSlKs1STWUqaYRmzzSCT0alCSPNdCiMkBhgYcZF8NdMa8z1tAy4UlwSegbNVb4y5-Ch71IcFAmPeaTiTHDFBSUGc8uYyyC9gI61x-Kz1MdY1Ka4_GP8Cg6tTywChPwamsV6a24Q2gt561z6A3mnouI
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PS8MwFA46D-plOif-tgevnemSNO1xDMfUrQ62gbfR_KgOtZWtA_Gv9yVtNxAEbyUUEt4j-d5L3vc9hG4EnPqBpMyNOWemhRl2QyKIm6hASoAj7VuJjWHk96f04Zk9l2R1y4XRWtviM90yn_YtX2VyZa7KYIdzgHvf30Y7jFLKCrpWdfBC6IFpyY7zcHjbe-qOAb99U4jQNhrZ2Cphb3qoWAjp1VFUTV5Ujry1Vrloye9fuoz_Xt0Bam7Yes5ojUOHaEunDVSv2jU45e5toP3hWqJ1eYRwx6iJf80L6qLTeX_JFvP89WPpQBjrRFkqDXUkt7rgTnc8WjbRtHc36fbdsn2CO_e4n5trwjAmMk5iRUQsCAXDJwrgJyFCt6nyVTvQgYAQC3IuDL8mSkG2p4THpeQCk2NUS7NUnyAHvBfDYBByxqlkScAlDwjWkF0yLrz4FDWNPWafhULGrDLF2R_j12i3PxkOZoP76PEc7Rn_GDxo8wtUyxcrfQlAn4sr694fMiymLw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+%2F+annual+Symposium+on+Foundations+of+Computer+Science&rft.atitle=Approximation+Algorithms+for+Noncommutative+CSPs&rft.au=Culf%2C+Eric&rft.au=Mousavi%2C+Hamoon&rft.au=Spirig%2C+Taro&rft.date=2024-10-27&rft.pub=IEEE&rft.eissn=2575-8454&rft.spage=920&rft.epage=929&rft_id=info:doi/10.1109%2FFOCS61266.2024.00061&rft.externalDocID=10756166