An Overview of Approaches to Modernize Quantum Annealing Using Local Searches [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 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.
Chancellor, Nicholas
core +3 more sources
Traffic signal optimization on a square lattice with quantum annealing. [PDF]
Sci Rep, 2021 The spread of intelligent transportation systems in urban cities has caused heavy computational loads, requiring a novel architecture for managing large-scale traffic.
Inoue D +4 more
europepmc +2 more sources
Superconducting quantum circuit of NOR in quantum annealing. [PDF]
Sci Rep, 2022 Abstract One possible way to improve the applicability of quantum annealing to various problems is to express the Hamiltonian using a circuit satisfiability problem. The NOR logic function serves as a basic unit for implementing the Hamiltonian for the superconducting quantum circuit.
Saida D +4 more
europepmc +5 more sources
Open system quantum annealing in mean field models with exponential degeneracy
Physical Review X, 2015 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 device which ...
Kechedzhi, Kostyantyn +1 more
core +3 more sources
Embedding Overhead Scaling of Optimization Problems in Quantum Annealing [PDF]
PRX Quantum, 2021 In order to treat all-to-all connected quadratic binary optimization problems (QUBO) with hardware quantum annealers, an embedding of the original problem is required due to the sparsity of the hardware's topology.
M. Könz +3 more
semanticscholar +2 more sources
Quantum annealing with Jarzynski equality [PDF]
Physical Review Letters, 2010 We show a practical application of the Jarzynski equality in quantum computation. Its implementation may open a way to solve combinatorial optimization problems, minimization of a real single-valued function, cost function, with many arguments.
A. K. Hartmann +2 more
core +3 more sources
Quantum annealing with special drivers for circuit fault diagnostics. [PDF]
Sci Rep, 2022 Leipold H, Spedalieri FM.
europepmc +3 more sources
Demonstration of a scaling advantage for a quantum annealer over simulated annealing
Physical Review X, 2018 The observation of an unequivocal quantum speedup remains an elusive objective for quantum computing. The D-Wave quantum annealing processors have been at the forefront of experimental attempts to address this goal, given their relatively large numbers ...
Albash, Tameem, Lidar, Daniel A.
core +2 more sources
Application of Quantum Annealing to Nurse Scheduling Problem
Scientific Reports, 2019 Quantum annealing is a promising heuristic method to solve combinatorial optimization problems, and efforts to quantify performance on real-world problems provide insights into how this approach may be best used in practice.
Humble, Travis S. +2 more
core +2 more sources
Quantum annealing initialization of the quantum approximate optimization algorithm [PDF]
Quantum, 2021 The quantum approximate optimization algorithm (QAOA) is a prospective near-term quantum algorithm due to its modest circuit depth and promising benchmarks.
Stefan H. Sack, Maksym Serbyn
semanticscholar +1 more source