arrow
返回

COMPUTING SOLUTION SPACE PROPERTIES OF COMBINATORIAL OPTIMIZATION PROBLEMS VIA GENERIC TENSOR NETWORKS

delete2023-06-13
delete13
delete
OA
AI
J
Jin-Guo Liu *
X
Xun Gao
M
Madelyn Cain
M
Mikhail D. Lukin
S
Sheng-Tao Wang
DOI:10.1137/22M1501787delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We introduce a unified framework to compute the solution space properties of a broad class of combinatorial optimization problems. These properties include finding one of the optimum solutions, counting the number of solutions of a given size, and enumeration and sampling of solutions of a given size. Using the independent set problem as an example, we show how all these solution space properties can be computed in the unified approach of generic tensor networks. We demonstrate the versatility of this computational tool by applying it to several examples, including computing the entropy constant for hardcore lattice gases, studying the overlap gap properties, and analyzing the performance of quantum and classical algorithms for finding maximum independent sets.
Keyword:
generic tensor network
solution space property
independent set
combinatorial optimization

期刊

SIAM Journal on Scientific Computing 封面图
SIAM Journal on Scientific Computing
IF:
2.6
论文数:
5.1K
被引数:
1.8W

机构

H
Harvard University
学者数:
26.5W
论文数: 22.0W
被引数: 28.7W
引用论文

引用论文

Hot isostatically pressed Bi-Sr-Ca-Cu-O
err1999-01-01
err0
PREAI
errA S Nash; P Nash; H Shi; R B Poeppel; K C Goretta
err分享
err收藏
Analyses of anticancer drugs by capillary electrophoresis: a review
err2013-07-11
err0
PREAI
errImran Ali; Ashanul Haque; Waseem A. Wani; Kishwar Saleem; Mohammed Al Za'abi
err分享
err收藏
学者 查看更多内容