Results 31 to 40 of about 116,832 (272)
A quantum annealing approach to solve max-cover problem
Tạp chí Khoa học, 2022 The Max-Cover is a NP-hard problem. Therefore, the heuristic approach is suitable to solve this problem for large instances. Quantum annealing is a heuristic quantum optimization algorithm that can be used to handle the Max-Cover problem.
NGUYEN Thi Uyen +3 more
doaj +1 more source
On quantum annealing without a physical quantum annealer
IET Conference Proceedings, 2023 9 pages, 4 ...
Bhave, Ameya, Borle, Ajinkya
openaire +2 more sources
The quantum annealing gap and quench dynamics in the exact cover problem [PDF]
Quantum, 2022 Quenching and annealing are extreme opposites in the time evolution of a quantum system: Annealing explores equilibrium phases of a Hamiltonian with slowly changing parameters and can be exploited as a tool for solving complex optimization problems.
Bernhard Irsigler, Tobias Grass
doaj +1 more source
Quantum annealing: an overview
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
openaire +3 more sources
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
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
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
Customized Quantum Annealing Schedules
Physical Review Applied, 2022 In a typical quantum annealing protocol, the system starts with a transverse field Hamiltonian which is gradually turned off and replaced by a longitudinal Ising Hamiltonian. The ground state of the Ising Hamiltonian encodes the solution to the computational problem of interest, and the state overlap with this ground state gives the success probability
Mostafa Khezri +5 more
openaire +2 more sources
Single-Qubit Fidelity Assessment of Quantum Annealing Hardware
IEEE Transactions on Quantum Engineering, 2021 As a wide variety of quantum computing platforms become available, methods for assessing and comparing the performance of these devices are of increasing interest and importance.
Jon Nelson +3 more
doaj +1 more source
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