Browse
Submit Data
Databases
API
Help

Dataset Information

28 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Quantum aspects of evolution: a contribution towards evolutionary explorations of genotype networks via quantum walks.

ABSTRACT: Quantum biology seeks to explain biological phenomena via quantum mechanisms, such as enzyme reaction rates via tunnelling and photosynthesis energy efficiency via coherent superposition of states. However, less effort has been devoted to study the role of quantum mechanisms in biological evolution. In this paper, we used transcription factor networks with two and four different phenotypes, and used classical random walks (CRW) and quantum walks (QW) to compare network search behaviour and efficiency at finding novel phenotypes between CRW and QW. In the network with two phenotypes, at temporal scales comparable to decoherence time T_D, QW are as efficient as CRW at finding new phenotypes. In the case of the network with four phenotypes, the QW had a higher probability of mutating to a novel phenotype than the CRW, regardless of the number of mutational steps (i.e. 1, 2 or 3) away from the new phenotype. Before quantum decoherence, the QW probabilities become higher turning the QW effectively more efficient than CRW at finding novel phenotypes under different starting conditions. Thus, our results warrant further exploration of the QW under more realistic network scenarios (i.e. larger genotype networks) in both closed and open systems (e.g. by considering Lindblad terms).

SUBMITTER: Santiago-Alarcon D

PROVIDER: S-EPMC7729038 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Quantum stochastic walks on networks for decision-making.

Project description:Recent experiments report violations of the classical law of total probability and incompatibility of certain mental representations when humans process and react to information. Evidence shows promise of a more general quantum theory providing a better explanation of the dynamics and structure of real decision-making processes than classical probability theory. Inspired by this, we show how the behavioral choice-probabilities can arise as the unique stationary distribution of quantum stochastic walkers on the classical network defined from Luce's response probabilities. This work is relevant because (i) we provide a very general framework integrating the positive characteristics of both quantum and classical approaches previously in confrontation, and (ii) we define a cognitive network which can be used to bring other connectivist approaches to decision-making into the quantum stochastic realm. We model the decision-maker as an open system in contact with her surrounding environment, and the time-length of the decision-making process reveals to be also a measure of the process' degree of interplay between the unitary and irreversible dynamics. Implementing quantum coherence on classical networks may be a door to better integrate human-like reasoning biases in stochastic models for decision-making.

| S-EPMC4815055 | biostudies-other

Floquet-engineered quantum walks.

Project description:The quantum walk is the quantum-mechanical analogue of the classical random walk, which offers an advanced tool for both simulating highly complex quantum systems and building quantum algorithms in a wide range of research areas. One prominent application is in computational models capable of performing any quantum computation, in which precisely controlled state transfer is required. It is, however, generally difficult to control the behavior of quantum walks due to stochastic processes. Here we unveil the walking mechanism based on its particle-wave duality and then present tailoring quantum walks using the walking mechanism (Floquet oscillations) under designed time-dependent coins, to manipulate the desired state on demand, as in universal quantum computation primitives. Our results open the path towards control of quantum walks.

| S-EPMC7567857 | biostudies-literature

Disease gene prioritization with quantum walks.

Project description:MotivationDisease gene prioritization methods assign scores to genes or proteins according to their likely relevance for a given disease based on a provided set of seed genes. This scoring can be used to find new biologically relevant genes or proteins for many diseases. Although methods based on classical random walks have proven to yield competitive results, quantum walk methods have not been explored to this end.ResultsWe propose a new algorithm for disease gene prioritization based on continuous-time quantum walks using the adjacency matrix of a protein-protein interaction (PPI) network. We demonstrate the success of our proposed quantum walk method by comparing it to several well-known gene prioritization methods on three disease sets, across seven different PPI networks. In order to compare these methods, we use cross-validation and examine the mean reciprocal ranks of recall and average precision values. We further validate our method by performing an enrichment analysis of the predicted genes for coronary artery disease.Availability and implementationThe data and code for the methods can be accessed at https://github.com/markgolds/qdgp.

| S-EPMC11361815 | biostudies-literature

Towards an evolutionary model of transcription networks.

Project description:DNA evolution models made invaluable contributions to comparative genomics, although it seemed formidable to include non-genomic features into these models. In order to build an evolutionary model of transcription networks (TNs), we had to forfeit the substitution model used in DNA evolution and to start from modeling the evolution of the regulatory relationships. We present a quantitative evolutionary model of TNs, subjecting the phylogenetic distance and the evolutionary changes of cis-regulatory sequence, gene expression and network structure to one probabilistic framework. Using the genome sequences and gene expression data from multiple species, this model can predict regulatory relationships between a transcription factor (TF) and its target genes in all species, and thus identify TN re-wiring events. Applying this model to analyze the pre-implantation development of three mammalian species, we identified the conserved and re-wired components of the TNs downstream to a set of TFs including Oct4, Gata3/4/6, cMyc and nMyc. Evolutionary events on the DNA sequence that led to turnover of TF binding sites were identified, including a birth of an Oct4 binding site by a 2nt deletion. In contrast to recent reports of large interspecies differences of TF binding sites and gene expression patterns, the interspecies difference in TF-target relationship is much smaller. The data showed increasing conservation levels from genomic sequences to TF-DNA interaction, gene expression, TN, and finally to morphology, suggesting that evolutionary changes are larger at molecular levels and smaller at functional levels. The data also showed that evolutionarily older TFs are more likely to have conserved target genes, whereas younger TFs tend to have larger re-wiring rates.

| S-EPMC3111474 | biostudies-literature

Novel image encryption based on quantum walks.

Project description:Quantum computation has achieved a tremendous success during the last decades. In this paper, we investigate the potential application of a famous quantum computation model, i.e., quantum walks (QW) in image encryption. It is found that QW can serve as an excellent key generator thanks to its inherent nonlinear chaotic dynamic behavior. Furthermore, we construct a novel QW-based image encryption algorithm. Simulations and performance comparisons show that the proposal is secure enough for image encryption and outperforms prior works. It also opens the door towards introducing quantum computation into image encryption and promotes the convergence between quantum computation and image processing.

| S-EPMC4293593 | biostudies-literature

A co-design framework of neural networks and quantum circuits towards quantum advantage.

Project description:Despite the pursuit of quantum advantages in various applications, the power of quantum computers in executing neural network has mostly remained unknown, primarily due to a missing tool that effectively designs a neural network suitable for quantum circuit. Here, we present a neural network and quantum circuit co-design framework, namely QuantumFlow, to address the issue. In QuantumFlow, we represent data as unitary matrices to exploit quantum power by encoding n = 2k inputs into k qubits and representing data as random variables to seamlessly connect layers without measurement. Coupled with a novel algorithm, the cost complexity of the unitary matrices-based neural computation can be reduced from O(n) in classical computing to O(polylog(n)) in quantum computing. Results show that on MNIST dataset, QuantumFlow can achieve an accuracy of 94.09% with a cost reduction of 10.85 × against the classical computer. All these results demonstrate the potential for QuantumFlow to achieve the quantum advantage.

| S-EPMC7835384 | biostudies-literature

Experimentally simulating quantum walks with self-collimated light.

Project description:In self-collimated photonic crystal, periodically arranged air holes of sub-wavelength scale provide flattened equi-frequency curves perpendicular to the ΓM direction, which allow light or photons propagating in a quasi-uniform medium without diffraction. Here we for the first time experimentally simulate four-step single-photon discrete time quantum walks with classical light in such a photonic crystal chip fabricated on silicon-on-insulator. Similarities between theoretical expectations and experimental results are higher than 0.98. The functional area is compact and can be extended to construct more complicated linear quantum circuits.

| S-EPMC4926089 | biostudies-literature

Multi-qubit quantum computing using discrete-time quantum walks on closed graphs.

Project description:Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of the scheme is demonstrated by using a set of walk operations on a closed lattice form to implement the universal set of quantum gates on multi-qubit system. We also present a set of experimentally realizable walk operations that can implement Grover's algorithm, quantum Fourier transformation and quantum phase estimation algorithms. An elementary implementation of error detection and correction is also presented. Analysis of space and time complexity of the scheme highlights the advantages of quantum walk based model for quantum computation on systems where implementation of quantum walk evolution operations is an inherent feature of the system.

| S-EPMC10372037 | biostudies-literature

Barrier compression and its contribution to both classical and quantum mechanical aspects of enzyme catalysis.

Project description:It is generally accepted that enzymes catalyze reactions by lowering the apparent activation energy by transition state stabilization or through destabilization of ground states. A more controversial proposal is that enzymes can also accelerate reactions through barrier compression-an idea that has emerged from studies of H-tunneling reactions in enzyme systems. The effects of barrier compression on classical (over-the-barrier) reactions, and the partitioning between tunneling and classical reaction paths, have largely been ignored. We performed theoretical and computational studies on the effects of barrier compression on the shape of potential energy surfaces/reaction barriers for model (malonaldehyde and methane/methyl radical anion) and enzymatic (aromatic amine dehydrogenase) proton transfer systems. In all cases, we find that barrier compression is associated with an approximately linear decrease in the activation energy. For partially nonadiabatic proton transfers, we show that barrier compression enhances, to similar extents, the rate of classical and proton tunneling reactions. Our analysis suggests that barrier compression-through fast promoting vibrations, or other means-could be a general mechanism for enhancing the rate of not only tunneling, but also classical, proton transfers in enzyme catalysis.

| S-EPMC2800970 | biostudies-literature

Inferring evolutionary pathways and directed genotype networks of foodborne pathogens.

Project description:Modelling the emergence of foodborne pathogens is a crucial step in the prediction and prevention of disease outbreaks. Unfortunately, the mechanisms that drive the evolution of such continuously adapting pathogens remain poorly understood. Here, we combine molecular genotyping with network science and Bayesian inference to infer directed genotype networks-and trace the emergence and evolutionary paths-of Salmonella Typhimurium (STM) from nine years of Australian disease surveillance data. We construct networks where nodes represent STM strains and directed edges represent evolutionary steps, presenting evidence that the structural (i.e., network-based) features are relevant to understanding the functional (i.e., fitness-based) progression of co-evolving STM strains. This is argued by showing that outbreak severity, i.e., prevalence, correlates to: (i) the network path length to the most prevalent node (r = -0.613, N = 690); and (ii) the network connected-component size (r = 0.739). Moreover, we uncover distinct exploration-exploitation pathways in the genetic space of STM, including a strong evolutionary drive through a transition region. This is examined via the 6,897 distinct evolutionary paths in the directed network, where we observe a dominant 66% of these paths decrease in network centrality, whilst increasing in prevalence. Furthermore, 72.4% of all paths originate in the transition region, with 64% of those following the dominant direction. Further, we find that the length of an evolutionary path strongly correlates to its increase in prevalence (r = 0.497). Combined, these findings indicate that longer evolutionary paths result in genetically rare and virulent strains, which mostly evolve from a single transition point. Our results not only validate our widely-applicable approach for inferring directed genotype networks from data, but also provide a unique insight into the elusive functional and structural drivers of STM bacteria.

| S-EPMC7657559 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data