English
Related papers

Related papers: Quantum annealing sampling with a bias field

200 papers

Quantum annealing is a method to solve optimization problems that leverages quantum tunneling in a coupled qubit system. We present a detailed study of the coherence of a tunable capacitively-shunted flux qubit, designed for coherent…

Quantum computing, along with quantum metrology and quantum communication, are disruptive technologies that promise, in the near future, to impact different sectors of academic research and industry. Among the computational challenges with…

In this work we revisit and expand on a 2015 study that used a D-Wave quantum annealer as a sampling engine to assist in the training of a Deep Neural Network. The original 2015 results were reproduced using more recent D-Wave hardware. We…

Quantum Physics · Physics 2020-09-02 Joshua Job , Steve Adachi

We study algorithms inspired by quantum annealing that are suited for the NISQ era. First, we analyze approximate quantum annealing (AQA), which employs a discretized annealing ansatz in which the time step and the number of layers are…

Quantum Physics · Physics 2026-04-29 Rijul Sachdeva , Vrinda Mehta , Manpreet Singh Jattana , Kristel Michielsen , Fengping Jin

Advancements in quantum computing are fuelling emerging applications across disciplines, including finance, where quantum and quantum-inspired algorithms can now make market predictions, detect fraud, and optimize portfolios. Expanding this…

Quantum Physics · Physics 2023-01-06 Anna G. Hughes , Jack S. Baker , Santosh Kumar Radha

Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by…

Quantum Physics · Physics 2017-05-10 Tobias Graß , Maciej Lewenstein

Quantum annealing (QA) has been proposed as a quantum enhanced optimization heuristic exploiting tunneling. Here, we demonstrate how finite range tunneling can provide considerable computational advantage. For a crafted problem designed to…

Quantum annealers have been designed to propose near-optimal solutions to NP-hard optimization problems. However, the accuracy of current annealers such as the ones of D-Wave Systems, Inc., is limited by environmental noise and hardware…

Quantum Physics · Physics 2022-10-27 Aaron Barbosa , Elijah Pelofske , Georg Hahn , Hristo N. Djidjev

D-Wave quantum annealers represent a novel computational architecture and have attracted significant interest, but have been used for few real-world computations. Machine learning has been identified as an area where quantum annealing may…

Machine Learning · Computer Science 2019-03-06 Daniel O'Malley , Velimir V. Vesselinov , Boian S. Alexandrov , Ludmil B. Alexandrov

Quantum annealing aims to solve combinatorial optimization problems mapped on to Ising interactions between quantum spins. A critical factor that limits the success of a quantum annealer is its sensitivity to noise, and intensive research…

Quantum Physics · Physics 2019-01-29 Shruti Puri , Christian Kraglund Andersen , Arne L. Grimsmo , Alexandre Blais

We present a quantum annealing-based solution method for topology optimization (TO). In particular, we consider TO in a more general setting, i.e., applied to structures of continuum domains where designs are represented as distributed…

Numerical Analysis · Mathematics 2023-01-30 Zisheng Ye , Xiaoping Qian , Wenxiao Pan

Algorithmic Bias can be due to bias in the training data or issues with the algorithm itself. These algorithmic issues typically relate to problems with model capacity and regularisation. This underestimation bias may arise because the…

Machine Learning · Computer Science 2021-06-01 William Blanzeisky , Pádraig Cunningham

An important task in multi-objective optimization is generating the Pareto front -- the set of all Pareto-optimal compromises among multiple objective functions applied to the same set of variables. Since this task can be computationally…

Quantum Physics · Physics 2025-11-04 Andrew D. King

Quantum annealing is getting increasing attention in combinatorial optimization. The quantum processing unit by D-Wave is constructed to approximately solve Ising models on so-called Chimera graphs. Ising models are equivalent to quadratic…

Data Structures and Algorithms · Computer Science 2019-04-30 Michael Juenger , Elisabeth Lobe , Petra Mutzel , Gerhard Reinelt , Franz Rendl , Giovanni Rinaldi , Tobias Stollenwerk

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…

Quantum Physics · Physics 2017-04-27 E. C. Behrman , J. E. Steck , M. A. Moustafa

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 Physics · Physics 2023-07-20 Ameya Bhave , Ajinkya Borle

The use of quantum annealers in black-box optimization to obtain the desired properties of a product with a small number of trials has attracted attention. However, the application of this technique to engineering design problems is still…

We present a novel methodology for automated feature subset selection from a pool of physiological signals using Quantum Annealing (QA). As a case study, we will investigate the effectiveness of QA-based feature selection techniques in…

Quantum Physics · Physics 2021-06-10 Rajdeep Kumar Nath , Himanshu Thapliyal , Travis S. Humble

Real life quantum computers are inevitably affected by intrinsic noise resulting in dissipative non-unitary dynamics realized by these devices. We consider an open system quantum annealing algorithm optimized for a realistic analog quantum…

Quantum Physics · Physics 2016-06-08 Kostyantyn Kechedzhi , Vadim N. Smelyanskiy

We explore the applicability of quantum annealing to the approximation task of curve fitting. To this end, we consider a function that shall approximate a given set of data points and is written as a finite linear combination of…

Optimization and Control · Mathematics 2026-02-27 Philipp Isserstedt , Daniel Jaroszewski , Wolfgang Mergenthaler , Felix Paul , Bastian Harrach