Browse
Submit Data
Databases
API
Help

Dataset Information

29 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Quantum stochastic walks on networks for decision-making.

ABSTRACT: 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.

SUBMITTER: Martinez-Martinez I

PROVIDER: S-EPMC4815055 | biostudies-other | 2016 Mar

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Interplay between path and speed in decision making by high-dimensional stochastic gene regulatory networks.

Project description:Induction of a specific transcriptional program by external signaling inputs is a crucial aspect of intracellular network functioning. The theoretical concept of coexisting attractors representing particular genetic programs is reasonably adapted to experimental observations of "genome-wide" expression profiles or phenotypes. Attractors can be associated either with developmental outcomes such as differentiation into specific types of cells, or maintenance of cell functioning such as proliferation or apoptosis. Here we review a mechanism known as speed-dependent cellular decision making (SdCDM) in a small epigenetic switch and generalize the concept to high-dimensional space. We demonstrate that high-dimensional network clustering capacity is dependent on the level of intrinsic noise and the speed at which external signals operate on the transcriptional landscape.

| S-EPMC3398018 | biostudies-literature

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

Project description: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 TD, 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).

| S-EPMC7729038 | biostudies-literature

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

Stochastic transitions between neural states in taste processing and decision-making.

Project description:Noise, which is ubiquitous in the nervous system, causes trial-to-trial variability in the neural responses to stimuli. This neural variability is in turn a likely source of behavioral variability. Using Hidden Markov modeling, a method of analysis that can make use of such trial-to-trial response variability, we have uncovered sequences of discrete states of neural activity in gustatory cortex during taste processing. Here, we advance our understanding of these patterns in two ways. First, we reproduce the experimental findings in a formal model, describing a network that evinces sharp transitions between discrete states that are deterministically stable given sufficient noise in the network; as in the empirical data, the transitions occur at variable times across trials, but the stimulus-specific sequence is itself reliable. Second, we demonstrate that such noise-induced transitions between discrete states can be computationally advantageous in a reduced, decision-making network. The reduced network produces binary outputs, which represent classification of ingested substances as palatable or nonpalatable, and the corresponding behavioral responses of "spit" or "swallow". We evaluate the performance of the network by measuring how reliably its outputs follow small biases in the strengths of its inputs. We compare two modes of operation: deterministic integration ("ramping") versus stochastic decision-making ("jumping"), the latter of which relies on state-to-state transitions. We find that the stochastic mode of operation can be optimal under typical levels of internal noise and that, within this mode, addition of random noise to each input can improve optimal performance when decisions must be made in limited time.

| S-EPMC2851230 | biostudies-literature

Emergent decision-making in biological signal transduction networks.

Project description:The complexity of biochemical intracellular signal transduction networks has led to speculation that the high degree of interconnectivity that exists in these networks transforms them into an information processing network. To test this hypothesis directly, a large scale model was created with the logical mechanism of each node described completely to allow simulation and dynamical analysis. Exposing the network to tens of thousands of random combinations of inputs and analyzing the combined dynamics of multiple outputs revealed a robust system capable of clustering widely varying input combinations into equivalence classes of biologically relevant cellular responses. This capability was nontrivial in that the network performed sharp, nonfuzzy classifications even in the face of added noise, a hallmark of real-world decision-making.

| S-EPMC2538858 | biostudies-other

Memory of cell shape biases stochastic fate decision-making despite mitotic rounding.

Project description:Cell shape influences function, and the current model suggests that such shape effect is transient. However, cells dynamically change their shapes, thus, the critical question is whether shape information remains influential on future cell function even after the original shape is lost. We address this question by integrating experimental and computational approaches. Quantitative live imaging of asymmetric cell-fate decision-making and their live shape manipulation demonstrates that cellular eccentricity of progenitor cell indeed biases stochastic fate decisions of daughter cells despite mitotic rounding. Modelling and simulation indicates that polarized localization of Delta protein instructs by the progenitor eccentricity is an origin of the bias. Simulation with varying parameters predicts that diffusion rate and abundance of Delta molecules quantitatively influence the bias. These predictions are experimentally validated by physical and genetic methods, showing that cells exploit a mechanism reported herein to influence their future fates based on their past shape despite dynamic shape changes.

| S-EPMC4931277 | biostudies-literature

Probabilistic threshold analysis by pairwise stochastic approximation for decision-making under uncertainty.

Project description:The concept of probabilistic parameter threshold analysis has recently been introduced as a way of probabilistic sensitivity analysis for decision-making under uncertainty, in particular, for health economic evaluations which compare two or more alternative treatments with consideration of uncertainty on outcomes and costs. In this paper we formulate the probabilistic threshold analysis as a root-finding problem involving the conditional expectations, and propose a pairwise stochastic approximation algorithm to search for the threshold value below and above which the choice of conditionally optimal decision options changes. Numerical experiments for both a simple synthetic testcase and a chemotherapy Markov model illustrate the effectiveness of our proposed algorithm, without any need for accurate estimation or approximation of conditional expectations which the existing approaches rely upon. Moreover we introduce a new measure called decision switching probability for probabilistic sensitivity analysis in this paper.

| S-EPMC8490445 | biostudies-literature

Small Networks Encode Decision-Making in Primary Auditory Cortex.

Project description:Sensory detection tasks enhance representations of behaviorally meaningful stimuli in primary auditory cortex (A1). However, it remains unclear how A1 encodes decision-making. Neurons in A1 layer 2/3 (L2/3) show heterogeneous stimulus selectivity and complex anatomical connectivity, and receive input from prefrontal cortex. Thus, task-related modulation of activity in A1 L2/3 might differ across subpopulations. To study the neural coding of decision-making, we used two-photon imaging in A1 L2/3 of mice performing a tone-detection task. Neural responses to targets showed attentional gain and encoded behavioral choice. To characterize network representation of behavioral choice, we analyzed functional connectivity using Granger causality, pairwise noise correlations, and neural decoding. During task performance, small groups of four to five neurons became sparsely linked, locally clustered, and rostro-caudally oriented, while noise correlations both increased and decreased. Our results suggest that sensory-based decision-making involves small neural networks driven by the sum of sensory input, attentional gain, and behavioral choice.

| S-EPMC6289180 | biostudies-literature

Quantum-mechanical machinery for rational decision-making in classical guessing game.

Project description:In quantum game theory, one of the most intriguing and important questions is, "Is it possible to get quantum advantages without any modification of the classical game?" The answer to this question so far has largely been negative. So far, it has usually been thought that a change of the classical game setting appears to be unavoidable for getting the quantum advantages. However, we give an affirmative answer here, focusing on the decision-making process (we call 'reasoning') to generate the best strategy, which may occur internally, e.g., in the player's brain. To show this, we consider a classical guessing game. We then define a one-player reasoning problem in the context of the decision-making theory, where the machinery processes are designed to simulate classical and quantum reasoning. In such settings, we present a scenario where a rational player is able to make better use of his/her weak preferences due to quantum reasoning, without any altering or resetting of the classically defined game. We also argue in further analysis that the quantum reasoning may make the player fail, and even make the situation worse, due to any inappropriate preferences.

| S-EPMC4753459 | 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

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