A compact QUBO encoding derived via ILP reduces logical variables by thousands in AES, MD5, SHA1 and SHA256, with over 8x reduction for AES-256.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Classical kernelisation fully reduces many small and sparse unit-disk graphs for MIS and MWIS native to Rydberg arrays, but dense graphs retain finite irreducible kernels, with vertex weights increasing reducibility and extended interaction ranges suppressing it.
citing papers explorer
-
A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions
A compact QUBO encoding derived via ILP reduces logical variables by thousands in AES, MD5, SHA1 and SHA256, with over 8x reduction for AES-256.
-
Reducibility of native weighted graphs on Rydberg Arrays
Classical kernelisation fully reduces many small and sparse unit-disk graphs for MIS and MWIS native to Rydberg arrays, but dense graphs retain finite irreducible kernels, with vertex weights increasing reducibility and extended interaction ranges suppressing it.