Quantum annealing for industry applications: Introduction and review

S Yarkoni, E Raponi, T Bäck… - Reports on Progress in …, 2022 - iopscience.iop.org
Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to
solve combinatorial optimization problems. In recent years, advances in quantum …

Massively parallel probabilistic computing with sparse Ising machines

NA Aadit, A Grimaldi, M Carpentieri, L Theogarajan… - Nature …, 2022 - nature.com
Solving computationally hard problems using conventional computing architectures is often
slow and energetically inefficient. Quantum computing may help with these challenges, but it …

A full-stack view of probabilistic computing with p-bits: devices, architectures, and algorithms

S Chowdhury, A Grimaldi, NA Aadit… - IEEE Journal on …, 2023 - ieeexplore.ieee.org
The transistor celebrated its 75th birthday in 2022. The continued scaling of the transistor
defined by Moore's law continues, albeit at a slower pace. Meanwhile, computing demands …

Large-scale simulation of Shor's quantum factoring algorithm

D Willsch, M Willsch, F Jin, H De Raedt, K Michielsen - Mathematics, 2023 - mdpi.com
Shor's factoring algorithm is one of the most anticipated applications of quantum computing.
However, the limited capabilities of today's quantum computers only permit a study of Shor's …

Weighted -Bits for FPGA Implementation of Probabilistic Circuits

AZ Pervaiz, BM Sutton, LA Ghantasala… - IEEE transactions on …, 2018 - ieeexplore.ieee.org
Probabilistic spin logic is a recently proposed computing paradigm based on unstable
stochastic units called probabilistic bits (p-bits) that can be correlated to form probabilistic …

Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results

Z Bian, F Chudak, W Macready, A Roy… - Information and …, 2020 - Elsevier
Quantum annealers (QAs) are specialized quantum computers that minimize objective
functions over discrete variables by physically exploiting quantum effects. Current QA …

Inhomogeneous driving in quantum annealers can result in orders-of-magnitude improvements in performance

JI Adame, PL McMahon - Quantum Science and Technology, 2020 - iopscience.iop.org
Quantum annealers are special-purpose quantum computers that primarily target solving
Ising optimization problems. Theoretical work has predicted that the probability of a quantum …

First results solving arbitrarily structured maximum independent set problems using quantum annealing

S Yarkoni, A Plaat, T Back - 2018 IEEE Congress on …, 2018 - ieeexplore.ieee.org
Commercial quantum processing units (QPUs) such as those made by D-Wave Systems are
being increasingly used for solving complex combinatorial optimization problems. In this …

Simulating the transverse-field Ising model on the kagome lattice using a programmable quantum annealer

P Narasimhan, S Humeniuk, A Roy… - Physical Review B, 2024 - APS
The presence of competing interactions arising from geometry leads to frustration in
quantum spin models. As a consequence, the ground state of such systems often displays a …

Spin-variable reduction method for handling linear equality constraints in Ising machines

T Shirai, N Togawa - IEEE Transactions on Computers, 2023 - ieeexplore.ieee.org
We propose a spin-variable reduction method for Ising machines to handle linear equality
constraints in a combinatorial optimization problem. Ising machines including quantum …