Related papers: Spin-1 quantum annealing with anisotropy-controlle…
Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealers that promise to solve certain combinatorial optimization problems of practical relevance faster than their…
Quantum annealing provides a promising route for the development of quantum optimization devices, but the usefulness of such devices will be limited in part by the range of implementable problems as dictated by hardware constraints. To…
Here we first discuss briefly the quantum annealing technique. We then study the quantum annealing of Sherrington-Kirkpatrick spin glass model with the tuning of both transverse and longitudinal fields. Both the fields are time-dependent…
The presence of a bias field, encoding some information about the target state, can enhance the performance of quantum optimization methods. Here we investigate the effect of such a bias field on the outcome of quantum annealing sampling,…
The spread of intelligent transportation systems in urban cities has caused heavy computational loads, requiring a novel architecture for managing large-scale traffic. In this study, we develop a method for globally controlling traffic…
There are many factors that influence the design of quantum annealing processing units. Here we address the issue of improving quantum annealing processing unit designs from the point of view of the critical behavior of spin glasses. It has…
We study a quantum annealer where bosons mediate the Ising-type interactions between qubits. We compare the efficiency of ground state preparation for direct and mediated couplings, for which Ising and spin-boson Hamiltonian are employed…
A general time-dependent quantum system can be driven fast from its initial ground state to its final ground state without generating transitions by adding a steering term to the Hamiltonian. We show how this technique can be modified to…
We solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a…
We study the problem to infer the original ground state of a spin-glass Hamiltonian out of the information from the Hamiltonian with interactions deviated from the original ones. Our motivation comes from quantum annealing on a real device…
We suggest using the method of quantum annealing for computing the ground state of the Heisenberg spin chains. Our initial Hamiltonian describes a spin system in a highly non-uniform magnetic field. The initial Hamiltonian gradually…
Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines…
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 annealing in the transverse field Ising model, implemented on D-Wave…
To gain better insight into the complexity theory of quantum annealing, we propose and solve a class of spin systems which contain bottlenecks of the kind expected to dominate the runtime of quantum annealing as it tries to solve difficult…
The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations…
The new integrable quantum spin model is proposed. The model has a biaxial magnetic anisotropy of alternating coupling between spins together with multiple spin interactions. Our model gives the possibility to exactly find thermodynamic…
We derive lower bounds on the time needed for a quantum annealer to prepare the ground state of a target Hamiltonian. These bounds do not depend on the annealing schedule and can take the local structure of the Hamiltonian into account.…
Quantum annealers are commercial devices aiming to solve very hard computational problems named spin glasses. Just like in metallurgic annealing one slowly cools a ferrous metal, quantum annealers seek good solutions by slowly removing the…
Quantum annealing promises to solve complex combinatorial optimization problems faster than current transistor-based computer technologies. Although to date only one commercially-available quantum annealer is procurable, one can already…
We propose and develop a new procedure, whereby a quantum system can learn to anneal to a desired ground state. We demonstrate successful learning to produce an entangled state for a two-qubit system, then demonstrate generalizability to…