Results 1 to 10 of about 1,815,218 (351)
Parallel quantum annealing. [PDF]
Sci Rep, 2022 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 ...
Pelofske E, Hahn G, Djidjev HN.
europepmc +7 more sources
Initial State Encoding via Reverse Quantum Annealing and H-Gain Features. [PDF]
IEEE Trans Quantum Eng, 2023 Quantum annealing is a specialized type of quantum computation that aims to use quantum fluctuations in order to obtain global minimum solutions of combinatorial optimization problems.
Pelofske E, Hahn G, Djidjev H.
europepmc +5 more sources
Solving the resource constrained project scheduling problem with quantum annealing. [PDF]
Sci RepQuantum 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
Pérez Armas LF +2 more
europepmc +3 more sources
Quantum annealing: an overview [PDF]
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2022 In this review, after providing the basic physical concept behind quantum annealing (or adiabatic quantum computation), we present an overview of some recent theoretical as well as experimental developments pointing to the issues which are still debated.
Atanu Rajak +3 more
semanticscholar +4 more sources
On quantum annealing without a physical quantum annealer [PDF]
IET Conference Proceedings, 2023 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.
Ameya Bhave, Ajinkya Borle
semanticscholar +3 more sources
Faster annealing schedules for quantum annealing [PDF]
Journal of the Physical Society of Japan, 2007 New annealing schedules for quantum annealing are proposed based on the adiabatic theorem. These schedules exhibit faster decrease of the excitation probability than a linear schedule.
Das A. +9 more
core +4 more sources
A Quantum Annealing Bat Algorithm for Node Localization in Wireless Sensor Networks. [PDF]
Sensors (Basel), 2023 Node localization in two-dimensional (2D) and three-dimensional (3D) space for wireless sensor networks (WSNs) remains a hot research topic. To improve the localization accuracy and applicability, we first propose a quantum annealing bat algorithm (QABA)
Yu S, Zhu J, Lv C.
europepmc +2 more sources
Folding lattice proteins with quantum annealing [PDF]
Physical Review Research, 2022 Quantum annealing is a promising approach for obtaining good approximate solutions to difficult optimization problems. Folding a protein sequence into its minimum-energy structure represents such a problem. For testing new algorithms and technologies for
Anders Irbäck +3 more
openalex +3 more sources
Development of optimization method for truss structure by quantum annealing. [PDF]
Sci RepIn this study, we developed a new method of topology optimization for truss structures by quantum annealing. To perform quantum annealing analysis with real variables, representation of real numbers as a sum of random number combinations is employed. The
Honda R +6 more
europepmc +2 more sources
Engineering Reflective Metasurfaces With Ising Hamiltonian and Quantum Annealing [PDF]
IEEE Transactions on Antennas and Propagation, 2021 We present a novel and flexible method to optimize the phase response of reflective metasurfaces towards a desired scattering profile. The scattering power is expressed as a spin-chain Hamiltonian using the radar cross section formalism. For metasurfaces
Charles D. Ross +3 more
openalex +2 more sources