On the Transferability of Knowledge among Vehicle Routing Problems by using Cellular Evolutionary Multitasking

Multitasking optimization is a recently introduced paradigm, focused on the simultaneous solving of multiple optimization problem instances (tasks). The goal of multitasking environments is to dynamically exploit existing complementarities and synergies among tasks, helping each other through the transfer of genetic material. More concretely, Evolutionary Multitasking (EM) regards to the resolution of multitasking scenarios using concepts inherited from Evolutionary Computation. EM approaches such as the well-known Multifactorial Evolutionary Algorithm (MFEA) are lately gaining a notable research momentum when facing with multiple optimization problems. This work is focused on the application of the recently proposed Multifactorial Cellular Genetic Algorithm (MFCGA) to the well-known Capacitated Vehicle Routing Problem (CVRP). In overall, 11 different multitasking setups have been built using 12 datasets. The contribution of this research is twofold. On the one hand, it is the first application of the MFCGA to the Vehicle Routing Problem family of problems. On the other hand, equally interesting is the second contribution, which is focused on the quantitative analysis of the positive genetic transferability among the problem instances. To do that, we provide an empirical demonstration of the synergies arisen between the different optimization tasks.Comment: 8 pages, 1 figure, paper accepted for presentation in the 23rd IEEE International Conference on Intelligent Transportation Systems 2020 (IEEE ITSC 2020

Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics

Quantum computing is powerful because unitary operators describing the time-evolution of a quantum system have exponential size in terms of the number of qubits present in the system. We develop a new "Singular value transformation" algorithm capable of harnessing this exponential advantage, that can apply polynomial transformations to the singular values of a block of a unitary, generalizing the optimal Hamiltonian simulation results of Low and Chuang. The proposed quantum circuits have a very simple structure, often give rise to optimal algorithms and have appealing constant factors, while usually only use a constant number of ancilla qubits. We show that singular value transformation leads to novel algorithms. We give an efficient solution to a certain "non-commutative" measurement problem and propose a new method for singular value estimation. We also show how to exponentially improve the complexity of implementing fractional queries to unitaries with a gapped spectrum. Finally, as a quantum machine learning application we show how to efficiently implement principal component regression. "Singular value transformation" is conceptually simple and efficient, and leads to a unified framework of quantum algorithms incorporating a variety of quantum speed-ups. We illustrate this by showing how it generalizes a number of prominent quantum algorithms, including: optimal Hamiltonian simulation, implementing the Moore-Penrose pseudoinverse with exponential precision, fixed-point amplitude amplification, robust oblivious amplitude amplification, fast QMA amplification, fast quantum OR lemma, certain quantum walk results and several quantum machine learning algorithms. In order to exploit the strengths of the presented method it is useful to know its limitations too, therefore we also prove a lower bound on the efficiency of singular value transformation, which often gives optimal bounds.Comment: 67 pages, 1 figur

Quantumlike Chaos in the Frequency Distributions of the Bases A, C, G, T in Drosophila DNA

Continuous periodogram power spectral analyses of fractal fluctuations of frequency distributions of bases A, C, G, T in Drosophila DNA show that the power spectra follow the universal inverse power-law form of the statistical normal distribution. Inverse power-law form for power spectra of space-time fluctuations is generic to dynamical systems in nature and is identified as self-organized criticality. The author has developed a general systems theory, which provides universal quantification for observed self-organized criticality in terms of the statistical normal distribution. The long-range correlations intrinsic to self-organized criticality in macro-scale dynamical systems are a signature of quantumlike chaos. The fractal fluctuations self-organize to form an overall logarithmic spiral trajectory with the quasiperiodic Penrose tiling pattern for the internal structure. Power spectral analysis resolves such a spiral trajectory as an eddy continuum with embedded dominant wavebands. The dominant peak periodicities are functions of the golden mean. The observed fractal frequency distributions of the Drosophila DNA base sequences exhibit quasicrystalline structure with long-range spatial correlations or self-organized criticality. Modification of the DNA base sequence structure at any location may have significant noticeable effects on the function of the DNA molecule as a whole. The presence of non-coding introns may not be redundant, but serve to organize the effective functioning of the coding exons in the DNA molecule as a complete unit.Comment: 46 pages, 9 figure

Quantum Theory of Probability and Decisions

The probabilistic predictions of quantum theory are conventionally obtained from a special probabilistic axiom. But that is unnecessary because all the practical consequences of such predictions follow from the remaining, non-probabilistic, axioms of quantum theory, together with the non-probabilistic part of classical decision theory

Thermal Conductivity and Thermal Rectification in Graphene Nanoribbons: a Molecular Dynamics Study

We have used molecular dynamics to calculate the thermal conductivity of symmetric and asymmetric graphene nanoribbons (GNRs) of several nanometers in size (up to ~4 nm wide and ~10 nm long). For symmetric nanoribbons, the calculated thermal conductivity (e.g. ~2000 W/m-K @400K for a 1.5 nm {\times} 5.7 nm zigzag GNR) is on the similar order of magnitude of the experimentally measured value for graphene. We have investigated the effects of edge chirality and found that nanoribbons with zigzag edges have appreciably larger thermal conductivity than nanoribbons with armchair edges. For asymmetric nanoribbons, we have found significant thermal rectification. Among various triangularly-shaped GNRs we investigated, the GNR with armchair bottom edge and a vertex angle of 30{\deg} gives the maximal thermal rectification. We also studied the effect of defects and found that vacancies and edge roughness in the nanoribbons can significantly decrease the thermal conductivity. However, substantial thermal rectification is observed even in the presence of edge roughness.Comment: 13 pages, 5 figures, slightly expanded from the published version on Nano Lett. with some additional note

Quantum Robot: Structure, Algorithms and Applications

A kind of brand-new robot, quantum robot, is proposed through fusing quantum theory with robot technology. Quantum robot is essentially a complex quantum system and it is generally composed of three fundamental parts: MQCU (multi quantum computing units), quantum controller/actuator, and information acquisition units. Corresponding to the system structure, several learning control algorithms including quantum searching algorithm and quantum reinforcement learning are presented for quantum robot. The theoretic results show that quantum robot can reduce the complexity of O(N^2) in traditional robot to O(N^(3/2)) using quantum searching algorithm, and the simulation results demonstrate that quantum robot is also superior to traditional robot in efficient learning by novel quantum reinforcement learning algorithm. Considering the advantages of quantum robot, its some potential important applications are also analyzed and prospected.Comment: 19 pages, 4 figures, 2 table

Quantum Genetics, Quantum Automata and Quantum Computation

The concepts of quantum automata and quantum computation are studied in the context of quantum genetics and genetic networks with nonlinear dynamics. In a previous publication (Baianu,1971a) the formal concept of quantum automaton was introduced and its possible implications for genetic and metabolic activities in living cells and organisms were considered. This was followed by a report on quantum and abstract, symbolic computation based on the theory of categories, functors and natural transformations (Baianu,1971b). The notions of topological semigroup, quantum automaton,or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. Further, detailed studies of nonlinear dynamics in genetic networks were carried out in categories of n-valued, Lukasiewicz Logic Algebras that showed significant dissimilarities (Baianu, 1977) from Bolean models of human neural networks (McCullough and Pitts,1945). Molecular models in terms of categories, functors and natural transformations were then formulated for uni-molecular chemical transformations, multi-molecular chemical and biochemical transformations (Baianu, 1983,2004a). Previous applications of computer modeling, classical automata theory, and relational biology to molecular biology, oncogenesis and medicine were extensively reviewed and several important conclusions were reached regarding both the potential and limitations of the computation-assisted modeling of biological systems, and especially complex organisms such as Homo sapiens sapiens(Baianu,1987). Novel approaches to solving the realization problems of Relational Biology models in Complex System Biology are introduced in terms of natural transformations between functors of such molecular categories. Several applications of such natural transformations of functors were then presented to protein biosynthesis, embryogenesis and nuclear transplant experiments. Other possible realizations in Molecular Biology and Relational Biology of Organisms are here suggested in terms of quantum automata models of Quantum Genetics and Interactomics. Future developments of this novel approach are likely to also include: Fuzzy Relations in Biology and Epigenomics, Relational Biology modeling of Complex Immunological and Hormonal regulatory systems, n-categories and Topoi of Lukasiewicz Logic Algebras and Intuitionistic Logic (Heyting) Algebras for modeling nonlinear dynamics and cognitive processes in complex neural networks that are present in the human brain, as well as stochastic modeling of genetic networks in Lukasiewicz Logic Algebras