Geometric relations in Classical and Quantum Information Theory using the Lambert-Tsallis Wq (x) function

JLE da Silva - Journal of Computational and Applied Mathematics, 2024 - Elsevier
This work presents relations using the Lambert-Tsallis function W q (x) that provide
geometric characteristics in classical and quantum information theory. Firstly, the W q (x) …

Random Sampling of Quantum States: A Survey of Methods: And Some Issues Regarding the Overparametrized Method

J Maziero - Brazilian Journal of Physics, 2015 - Springer
The numerical generation of random quantum states (RQS) is an important procedure for
investigations in quantum information science. Here, we review some methods that may be …

Quantum entanglement of formation between qudits

S Ryu, W Cai, A Caro - Physical Review A—Atomic, Molecular, and Optical …, 2008 - APS
We develop a fast algorithm to calculate the entanglement of formation of a mixed state,
which is defined as the minimum average entanglement of the pure states that form the …

Quantum ant colony optimization with application

P Li, K Song, E Yang - 2010 Sixth International Conference on …, 2010 - ieeexplore.ieee.org
Aiming at the shortcoming of ant colony optimization of being only suitable for discrete
problems and holding a slow convergence speed, a novel algorithm for continuous …

Genetic algorithms and optimization problems in quantum computing

Y Hardy, WH Steeb - International Journal of Modern Physics C, 2010 - World Scientific
We solve a number of problems in quantum computing by applying genetic algorithms. We
use the bitset class of C++ to represent any data type for genetic algorithms. Thus we have a …

Generating pseudo-random discrete probability distributions: About the iid, normalization, and trigonometric methods

J Maziero - Brazilian Journal of Physics, 2015 - Springer
The generation of pseudo-random discrete probability distributions is of paramount
importance for a wide range of stochastic simulations spanning from Monte Carlo methods …

Genetic algorithm approach to calculation of geometric configurations of 2D clusters of uniformly charged classical particles

P Sobczak, L Kucharski, G Kamieniarz - Computer Physics …, 2011 - Elsevier
The genetic algorithms in the variant developed earlier and in that improved by the
mechanism of niches have been exploited in the analysis of global and local minima of the …

Simulation of entanglement generation and variation in quantum computation

IG Karafyllidis - Journal of Computational Physics, 2004 - Elsevier
Entanglement generation and variation in quantum computation is studied using a quantum
computer simulator. The simulator is described and its block diagram is presented. The use …

[引用][C] 求解连续空间优化问题的量子蚁群算法

李盼池, 李士勇 - 控制理论与应用, 2008

[引用][C] 基于实数编码和目标函数梯度的量子遗传算法

李士勇, 李盼池 - 哈尔滨工业大学学报, 2006