Quantum annealing for industry applications: Introduction and review
Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to
solve combinatorial optimization problems. In recent years, advances in quantum …
solve combinatorial optimization problems. In recent years, advances in quantum …
Quantum information processing with superconducting circuits: a review
G Wendin - Reports on Progress in Physics, 2017 - iopscience.iop.org
During the last ten years, superconducting circuits have passed from being interesting
physical devices to becoming contenders for near-future useful and scalable quantum …
physical devices to becoming contenders for near-future useful and scalable quantum …
Computing high-degree polynomial gradients in memory
Specialized function gradient computing hardware could greatly improve the performance of
state-of-the-art optimization algorithms. Prior work on such hardware, performed in the …
state-of-the-art optimization algorithms. Prior work on such hardware, performed in the …
Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
Solving combinatorial optimization problems of the kind that can be codified by quadratic
unconstrained binary optimization (QUBO) is a promising application of quantum …
unconstrained binary optimization (QUBO) is a promising application of quantum …
Augmenting an electronic Ising machine to effectively solve boolean satisfiability
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 …
attention is paid to novel paradigms such as Ising machines. They have very different …
A single-step multiclass SVM based on quantum annealing for remote sensing data classification
In recent years, the development of quantum annealers has enabled experimental
demonstrations and has increased research interest in applications of quantum annealing …
demonstrations and has increased research interest in applications of quantum annealing …
[HTML][HTML] GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
We study large-scale applications using a GPU-accelerated version of the massively parallel
Jülich universal quantum computer simulator (JUQCS–G). First, we benchmark JUWELS …
Jülich universal quantum computer simulator (JUQCS–G). First, we benchmark JUWELS …
Comparing three generations of d-wave quantum annealers for minor embedded combinatorial optimization problems
E Pelofske - Quantum Science and Technology, 2023 - iopscience.iop.org
Quantum annealing is a novel type of analog computation that aims to use quantum
mechanical fluctuations to search for optimal solutions of Ising problems. Quantum …
mechanical fluctuations to search for optimal solutions of Ising problems. Quantum …
Folding lattice proteins with quantum annealing
Quantum annealing is a promising approach for obtaining good approximate solutions to
difficult optimization problems. Folding a protein sequence into its minimum-energy structure …
difficult optimization problems. Folding a protein sequence into its minimum-energy structure …
Paving the way to hybrid quantum–classical scientific workflows
The increasing growth of data volume, and the consequent explosion in demand for
computational power, are affecting scientific computing, as shown by the rise of extreme …
computational power, are affecting scientific computing, as shown by the rise of extreme …