Results 61 to 70 of about 1,254,139 (165)

Tight Lieb–Robinson Bound for approximation ratio in quantum annealing

npj Quantum Information
Quantum annealing (QA) holds promise for optimization problems in quantum computing, especially for combinatorial optimization. This analog framework attracts attention for its potential to address complex problems.
Arthur Braida, Simon Martiel, Ioan Todinca   +2 more
doaj   +1 more source

Microenvironment Modulation‐Based Nanomaterial‐Loaded Hydrogel Dressings for Diabetic Foot Ulcers: Research Progress and Future Perspectives

Advanced Materials Interfaces, Volume 13, Issue 5, 4 March 2026.
ABSTRACT Diabetic foot ulcer (DFU) is a chronic complication of diabetes, primarily caused by hyperglycemia, peripheral vascular disease, and neuropathy. Characterized by persistent hyperglycemia, impaired perfusion, inflammation, and infection, DFUs pose significant challenges to healing and are associated with high morbidity and amputation rates ...
Tang Yuqing, Chen Hong, Fan Weijing, Huang Renyan, You Yang, Liu Guobin   +5 more
wiley   +1 more source

Restricting the search space to boost Quantum Annealing performance

, 2016
International audienceWe are interested in Quantum Annealing (QA), an algorithm inspired by quantum theory and Simulated Annealing (SA). It is based on quantum replicas, which explore an energy surface, and are less prone to be trapped in local minima ...
Cavarec, Baptiste, Pierre Berge, Baptiste Cavarec, Tomasik, Joanna, Arpad Rimmel, Joanna Tomasik, Bergé, Pierre, Rimmel, Arpad   +7 more
core   +1 more source

On quantum phase crossovers in finite systems [PDF]

, 2006
In this work we define a formal notion of a quantum phase crossover for certain Bethe ansatz solvable models. The approach we adopt exploits an exact mapping of the spectrum of a many-body integrable system, which admits an exact Bethe ansatz solution ...
Hibberd, Katrina E., Dunning, Clare, Links, Jon   +2 more
core   +1 more source

Universal resources for quantum approximate optimization algorithm and quantum annealing

Physical Review Research
The quantum approximate optimization algorithm (QAOA) is a variational ansatz that resembles the Trotterized dynamics of a quantum annealing (QA) protocol.
Pablo Díez-Valle, Fernando J. Gómez-Ruiz, Diego Porras, Juan José García-Ripoll   +3 more
doaj   +1 more source

Cuckoo-PC: An Evolutionary Synchronization-Aware Placement of SDN Controllers for Optimizing the Network Performance in WSNs

Sensors, 2020
Due to reliability and performance considerations, employing multiple software-defined networking (SDN) controllers is known as a promising technique in Wireless Sensor Networks (WSNs).
Shirin Tahmasebi, Mohadeseh Safi, Somayeh Zolfi, Mohammad Reza Maghsoudi, Hamid Reza Faragardi, Hossein Fotouhi   +5 more
doaj   +1 more source

Quantum annealing with symmetric subspaces [PDF]

, 2022
Quantum annealing (QA) is a promising approach for not only solving combinatorial optimization problems but also simulating quantum many-body systems such as those in condensed matter physics. However, non-adiabatic transitions constitute a key challenge
Imoto, Takashi, Seki, Yuya, Matsuzaki, Yuichiro   +2 more
core   +1 more source

Computer-Aided Quantum Algorithms for Real-Time Energy Market Trading

IEEE Access
This study presents an innovative approach for optimizing real-time energy market trading strategies by integrating Proximal Policy Optimization (PPO) with Quantum Annealing (QA).
Jinghui Wu, Wenjun Zhu, Yun Xu, Kangan Shu, Wei Yang   +4 more
doaj   +1 more source

Direct comparison of quantum and simulated annealing on a fully connected Ising ferromagnet [PDF]

, 2017
We compare the performance of quantum annealing (QA, through Schrödinger dynamics) and simulated annealing (SA, through a classical master equation) on the p-spin infinite range ferromagnetic Ising model, by slowly driving the system across its ...
Nishimori, Hidetoshi, Santoro, Giuseppe E., SANTORO, Giuseppe Ernesto, Giuseppe E. Santoro, Fazio, Rosario, Rosario Fazio, Matteo M. Wauters, Wauters, Matteo M., Hidetoshi Nishimori   +8 more
core   +1 more source

Comparing gate and annealing-based quantum computing for configuration-based design tasks

Design Science
Complete exploration of design spaces is often computationally prohibitive. Classical search methods offer a solution but are limited by challenges like local optima and an inability to traverse dislocated design spaces.
Oliver Schiffmann, James Gopsill, Ben Hicks   +2 more
doaj   +1 more source