Related papers: Advanced anneal paths for improved quantum anneali…
Quantum annealing is a promising paradigm for building practical quantum computers. Compared to other approaches, quantum annealing technology has been scaled up to a larger number of qubits. On the other hand, deep learning has been…
Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of…
Quantum annealing aims at solving hard computational problems through adiabatic state preparation. Here, I propose to use inhomogeneous longitudinal magnetic fields to enhance the efficiency of the annealing. Such fields are able to bias…
In the computational model of quantum annealing, the size of the minimum gap between the ground state and the first excited state of the system is of particular importance, since it is inversely proportional to the running time of the…
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…
In this dissertation, we explore how quantum annealing (QA) and its applications behave in an open system setting. We give derivations and numerical recipes for effective parallel simulation methods for time-dependent open dynamics of…
Genetic algorithms, which mimic evolutionary processes to solve optimization problems, can be enhanced by using powerful semi-local search algorithms as mutation operators. Here, we introduce reverse quantum annealing, a class of quantum…
Reverse annealing is a variant of quantum annealing that starts from a given classical configuration of spins (qubits). In contrast to the conventional formulation, where one starts from a uniform superposition of all possible states…
Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of much debate. Thus far, experimental benchmarking studies have indicated that quantum annealing hardware does not…
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 Ising model, implemented on D-Wave QPUs, are…
Optimal parameter setting for applications problems embedded into hardware graphs is key to practical quantum annealers (QA). Embedding chains typically crop up as harmful Griffiths phases, but can be used as a resource as we show here: to…
Optimizing the training of a machine learning pipeline helps in reducing training costs and improving model performance. One such optimizing strategy is quantum annealing, which is an emerging computing paradigm that has shown potential in…
Quantum annealing is an emerging metaheuristic used for solving combinatorial optimisation problems. However, hardware based physical quantum annealers are primarily limited to a single vendor. As an alternative, we can discretise the…
Quantum annealing has the potential to provide a speedup over classical algorithms in solving optimization problems. Just as for any other quantum device, suppressing Hamiltonian control errors will be necessary before quantum annealers can…
Quantum annealing has great promise in leveraging quantum mechanics to solve combinatorial optimisation problems. However, to realize this promise to it's fullest extent we must appropriately leverage the underlying physics. In this spirit,…
We investigate the computational efficiency and thermodynamic cost of the D-Wave quantum annealer under reverse-annealing with and without pausing. Our experimental results demonstrate that the combination of reverse-annealing and pausing…
Although many efficient heuristics have been developed to solve binary optimization problems, these typically produce correlated solutions for degenerate problems. Most notably, transverse-field quantum annealing - the heuristic employed in…
Reverse annealing is a variant of quantum annealing, in which the system is prepared in a classical state, reverse-annealed to an inversion point, and then forward-annealed. We report on reverse annealing experiments using the D-Wave 2000Q…
Quantum annealing is a way to prepare an eigenstate of the problem Hamiltonian. Starting from an eigenstate of a trivial Hamiltonian, we slowly change the Hamiltonian to the problem Hamiltonian, and the system remains in the eigenstate of…
Quantum annealing has emerged as a promising approach for solving NP-hard optimization problems, leveraging quantum phenomena such as quantum tunneling to navigate complex energy landscapes. However, the extent to which quantum tunneling…