The Fujitsu Digital Annealer is designed to solve fully connected quadratic unconstrained
binary optimization (QUBO) problems. It is implemented on application-specific CMOS …

We propose and implement a family of quantum-informed recursive optimization (QIRO)
algorithms for combinatorial optimization problems. Our approach leverages quantum …

Solving larger-sized problems is an important area of research in quantum computing.
Designing hybrid quantumclassical algorithms is a promising approach to solving this. We …

Solving combinatorial optimization problems on current noisy quantum devices is currently
being advocated for (and restricted to) binary polynomial optimization with equality …

In this article, we experimentally test the performance of the recently proposed domain-wall
encoding of discrete variables Chancellor, 2019, on Ising model flux qubit quantum …

In recent years, a number of quantum computing devices with small numbers of qubits have
become available. A hybrid quantum local search (QLS) approach that combines a classical …

Physical implementations of quantum annealing unavoidably operate at finite temperatures.
We point to a fundamental limitation of fixed finite temperature quantum annealers that …

We present a novel and flexible method to optimize the phase response of reflective
metasurfaces (MSs) toward the desired scattering profile. The scattering power is expressed …

There have been multiple attempts to demonstrate that quantum annealing and, in
particular, quantum annealing on quantum-annealing machines, has the potential to …

A shorter processing time is desirable for quantum computation to minimize the effects of
noise. We propose a simple procedure to variationally determine a set of parameters in the …