Adaptive quantum computation in changing environments using projective simulation.
Ontology highlight
ABSTRACT:
SUBMITTER: Tiersch M
PROVIDER: S-EPMC4531334 | biostudies-other | 2015
REPOSITORIES: biostudies-other
Similar Datasets
Project description:We test the quantumness of IBM's quantum computer IBM Quantum System One in Ehningen, Germany. We generate generalised n-qubit GHZ states and measure Bell inequalities to investigate the n-party entanglement of the GHZ states. The implemented Bell inequalities are derived from non-adaptive measurement-based quantum computation (NMQC), a type of quantum computing that links the successful computation of a non-linear function to the violation of a multipartite Bell-inequality. The goal is to compute a multivariate Boolean function that clearly differentiates non-local correlations from local hidden variables (LHVs). Since it has been shown that LHVs can only compute linear functions, whereas quantum correlations are capable of outputting every possible Boolean function it thus serves as an indicator of multipartite entanglement. Here, we compute various non-linear functions with NMQC on IBM's quantum computer IBM Quantum System One and thereby demonstrate that the presented method can be used to characterize quantum devices. We find a violation for a maximum of seven qubits and compare our results to an existing implementation of NMQC using photons.
| S-EPMC10507095 | biostudies-literature
Project description:Probabilistic models of decision making under various forms of uncertainty have been applied in recent years to numerous behavioral and model-based fMRI studies. These studies were highly successful in enabling a better understanding of behavior and delineating the functional properties of brain areas involved in decision making under uncertainty. However, as different studies considered different models of decision making under uncertainty, it is unclear which of these computational models provides the best account of the observed behavioral and neuroimaging data. This is an important issue, as not performing model comparison may tempt researchers to over-interpret results based on a single model. Here we describe how in practice one can compare different behavioral models and test the accuracy of model comparison and parameter estimation of Bayesian and maximum-likelihood based methods. We focus our analysis on two well-established hierarchical probabilistic models that aim at capturing the evolution of beliefs in changing environments: Hierarchical Gaussian Filters and Change Point Models. To our knowledge, these two, well-established models have never been compared on the same data. We demonstrate, using simulated behavioral experiments, that one can accurately disambiguate between these two models, and accurately infer free model parameters and hidden belief trajectories (e.g., posterior expectations, posterior uncertainties, and prediction errors) even when using noisy and highly correlated behavioral measurements. Importantly, we found several advantages of Bayesian inference and Bayesian model comparison compared to often-used Maximum-Likelihood schemes combined with the Bayesian Information Criterion. These results stress the relevance of Bayesian data analysis for model-based neuroimaging studies that investigate human decision making under uncertainty.
| S-EPMC4837154 | biostudies-literature
Project description:Populations adapt to novel environmental conditions by genetic changes or phenotypic plasticity. Plastic responses are generally faster and can buffer fitness losses under variable conditions. Plasticity is typically modeled as random noise and linear reaction norms that assume simple one-to-one genotype-phenotype maps and no limits to the phenotypic response. Most studies on plasticity have focused on its effect on population viability. However, it is not clear, whether the advantage of plasticity depends solely on environmental fluctuations or also on the genetic and demographic properties (life histories) of populations. Here we present an individual-based model and study the relative importance of adaptive and nonadaptive plasticity for populations of sexual species with different life histories experiencing directional stochastic climate change. Environmental fluctuations were simulated using differentially autocorrelated climatic stochasticity or noise color, and scenarios of directional climate change. Nonadaptive plasticity was simulated as a random environmental effect on trait development, while adaptive plasticity as a linear, saturating, or sinusoidal reaction norm. The last two imposed limits to the plastic response and emphasized flexible interactions of the genotype with the environment. Interestingly, this assumption led to (a) smaller phenotypic than genotypic variance in the population (many-to-one genotype-phenotype map) and the coexistence of polymorphisms, and (b) the maintenance of higher genetic variation-compared to linear reaction norms and genetic determinism-even when the population was exposed to a constant environment for several generations. Limits to plasticity led to genetic accommodation, when costs were negligible, and to the appearance of cryptic variation when limits were exceeded. We found that adaptive plasticity promoted population persistence under red environmental noise and was particularly important for life histories with low fecundity. Populations producing more offspring could cope with environmental fluctuations solely by genetic changes or random plasticity, unless environmental change was too fast.
| S-EPMC8207414 | biostudies-literature
Project description:The circuit complexity of quantum qubit system evolution as a primitive problem in quantum computation has been discussed widely. We investigate this problem in terms of qudit system. Using the Riemannian geometry the optimal quantum circuits are equivalent to the geodetic evolutions in specially curved parametrization of SU(d(n)). And the quantum circuit complexity is explicitly dependent of controllable approximation error bound.
| S-EPMC4070285 | biostudies-literature
Project description:Quantum information processing enhances human's power to simulate nature in quantum level and solve complex problem efficiently. During the process, a series of operators is performed to evolve the system or undertake a computing task. In recent year, research interest in non-Hermitian quantum systems, dissipative-quantum systems and new quantum algorithms has greatly increased, which nonunitary operators take an important role in. In this work, we utilize the linear combination of unitaries technique for nonunitary dynamics on a single qubit to give explicit decompositions of the necessary unitaries, and simulate arbitrary time-dependent single-qubit nonunitary operator F(t) using duality quantum algorithm. We find that the successful probability is not only decided by F(t) and the initial state, but also is inversely proportional to the dimensions of the used ancillary Hilbert subspace. In a general case, the simulation can be achieved in both eight- and six-dimensional Hilbert spaces. In phase matching conditions, F(t) can be simulated by only two qubits. We illustrate our method by simulating typical non-Hermitian systems and single-qubit measurements. Our method can be extended to high-dimensional case, such as Abrams-Lloyd's two-qubit gate. By discussing the practicability, we expect applications and experimental implementations in the near future.
| S-EPMC7889913 | biostudies-literature
Project description:A quantum mechanical bespoke molecular mechanics force field is derived for the L99A mutant of T4 lysozyme and used to compute absolute binding free energies of six benzene analogs to the protein. Promising agreement between theory and experiment highlights the potential for future use of system-specific force fields in computer-aided drug design.
| S-EPMC6644397 | biostudies-literature
Project description:Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, these devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge of exploring the advantage of quantum computation is to minimize the impact of device and control imperfections without complete logical encoding. Quantum error mitigation is a solution satisfying the requirement. Here, we demonstrate an error mitigation protocol based on gate set tomography and quasi-probability decomposition. One- and two-qubit circuits are tested on a superconducting device, and computation errors are successfully suppressed. Because this protocol is universal for digital quantum computers and algorithms computing expected values, our results suggest that error mitigation can be an essential component of near-future quantum computation.
| S-EPMC6731091 | biostudies-literature
Project description:We present an approach to describe state-of-the-art photonic quantum experiments using graph theory. There, the quantum states are given by the coherent superpositions of perfect matchings. The crucial observation is that introducing complex weights in graphs naturally leads to quantum interference. This viewpoint immediately leads to many interesting results, some of which we present here. First, we identify an experimental unexplored multiphoton interference phenomenon. Second, we find that computing the results of such experiments is #P-hard, which means it is a classically intractable problem dealing with the computation of a matrix function Permanent and its generalization Hafnian. Third, we explain how a recent no-go result applies generally to linear optical quantum experiments, thus revealing important insights into quantum state generation with current photonic technology. Fourth, we show how to describe quantum protocols such as entanglement swapping in a graphical way. The uncovered bridge between quantum experiments and graph theory offers another perspective on a widely used technology and immediately raises many follow-up questions.
| S-EPMC6410807 | biostudies-literature
Project description:Artificial Neural Networks (ANNs) are bio-inspired models of neural computation that have proven highly effective. Still, ANNs lack a natural notion of time, and neural units in ANNs exchange analog values in a frame-based manner, a computationally and energetically inefficient form of communication. This contrasts sharply with biological neurons that communicate sparingly and efficiently using isomorphic binary spikes. While Spiking Neural Networks (SNNs) can be constructed by replacing the units of an ANN with spiking neurons (Cao et al., 2015; Diehl et al., 2015) to obtain reasonable performance, these SNNs use Poisson spiking mechanisms with exceedingly high firing rates compared to their biological counterparts. Here we show how spiking neurons that employ a form of neural coding can be used to construct SNNs that match high-performance ANNs and match or exceed state-of-the-art in SNNs on important benchmarks, while requiring firing rates compatible with biological findings. For this, we use spike-based coding based on the firing rate limiting adaptation phenomenon observed in biological spiking neurons. This phenomenon can be captured in fast adapting spiking neuron models, for which we derive the effective transfer function. Neural units in ANNs trained with this transfer function can be substituted directly with adaptive spiking neurons, and the resulting Adaptive SNNs (AdSNNs) can carry out competitive classification in deep neural networks without further modifications. Adaptive spike-based coding additionally allows for the dynamic control of neural coding precision: we show empirically how a simple model of arousal in AdSNNs further halves the average required firing rate and this notion naturally extends to other forms of attention as studied in neuroscience. AdSNNs thus hold promise as a novel and sparsely active model for neural computation that naturally fits to temporally continuous and asynchronous applications.
| S-EPMC6332470 | biostudies-literature
Project description: Not available
| S-EPMC10520359 | biostudies-literature