… A quite comprehensive picture of what has been achieved in this field until 1994 is documented
in the monographs of Altomare and Campiti ([8], see in particular Appendix D), Donner ([…

… Moreover we say that ƒ is strictly positive if f(x) > 0 for every xe X. If … Analogously, if f: X →
R and α € R, we say that ƒ converges to a at the point at infinity, if for every ɛ> 0 there exists a …

Entanglement lies at the core of quantum algorithms designed to solve problems that are
intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a …

Quantum simulation has emerged as a valuable arena for demonstrating and understanding
the capabilities of near-term quantum computers 1 , 2 – 3 . Quantum annealing 4 , 5 has …

We have developed a quantum annealing processor, based on an array of tunable coupled
rf-SQUID flux qubits, fabricated in a superconducting integrated circuit process. …

… Berger a Alan F. Cruess b Filiberto Altomare a Varun Chaudhary c Kevin Colleaux d Mark
Greve e Amin Kherani f Efrem D. Mandelcorn a Hugh Parsons g Marc-André Rhéaume h Eric …

… We estimate κ f for the three dynamics with varying J G from … κ f < κ c are expected beyond
the critical point (Supplementary Information section C(4)); we find a modest correction κ c − κ f …

Efforts to develop useful quantum computers have been blocked primarily by environmental
noise. Quantum annealing is a scheme of quantum computation that is predicted to be more …

… We consider the application of next-nearest-neighbour terms as a function f applied to the
coupling Hamiltonian J QA supplied to the processor, and seek a choice of J QA such that f(J …

Understanding magnetic phases in quantum mechanical systems is one of the essential
goals in condensed matter physics, and the advent of prototype quantum simulation hardware …