arXiv subjects

Neil F. Johnson

Publications and source records attributed to Neil F. Johnson.

At least 127 records · Page 7Linked to original sources

arXiv2003

Crowd-Anticrowd Theory of Collective Dynamics in Competitive, Multi-Agent Populations and Networks

We discuss a crowd-based theory for describing the collective behavior in a generic multi-agent population which is competing for a limited resource. These systems -- whose binary versions we refer to as B-A-R (Binary Agent Resource) collectives -- have a dynamical evolution which is determined by the aggregate action of the heterogeneous, adaptive agent population. Accounting for the strong correlations between agents' strategies, yields an accurate description of the system's dynamics in terms of a 'Crowd-Anticrowd' theory. This theory can incorporate the effects of an underlying network within the population. Most importantly, its applicability is not just limited to the El Farol Problem and the Minority Game. Indeed, the Crowd-Anticrowd theory offers a powerful approach to tackling the dynamical behavior of a wide class of agent-based Complex Systems, across a range of disciplines. With this in mind, the present working paper is written for a general multi-disciplinary audience within the Complex Systems community.

cond-mat.dis-nn↗

arXiv2003

Crowd-Anticrowd Theory of Multi-Agent Minority Games

We present a formal treatment of the Crowd-Anticrowd theory of Minority Games played by a population of competing agents. This theory is built around a description of the crowding which arises within the game's strategy space. Earlier works have shown that this theory provides a simple, yet quantitatively accurate explanation of the time-averaged behavior of these multi-agent games. We also discuss the extent to which the Crowd-Anticrowd approach provides a useful tool for analyzing a wider class of Complex Systems.

cond-mat↗

arXiv2003

Quantum comparison machines with one-sided error

It is always possible to decide, with one-sided error, whether two quantum states are the same under a specific unitary transformation. However we show here that it is {\em impossible} to do so if the transformation is anti-linear and non-singular. This result implies that unitary and anti-unitary operations exist on an unequal footing in quantum information theory.

quant-ph↗

arXiv2002

Interacting many-body systems as non-cooperative games

We explore the possibility that physical phenomena arising from interacting multi-particle systems, can be usefully interpreted in terms of multi-player games. We show how non-cooperative phenomena can emerge from Ising Hamiltonians, even though the individual spins behave cooperatively. Our findings establish a mapping between two fundamental models from condensed matter physics and game theory.

cond-mat.dis-nn↗

arXiv2002

Game-theoretic discussion of quantum state estimation and cloning

We present a game-theoretic perspective on the problems of quantum state estimation and quantum cloning. This enables us to show why the focus on universal machines and the different measures of success, as employed in previous works, are in fact legitimite.

quant-ph↗

arXiv2002

Non-Cooperative Quantum Game Theory

The physical world obeys the rules of quantum, as opposed to classical, physics. Since the playing of any particular game requires physical resources, the question arises as to how Game Theory itself would change if it were extended into the quantum domain. Here we provide a general formalism for {\em quantum} games, and illustrate the explicit application of this new formalism to a quantized version of the well-known prisoner's dilemma game.

quant-ph↗

arXiv2002

Winning combinations of history-dependent games

The Parrondo effect describes the seemingly paradoxical situation in which two losing games can, when combined, become winning [Phys. Rev. Lett. 85, 24 (2000)]. Here we generalize this analysis to the case where both games are history-dependent, i.e. there is an intrinsic memory in the dynamics of each game. New results are presented for the cases of both random and periodic switching between the two games.

cond-mat↗

arXiv2002

Quantum coherence, correlated noise and Parrondo games

We discuss the effect of correlated noise on the robustness of quantum coherent phenomena. First we consider a simple, toy model to illustrate the effect of such correlations on the decoherence process. Then we show how decoherence rates can be suppressed using a Parrondo-like effect. Finally, we report the results of many-body calculations in which an experimentally-measurable quantum coherence phenomenon is significantly enhanced by non-Markovian dynamics arising from the noise source.

quant-ph↗

arXiv2002

Managing catastrophic changes in a collective

We address the important practical issue of understanding, predicting and eventually controlling catastrophic endogenous changes in a collective. Such large internal changes arise as macroscopic manifestations of the microscopic dynamics, and their presence can be regarded as one of the defining features of an evolving complex system. We consider the specific case of a multi-agent system related to the El Farol bar model, and show explicitly how the information concerning such large macroscopic changes becomes encoded in the microscopic dynamics. Our findings suggest that these large endogenous changes can be avoided either by pre-design of the collective machinery itself, or in the post-design stage via continual monitoring and occasional `vaccinations'.

cond-mat.dis-nn↗

arXiv2002

Exploiting Randomness in Quantum Information Processing

We consider how randomness can be made to play a useful role in quantum information processing - in particular, for decoherence control and the implementation of quantum algorithms. For a two-level system in which the decoherence channel is non-dissipative, we show that decoherence suppression is possible if memory is present in the channel. Random switching between two potentially harmful noise sources can then provide a source of stochastic control. Such random switching can also be used in an advantageous way for the implementation of quantum algorithms.

quant-ph↗

arXiv2002

An Investigation of Crash Avoidance in a Complex System

Complex systems can exhibit unexpected large changes, e.g. a crash in a financial market. We examine the large endogenous changes arising within a non-trivial generalization of the Minority Game: the Grand Canonical Minority Game (GCMG). Using a Markov Chain description, we study the many possible paths the system may take. This 'many-worlds' view not only allows us to predict the start and end of a crash in this system, but also to investigate how such a crash may be avoided. We find that the system can be 'immunized' against large changes: by inducing small changes today, much larger changes in the future can be prevented.

cond-mat.dis-nn↗

arXiv2002

Designing agent-based market models

In light of the growing interest in agent-based market models, we bring together several earlier works in which we considered the topic of self-consistent market modelling. Building upon the binary game structure of Challet and Zhang, we discuss generalizations of the strategy reward scheme such that the agents seek to maximize their wealth in a more direct way. We then examine a disturbing feature whereby such reward schemes, while appearing microscopically acceptable, lead to unrealistic market dynamics (e.g. instabilities). Finally, we discuss various mechanisms which are responsible for re-stabilizing the market in reality. This discussion leads to a `toolbox' of processes from which, we believe, successful market models can be constructed in the future.

cond-mat.dis-nn↗

arXiv2002

Crash Avoidance in a Complex System

Complex systems can exhibit unexpected large changes, e.g. a crash in a financial market. We examine the large endogenous changes arising within a non-trivial generalization of the Minority Game: the Grand Canonical Minority Game (GCMG). Using a Markov Chain description, we study the many possible paths the system may take. This `many-worlds' view not only allows us to predict the start and end of a crash in this system, but also to investigate how such a crash may be avoided. We find that the system can be `immunized' against large changes: by inducing small changes today, much larger changes in the future can be prevented.

cond-mat.dis-nn↗

arXiv2002

Anatomy of extreme events in a complex adaptive system

We provide an analytic, microscopic analysis of extreme events in an adaptive population comprising competing agents (e.g. species, cells, traders, data-packets). Such large changes tend to dictate the long-term dynamical behaviour of many real-world systems in both the natural and social sciences. Our results reveal a taxonomy of extreme events, and provide a microscopic understanding as to their build-up and likely duration.

cond-mat.dis-nn↗

arXiv2001

Decoherence of quantum registers

The dynamical evolution of a quantum register of arbitrary length coupled to an environment of arbitrary coherence length is predicted within a relevant model of decoherence. The results are reported for quantum bits (qubits) coupling individually to different environments (`independent decoherence') and qubits interacting collectively with the same reservoir (`collective decoherence'). In both cases, explicit decoherence functions are derived for any number of qubits. The decay of the coherences of the register is shown to strongly depend on the input states: we show that this sensitivity is a characteristic of $both$ types of coupling (collective and independent) and not only of the collective coupling, as has been reported previously. A non-trivial behaviour ("recoherence") is found in the decay of the off-diagonal elements of the reduced density matrix in the specific situation of independent decoherence. Our results lead to the identification of decoherence-free states in the collective decoherence limit. These states belong to subspaces of the system's Hilbert space that do not get entangled with the environment, making them ideal elements for the engineering of ``noiseless'' quantum codes. We also discuss the relations between decoherence of the quantum register and computational complexity based on the new dynamical results obtained for the register density matrix.

quant-ph↗

arXiv2001

Dynamics of the Time Horizon Minority Game

We present exact analytic results for a new version of the Minority Game (MG) in which strategy performance is recorded over a finite time horizon. The dynamics of this Time Horizon Minority Game (THMG) exhibit many distinct features from the MG and depend strongly on whether the participants are fed real, or random, history strings. The THMG equations are equivalent to a Markov Chain, and yield exact analytic results for the volatility given a specific realization for the quenched strategy disorder.

cond-mat.dis-nn↗

arXiv2001

Evolutionary quantum game

We present the first study of a dynamical quantum game. Each agent has a `memory' of her performance over the previous m timesteps, and her strategy can evolve in time. The game exhibits distinct regimes of optimality. For small m the classical game performs better, while for intermediate m the relative performance depends on whether the source of qubits is `corrupt'. For large m, the quantum players dramatically outperform the classical players by `freezing' the game into high-performing attractors in which evolution ceases.

quant-ph↗

arXiv2000

Playing a quantum game with a corrupted source

The quantum advantage arising in a simplified multi-player quantum game, is found to be a disadvantage when the game's qubit-source is corrupted by a noisy "demon". Above a critical value of the corruption-rate, or noise-level, the coherent quantum effects impede the players to such an extent that the optimal choice of game changes from quantum to classical.

quant-ph↗