Computational phase transitions in decision problems exhibit a detectable signature in Gibbs distributions that can be observed in physical annealing processors.
Sharp thresholds of graph properties, and the k-SAT problem.Journal of the American mathematical Society, 12(4):1017–1054
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computational Phase Transition Signature in Gibbs Sampling
Computational phase transitions in decision problems exhibit a detectable signature in Gibbs distributions that can be observed in physical annealing processors.