With the slowdown of improvement in conventional von Neumann systems, increasing
attention is paid to novel paradigms such as Ising machines. They have very different …

Abstract Domain-specific hardware to solve computationally hard optimization problems has
generated tremendous excitement. Here, we evaluate probabilistic bit (p-bit) based Ising …

Financial portfolio construction problems are often formulated as quadratic and discrete
(combinatorial) optimization that belong to the nondeterministic polynomial time (NP)-hard …

Pairs-trading is a trading strategy that involves matching a long position with a short position
in two stocks aiming at market-neutral profits. While a typical pairs-trading system monitors …

Molecular docking (MD) is a crucial task in drug design, which predicts the position,
orientation, and conformation of the ligand when it is bound to a target protein. It can be …

Correlation-diversified portfolios can be constructed by finding the maximum independent
sets (MISs) in market graphs with edges corresponding to correlations between two stocks …

We introduce a tensor network algorithm for the solution of p-spin models. We show that
bond compression through rank-revealing decompositions performed during the tensor …

Context Conformation generation, also known as molecular unfolding (MU), is a crucial step
in structure-based drug design, remaining a challenging combinatorial optimization …

This study investigates the application of Factorization Machines with Quantum Annealing
(FMQA) to address the crystal structure problem (CSP) in materials science. FMQA is a black …

This paper introduces an innovative quantum-inspired method for beamforming (BF)
optimization in multiple-input multiple-output (MIMO) arrays. The method leverages the …