5 papers
Accelerating Hybrid XORCNF Boolean Satisfiability Problems Natively with In-Memory Computing
Haesol Im, Fabian Böhm, Giacomo Pedretti +14
The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit desig…
Hardware-Compatible Single-Shot Feasible-Space Heuristics for Solving the Quadratic Assignment Problem
Haesol Im, Chan-Woo Yang, Moslem Noori +10
Research into the development of special-purpose computing architectures designed to solve quadratic unconstrained binary optimization (QUBO) problems has flourished in recent year…
Parallel Tempering-Inspired Distributed Binary Optimization with In-Memory Computing
Xiangyi Zhang, Fabian Böhm, Fabian Böhm +8
In-memory computing (IMC) has been shown to be a promising approach for solving binary optimization problems while significantly reducing energy and latency. Building on the advant…
Undecidability of Translational Tiling with Three Tiles
Chan Yang, Zhujun Zhang
Is there a fixed dimension such that translational tiling of with a monotile is undecidable? Several recent results support a positive answer to this question. G…
Multi-qubit Lattice Surgery Scheduling
Allyson Silva, Xiangyi Zhang, Zak Webb +7
Fault-tolerant quantum computation using two-dimensional topological quantum error correcting codes can benefit from multi-qubit long-range operations. By using simple commutation…