Simulated annealing Archives - IEEE Transactions on Quantum Engineering

Parallel Variational Quantum Algorithms With Gradient-Informed Restart to Speed Up Optimization in the Presence of Barren Plateaus

February 10, 2026Daniel Mastropietro, Georgios Korpas, Vyacheslav Kungurtsev, Jakub MarecekQuantum SoftwareApproximation algorithms, Cost function, Markov processes, Neural networks, Noise, Noise measurement, Quantum algorithm, Quantum circuit, Quantum entanglement, Simulated annealing

Abstract: Inspired by the Fleming–Viot stochastic process, we propose a parallel implementation with restart of variational quantum algorithms, with the aim of reducing the time spent by the algorithm in barren plateaus where the optimization direction is unclear. In the Fleming–Viot tradition, parallel searches are called particles. In the proposed approach, the search by a […]

Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing (May 2023)

September 13, 2023Megan C. GironQuantum ComputingCosts, Hardware, Optimization, Quantum annealing, Quantum computing, Security, Simulated annealing

Collateral optimization refers to the systematic allocation of financial assets to satisfy obligations or secure transactions while simultaneously minimizing costs and optimizing the usage of available resources. This involves assessing the number of characteristics, such as the cost of funding and quality of the underlying assets to ascertain the optimal collateral quantity to be posted […]

Solving the Max-Flow Problem on a Quantum Annealing Computer

October 14, 2020Thomas Krauss; Joey McCollum; Chapman Pendery; Sierra Litwin; Alan J. MichaelsOpen Access, Quantum Information, Quantum SoftwareAnnealing, Directed graphs, Linear programming, Qubit, Simulated annealing

This article addresses the question of implementing a maximum flow algorithm on directed graphs in a formulation suitable for a quantum annealing computer. Three distinct approaches are presented. In all three cases, the flow problem is formulated as a quadratic unconstrained binary optimization (QUBO) problem amenable to quantum annealing. The first implementation augments a graph […]