Copertina

Advances in Quantum Genetic Algorithms

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lima, Dennis, Saini, Rakesh, Al-Kuwari, Saif
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Quantum Physics 68W50, 68Q12 J.2; G.1.6; F.2.1
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Quantum walk informed variational algorithm design
di: Matwiejew, Edric, et al.
Pubblicazione: (2024)

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
di: Gratton, Serge, et al.
Pubblicazione: (2026)

Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer
di: Hancock, James, et al.
Pubblicazione: (2023)

Reliable Optimization Under Noise in Quantum Variational Algorithms
di: Novák, Vojtěch, et al.
Pubblicazione: (2025)

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
di: Ryabchenko, Alexander, et al.
Pubblicazione: (2026)

Introducing the Quantum Economic Advantage Online Calculator
di: Mejia, Frederick, et al.
Pubblicazione: (2025)

Investigating methods to solve large windfarm optimization problems with a minimum number of qubits using circuit-based quantum computers
di: Hancock, James, et al.
Pubblicazione: (2025)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
di: Gratton, Serge, et al.
Pubblicazione: (2024)

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
di: Bellavia, S., et al.
Pubblicazione: (2025)

Quantum Algorithm for Local-Volatility Option Pricing via the Kolmogorov Equation
di: Guseynov, Nikita, et al.
Pubblicazione: (2025)

Algorithms for Generating Small Random Samples
di: Cicirello, Vincent A.
Pubblicazione: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
di: Opris, Andre, et al.
Pubblicazione: (2024)

On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm
di: Cicirello, Vincent A.
Pubblicazione: (2024)

Quantum Deep Learning Still Needs a Quantum Leap
di: Gundlach, Hans, et al.
Pubblicazione: (2025)

An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources
di: Anagnostopoulos, Theodoros, et al.
Pubblicazione: (2026)

Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
di: Bärligea, Adelina, et al.
Pubblicazione: (2025)

Quantum Annealing and Tensor Networks: a Powerful Combination to Solve Optimization Problems
di: Binimelis, Miquel Albertí
Pubblicazione: (2024)

Examples of slow convergence for adaptive regularization optimization methods are not isolated
di: Toint, Philippe L.
Pubblicazione: (2024)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
di: Gratton, Serge, et al.
Pubblicazione: (2024)

Quantum Advantage in Computational Chemistry?
di: Gundlach, Hans, et al.
Pubblicazione: (2025)

Optimization Strategies for Variational Quantum Algorithms in Noisy Landscapes
di: Novák, Vojtěch, et al.
Pubblicazione: (2025)

Hybrid LLM and Higher-Order Quantum Approximate Optimization for CSA Collateral Management
di: Jin, Tao, et al.
Pubblicazione: (2025)

Efficient explicit circuit for quantum state preparation of piecewise continuous functions
di: Guseynov, Nikita, et al.
Pubblicazione: (2024)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
di: Emmerich, Michael T. M., et al.
Pubblicazione: (2026)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
di: Kumar, Mrinal, et al.
Pubblicazione: (2018)

Socio-cognitive agent-oriented evolutionary algorithm with trust-based optimization
di: Urbańczyk, Aleksandra, et al.
Pubblicazione: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems
di: Opris, Andre, et al.
Pubblicazione: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
di: Opris, Andre
Pubblicazione: (2025)

The Bottom-Left Algorithm for the Strip Packing Problem
di: Hougardy, Stefan, et al.
Pubblicazione: (2024)

Spectrally Adapted Physics-Informed Neural Networks for Solving Unbounded Domain Problems
di: Xia, Mingtao, et al.
Pubblicazione: (2022)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
di: Emmerich, Michael T. M.
Pubblicazione: (2026)

Computational Phase Transitions in Binary Compressed Sensing: Quantum Annealing Inside the Relaxation Gap
di: Hahn, William, et al.
Pubblicazione: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
di: Hoang, Hung P., et al.
Pubblicazione: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Quantum-Inspired Reinforcement Learning in the Presence of Epistemic Ambivalence
di: Habibi, Alireza, et al.
Pubblicazione: (2025)

Efficient Binary Decision Diagram Manipulation in External Memory
di: Sølvsten, Steffan Christ, et al.
Pubblicazione: (2021)

Quantum Framework for Simulating Linear PDEs with Robin Boundary Conditions
di: Guseynov, Nikita, et al.
Pubblicazione: (2025)

PackSELL: A Sparse Matrix Format for Precision-Agnostic High-Performance SpMV
di: Suzuki, Kengo, et al.
Pubblicazione: (2026)