纠缠的遗传算法优化

浮动纠缠见证测度及遗传算法

Floating Entanglement Witness Measure and Genetic Algorithm

本文在纠缠见证概念的基础上，引入了一种新的纠缠度量--浮动纠缠见证度量，它满足了好的纠缠度量的一些通常性质。利用遗传算法，我们介绍了一个经典的算法，计算浮动纠缠见证措施。该算法还提供了一种寻找给定纠缠态的纠缠见证的方法。

Calculation of quantum discord and entanglement measures using the random mutations optimization algorithm

The simple and universal global optimization method based on simplified multipopulation genetic algorithm is presented. The method is applied to quantum information problems. It is compared to the genetic algorithm on standard test functions, and also tested on the calculation of quantum discord and minimal entanglement entropy, which is an entanglement measure for pure multipartite states.

Optimizing Entanglement Generation and Distribution Using Genetic Algorithms

Long-distance quantum communication via entanglement distribution is of great importance for the quantum internet. However, scaling up to such long distances has proved challenging due to the loss of photons, which grows exponentially with the distance covered. Quantum repeaters could in theory be used to extend the distances over which entanglement can be distributed, but in practice hardware quality is still lacking. Furthermore, it is generally not clear how an improvement in a certain repeater parameter, such as memory quality or attempt rate, impacts the overall network performance, rende…

混合量子和经典遗传算法在投资组合优化中的比较研究

A Comparative Study of Hybrid Quantum and Classical Genetic Algorithms in Portfolio Optimization

本文比较了混合量子遗传算法与经典遗传算法在投资组合优化中的性能，发现HQGA收敛更快且保持更高的种群多样性，且所需评估次数更少。

Genetic optimization of quantum annealing

The study of optimal control of quantum annealing by modulating the pace of evolution and by introducing a counterdiabatic potential has gained significant attention in recent times. In this work, we present a numerical approach based on genetic algorithms to improve the performance of quantum annealing, which evades the Landau-Zener transitions to navigate to the ground state of the final Hamiltonian with high probability. We optimize the annealing schedules starting from polynomial ansatz by treating their coefficients as chromosomes of the genetic algorithm. We also explore shortcuts to adi…

一种计算凸包纠缠的非凸优化策略

A Non-Convex Optimization Strategy for Computing Convex-Roof Entanglement

本文提出一种基于差分进化与QR分解的非凸优化方法，结合拟牛顿细化，用于计算混合态的凸包纠缠度，并验证其在多种场景下的有效性和广泛适用性。