Combinatorial optimization is a broadly attractive area for potential quantum advantage, but
no quantum algorithm has yet made the leap. Noise in quantum hardware remains a …

We determine the low-energy spectrum and Parisi replica-symmetry-breaking function for
the spin-glass phase of the quantum Ising model with infinite-range random exchange …

Numerical algorithms to solve mathematical optimization problems efficiently are essential to
applications in many areas of engineering and computational science. To solve optimization …

We construct and analyze a message-passing algorithm for random constraint satisfaction
problems (CSPs) at large clause density, generalizing work of El Alaoui, Montanari, and …

Quantum Annealing (QA)-accelerated MIMO detection is an emerging research approach in
the context of NextG wireless networks. The opportunity is to enable large MIMO systems …

We discuss guidelines for evaluating the performance of parameterized stochastic solvers
for optimization problems, with particular attention to systems that employ novel hardware …

The SAT problem is a prototypical NP-complete problem of fundamental importance in
computational complexity theory with many applications in science and engineering; as …

We present\emph {Noise-Directed Adaptive Remapping}(NDAR), a heuristic meta-algorithm
for approximately solving binary optimization problems by leveraging certain types of noise …

Quantum computing is one of the most enticing computational paradigms with the potential
to revolutionize diverse areas of future-generation computational systems. While quantum …

A brief survey of some random quantum models with infinite-range couplings is presented.
Insights from such models have led to advances in the quantum theory of charged black …