Classification conjecture for strongly-neutralizable threshold functions
Classification conjecture for strongly-neutralizable threshold functions
A threshold function is a map , where is the binary state space. A function is strongly neutralizable when it has the property that its associated Ising machine can be made neutralizable under the paper's definition. An -dimensional function is an extrusion of a lower-dimensional function if it ignores an added variable, namely . Let denote the Ising symmetry group acting on threshold functions; write for the self-dualization of the AND gate. Classification conjecture. Up to action, the only strongly-neutralizable threshold functions of dimension at least that are not extrusions of lower-dimensional functions are the AND gate and its self-dualization . This conjecture would classify the non-redundant strongly-neutralizable threshold functions. The authors report that they have checked the claim only through dimension , so the classification remains open beyond that range.
Sources & referencesView supporting material
Primary source
Isaac K. Martin, Andrew G. Moore, John T. Daly, Jess J. Meyer and Teresa M. Ranadive, “Design of General Purpose Minimal-Auxiliary Ising Machines”, arXiv:2310.16246 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.