Parallel quantum annealing [PDF]
Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after quantum ...
Elijah Pelofske +2 more
doaj +5 more sources
Advantages of Unfair Quantum Ground-State Sampling [PDF]
The debate around the potential superiority of quantum annealers over their classical counterparts has been ongoing since the inception of the field.
Brian Hu Zhang +3 more
doaj +6 more sources
An Overview of Approaches to Modernize Quantum Annealing Using Local Searches [PDF]
I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm.
Nicholas Chancellor
doaj +4 more sources
Generation of multipartite entanglement between spin-1 particles with bifurcation-based quantum annealing [PDF]
Quantum annealing is a way to solve a combinational optimization problem where quantum fluctuation is induced by transverse fields. Recently, a bifurcation-based quantum annealing with spin-1 particles was suggested as another mechanism to implement the ...
Yuichiro Matsuzaki +2 more
doaj +2 more sources
Nonnegative/Binary matrix factorization for image classification using quantum annealing [PDF]
Classical computing has borne witness to the development of machine learning. The integration of quantum technology into this mix will lead to unimaginable benefits and be regarded as a giant leap forward in mankind’s ability to compute.
Hinako Asaoka, Kazue Kudo
doaj +2 more sources
Solving large break minimization problems in a mirrored double round-robin tournament using quantum annealing. [PDF]
Quantum annealing has gained considerable attention because it can be applied to combinatorial optimization problems, which have numerous applications in logistics, scheduling, and finance.
Michiya Kuramata +2 more
doaj +2 more sources
Quantum Speedup by Quantum Annealing
We study the glued-trees problem of Childs et. al. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible.
A. Das +12 more
core +4 more sources
Open-System Quantum Annealing in Mean-Field Models with Exponential Degeneracy*
Real-life quantum computers are inevitably affected by intrinsic noise resulting in dissipative nonunitary dynamics realized by these devices. We consider an open-system quantum annealing algorithm optimized for such a realistic analog quantum device ...
Kostyantyn Kechedzhi +1 more
doaj +3 more sources
Solving the resource constrained project scheduling problem with quantum annealing [PDF]
Quantum annealing emerges as a promising approach for tackling complex scheduling problems such as the resource-constrained project scheduling problem (RCPSP). This study represents the first application of quantum annealing to solve the RCPSP, analyzing
Luis Fernando Pérez Armas +2 more
doaj +2 more sources
Optimization of connection patterns between mobile phones and base stations using quantum annealing [PDF]
In current mobile networks, optimizing which base station a mobile phone in a particular area connects to is crucial for ensuring good communication quality for each mobile phone but presents a challenging combinatorial optimization problem.
Taisei Takabayashi +4 more
doaj +2 more sources

