Journal Article10.1007/s00158-025-04085-w
Quantum mapping algorithm for structural non-probabilistic reliability optimization
Yusheng Xu,Xiaojun Wang,Zhenghuan Wang +2 more
About: This article is published in Structural and Multidisciplinary Optimization. The article was published on 01 Jul 2025. The article focuses on the topics: Probabilistic logic & Reliability (semiconductor).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Posted Content
A fast quantum mechanical algorithm for database search
TL;DR: In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
4.9K
Quantum algorithm for linear systems of equations.
TL;DR: This work exhibits a quantum algorithm for estimating x(-->)(dagger) Mx(-->) whose runtime is a polynomial of log(N) and kappa, and proves that any classical algorithm for this problem generically requires exponentially more time than this quantum algorithm.
Variational Quantum Algorithms
Marco Cerezo,Marco Cerezo,Andrew Arrasmith,Andrew Arrasmith,Ryan Babbush,Simon C. Benjamin,Suguru Endo,Keisuke Fujii,Jarrod R. McClean,Kosuke Mitarai,Kosuke Mitarai,Xiao Yuan,Xiao Yuan,Lukasz Cincio,Lukasz Cincio,Patrick J. Coles,Patrick J. Coles +16 more
TL;DR: An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed.
Optimization under uncertainty: state-of-the-art and opportunities
TL;DR: This paper reviews theory and methodology that have been developed to cope with the complexity of optimization problems under uncertainty and discusses and contrast the classical recourse-based stochastic programming, robust stochastics programming, probabilistic (chance-constraint) programming, fuzzy programming, and stochastically dynamic programming.
1.2K
Quantum algorithms: an overview
TL;DR: A survey of known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details, including a discussion of recent developments and near-term applications.