Results 41 to 50 of about 1,815,218 (351)
Reverse annealing for nonnegative/binary matrix factorization.
PLoS ONE, 2021 It was recently shown that quantum annealing can be used as an effective, fast subroutine in certain types of matrix factorization algorithms. The quantum annealing algorithm performed best for quick, approximate answers, but performance rapidly ...
John Golden, Daniel O'Malley
doaj +1 more source
Quantum Annealing with Inequality Constraints: The Set Cover Problem [PDF]
Advanced Quantum Technologies, 2023 Quantum annealing is a promising method for solving hard optimization problems by transforming them into quadratic unconstrained binary optimization (QUBO) problems.
H. Djidjev
semanticscholar +1 more source
IEEE Access, 2023 Simulated Quantum Annealing (SQA) is a heuristic algorithm which can solve Quadratic Unconstrained Binary Optimization (QUBO) problems by emulating the exploration of the solution space done by a quantum annealer.
Deborah Volpe +3 more
doaj +1 more source
Short-depth QAOA circuits and quantum annealing on higher-order ising models
npj Quantum Information, 2023 We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and QA (Quantum Annealing) on 127 qubit problem instances.
Elijah Pelofske +2 more
semanticscholar +1 more source
On the emerging potential of quantum annealing hardware for combinatorial optimization [PDF]
Journal of Heuristics, 2022 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 provide an ...
Byron Tasseff +6 more
semanticscholar +1 more source
Mean field approximation for solving QUBO problems.
PLoS ONE, 2022 The Quadratic Unconstrained Binary Optimization (QUBO) problem is NP-hard. Some exact methods like the Branch-and-Bound algorithm are suitable for small problems.
Máté Tibor Veszeli, Gábor Vattay
doaj +1 more source
Optimization of connection patterns between mobile phones and base stations using quantum annealing. [PDF]
Sci RepIn 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.
Takabayashi T +4 more
europepmc +2 more sources
IEEE Access, 2023 Quantum annealing has the potential to outperform classical transistor-based computer technologies in tackling intricate combinatorial optimization problems. However, ongoing scientific debates cast doubts on whether quantum annealing devices (or quantum
Jehn-Ruey Jiang, Chun-Wei Chu
semanticscholar +1 more source
A quantum annealing approach to ionic diffusion in solids. [PDF]
Sci Rep, 2021 We have developed a framework for using quantum annealing computation to evaluate a key quantity in ionic diffusion in solids, the correlation factor.
Utimula K +5 more
europepmc +2 more sources
Journal of Applied Physics, 2023 Using quantum computers for computational chemistry and materials science will enable us to tackle problems that are intractable on classical computers. In this paper, we show how the relative energy of defective graphene structures can be calculated by ...
B. Camino +4 more
semanticscholar +1 more source