101,720 research outputs found
Multistart Methods for Quantum Approximate Optimization
Hybrid quantum-classical algorithms such as the quantum approximate
optimization algorithm (QAOA) are considered one of the most promising
approaches for leveraging near-term quantum computers for practical
applications. Such algorithms are often implemented in a variational form,
combining classical optimization methods with a quantum machine to find
parameters to maximize performance. The quality of the QAOA solution depends
heavily on quality of the parameters produced by the classical optimizer.
Moreover, the presence of multiple local optima in the space of parameters
makes it harder for the classical optimizer. In this paper we study the use of
a multistart optimization approach within a QAOA framework to improve the
performance of quantum machines on important graph clustering problems. We also
demonstrate that reusing the optimal parameters from similar problems can
improve the performance of classical optimization methods, expanding on similar
results for MAXCUT
Computer-Aided Conceptual Design Through TRIZ-based Manipulation of Topological Optimizations
Organised by: Cranfield UniversityIn a recent project the authors proposed the adoption of Optimization Systems [1] as a bridging element
between Computer-Aided Innovation (CAI) and PLM to identify geometrical contradictions [2], a particular
case of the TRIZ physical contradiction [3].
A further development of the research has revealed that the solutions obtained from several topological
optimizations can be considered as elementary customized modeling features for a specific design task. The
topology overcoming the arising geometrical contradiction can be obtained through a manipulation of the
density distributions constituting the conflicting pair. Already two strategies of density combination have been
identified as capable to solve geometrical contradictions.Mori Seiki – The Machine Tool Compan
Hybrid Optimization Schemes for Quantum Control
Optimal control theory is a powerful tool for solving control problems in
quantum mechanics, ranging from the control of chemical reactions to the
implementation of gates in a quantum computer. Gradient-based optimization
methods are able to find high fidelity controls, but require considerable
numerical effort and often yield highly complex solutions. We propose here to
employ a two-stage optimization scheme to significantly speed up convergence
and achieve simpler controls. The control is initially parametrized using only
a few free parameters, such that optimization in this pruned search space can
be performed with a simplex method. The result, considered now simply as an
arbitrary function on a time grid, is the starting point for further
optimization with a gradient-based method that can quickly converge to high
fidelities. We illustrate the success of this hybrid technique by optimizing a
holonomic phasegate for two superconducting transmon qubits coupled with a
shared transmission line resonator, showing that a combination of Nelder-Mead
simplex and Krotov's method yields considerably better results than either one
of the two methods alone.Comment: 17 pages, 5 figures, 2 table
Metaheuristic design of feedforward neural networks: a review of two decades of research
Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era
- …