arXiv subjects

Haorui Yang

Publications and source records attributed to Haorui Yang.

4 recordsLinked to original sources

arXiv2026

A Quantum-Driven Evolutionary Framework for Solving High-Dimensional Sharpe Ratio Portfolio Optimization

High-dimensional portfolio optimization faces significant computational challenges under complex constraints, with traditional optimization methods struggling to balance convergence speed and global exploration capability. To address this, firstly, we introduce an enhanced Sharpe ratio-based model that incorporates all constraints into the objective function using adaptive penalty terms, transforming the original constrained problem into an unconstrained single-objective formulation. This approach preserves financial interpretability while simplifying algorithmic implementation. To efficiently solve the resulting high-dimensional optimization problem, we develop a Quantum Hybrid Differential Evolution (QHDE) algorithm, which introduces a dynamic quantum tunneling mechanism that enables individuals to probabilistically escape local optima, dramatically enhancing global exploration and solution flexibility. To further improve performance, a good point set-chaos reverse learning strategy generates a well-dispersed initial population, providing a robust and diverse starting point. Meanwhile, a dynamic elite pool combined with Cauchy-Gaussian hybrid perturbations maintains population diversity and mitigates premature convergence, ensuring stable and high-quality solutions. Experimental validation on CEC benchmarks and real-world portfolios involving 20 to 80 assets demonstrates that QHDE's performance improves by up to 96.6%. It attains faster convergence, higher solution precision, and greater robustness than seven state-of-the-art counterparts, thereby confirming its suitability for complex, high-dimensional portfolio optimization.

cs.NE↗

arXiv2025

A Quantum Tunneling and Bio-Phototactic Driven Enhanced Dwarf Mongoose Optimizer for UAV Trajectory Planning and Engineering Problem

With the widespread adoption of unmanned aerial vehicles (UAV), effective path planning has become increasingly important. Although traditional search methods have been extensively applied, metaheuristic algorithms have gained popularity due to their efficiency and problem-specific heuristics. However, challenges such as premature convergence and lack of solution diversity still hinder their performance in complex scenarios. To address these issues, this paper proposes an Enhanced Multi-Strategy Dwarf Mongoose Optimization (EDMO) algorithm, tailored for three-dimensional UAV trajectory planning in dynamic and obstacle-rich environments. EDMO integrates three novel strategies: (1) a Dynamic Quantum Tunneling Optimization Strategy (DQTOS) to enable particles to probabilistically escape local optima; (2) a Bio-phototactic Dynamic Focusing Search Strategy (BDFSS) inspired by microbial phototaxis for adaptive local refinement; and (3) an Orthogonal Lens Opposition-Based Learning (OLOBL) strategy to enhance global exploration through structured dimensional recombination. EDMO is benchmarked on 39 standard test functions from CEC2017 and CEC2020, outperforming 14 advanced algorithms in convergence speed, robustness, and optimization accuracy. Furthermore, real-world validations on UAV three-dimensional path planning and three engineering design tasks confirm its practical applicability and effectiveness in field robotics missions requiring intelligent, adaptive, and time-efficient planning.

cs.RO↗

arXiv2025

Distributed Shared Layered Storage Quantum Simulator: A novel quantum simulation system for efficient scaling and cost optimization

Quantum simulators are essential tools for developing and testing quantum algorithms. However, the high-frequency traversal characteristic of quantum simulators represents an unprecedented demand in the history of IT, and existing distributed technologies is unable to meet this requirement, resulting in a single-node bottleneck of quantum simulator. To overcome this limitation, this paper introduces a novel Distributed Shared Layered Storage Quantum Simulator (DSLSQS). By leveraging an innovative distributed architecture in which multiple computational nodes share data storage directly, together with De-TCP/IP networking technology, DSLSQS effectively eliminates East-West data flow in distributed systems. This approach mitigates the bottleneck of distributed quantum simulation clusters and enhances the scalability. Moreover, the system employs layered storage technology, which reduces usage of expensive high-performance memory and substantially lowers simulation costs. Furthermore, this paper systematically analyzes the performance and cost constraints of distributed quantum simulator cluster, identifying distributed networking as the primary performance bottleneck and highlighting that minimizing storage costs is crucial to reducing the total cost. Finally, experimental evaluations with a 27-qubit simulation confirm the successful implementation of layered storage within the quantum simulator. DSLSQS significantly enhances simulation efficiency, yielding a performance improvement of over 350% compared to existing distributed technologies. These results underscore the superior performance and scalability of the proposed architecture in managing complex quantum computing tasks. This paper provides crucial insights for the practical deployment of quantum computing and presents an effective framework for the development of distributed quantum simulation clusters.

cs.ET↗

arXiv2025

QVecOpt: An Efficient Storage and Computing Opti-mization Framework for Large-scale Quantum State Simulation

In response to the challenges in large-scale quantum state simulation on classical computing platforms, including memory limits, frequent disk I/O, and high computational complexity, this study builds upon a previously proposed hierarchical storage-based quantum simulation system and introduces an optimization framework, the Quantum Vector Optimization Framework (QVecOpt). QVecOpt integrates four strategies: amplitude pairing, cache optimization, block storage optimization, and parallel optimization. These collectively enhance state vector storage and computational scheduling. The amplitude pairing mechanism locates relevant amplitude pairs via bitwise XOR, reducing traversal complexity of single-qubit gates from $O(2^n)$ to $O(1)$. Cache optimization pre-allocates buffers and loads only required data, cutting disk I/O. Block storage optimization partitions the state vector for on-demand loading and local updates, reducing redundant access. Parallel optimization distributes the state vector across nodes for collaborative computation, achieving near-linear speedup. Complexity analysis shows that, compared with hierarchical storage simulation, the method reduces state vector traversals for single-qubit gates from $2^n$ to 1, removing the main bottleneck. It also lowers computational and I/O complexity from $O(2^n)$ to $O(2^n/C)$ and $O(2^n/B)$. In simulations of 16-29 qubits, efficiency improves nearly tenfold, breaking the memory bottleneck of existing tools and enabling high-bit quantum circuit simulations beyond traditional methods. This work provides an efficient, scalable solution for classical simulation of large-scale quantum computation with significant academic and practical value.

cs.ET↗