A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

The next few years will be exciting as prototype universal quantum processors emerge,
enabling the implementation of a wider variety of algorithms. Of particular interest are …

We review encoding and hardware-independent formulations of optimization problems for
quantum computing. Using this generalized approach, an extensive library of optimization …

In this paper I propose a new method of encoding discrete variables into Ising model qubits
for quantum optimisation. The new method is based on the physics of domain walls in one …

Constrained optimization problems are ubiquitous in science and industry. Quantum
algorithms have shown promise in solving optimization problems, yet none of the current …

The quantum approximate optimization algorithm/quantum alternating operator ansatz
(QAOA) is a heuristic to find approximate solutions of combinatorial optimization problems …

Map** functions on bits to Hamiltonians acting on qubits has many applications in
quantum computing. In particular, Hamiltonians representing Boolean functions are required …

Quantum computation appears to offer significant advantages over classical computation
and this has generated a tremendous interest in the field. In this thesis we study the …

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 …

Quantum annealing is a generic solver for optimization problems that uses fictitious quantum
fluctuation. The most groundbreaking progress in the research field of quantum annealing is …