6 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…
How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits
Masoud Mohseni, Artur Scherer, K. Grace Johnson +48
In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become po…
Distributed Quantum Computing via Adaptive Circuit Knitting
K. Grace Johnson, Aniello Esposito, Gaurav Gyawali +5
Distributing quantum workloads over many Quantum Processing Units (QPUs) is a crucial step in scaling up quantum computers toward practical quantum advantage due to the limitations…
SEPhIA: <1 laser/neuron Spiking Electro-Photonic Integrated Multi-Tiled Architecture for Scalable Optical Neuromorphic Computing
MatÄj Hejda, Aishwarya Natarajan, Chaerin Hong +4
Research into optical spiking neural networks (SNNs) has primarily focused on spiking devices, networks of excitable lasers or numerical modelling of large architectures, often ove…
Solving Boolean satisfiability problems with resistive content addressable memories
Giacomo Pedretti, Fabian Böhm, Tinish Bhattacharya +15
Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional…