Distinguishing between optical coherent states with imperfect detection

Several proposed techniques for distinguishing between optical coherent states are analyzed under a physically realistic model of photodetection. Quantum error probabilities are derived for the Kennedy receiver, the Dolinar receiver and the unitary rotation scheme proposed by Sasaki and Hirota for sub-unity detector efficiency. Monte carlo simulations are performed to assess the effects of detector dark counts, dead time, signal processing bandwidth and phase noise in the communication channel. The feedback strategy employed by the Dolinar receiver is found to achieve the Helstrom bound for sub-unity detection efficiency and to provide robustness to these other detector imperfections making it more attractive for laboratory implementation than previously believed

Beyond local Nash equilibria for adversarial networks

Save for some special cases, current training methods for Generative Adversarial Networks (GANs) are at best guaranteed to converge to a ‘local Nash equilibrium’ (LNE). Such LNEs, however, can be arbitrarily far from an actual Nash equilibrium (NE), which implies that there are no guarantees on the quality of the found generator or classifier. This paper proposes to model GANs explicitly as finite games in mixed strategies, thereby ensuring that every LNE is an NE. We use the Parallel Nash Memory as a solution method, which is proven to monotonically converge to a resource-bounded Nash equilibrium. We empirically demonstrate that our method is less prone to typical GAN problems such as mode collapse and produces solutions that are less exploitable than those produced by GANs and MGANs

Complementary cooperation, minimal winning coalitions, and power indices

We introduce a new simple game, which is referred to as the complementary weighted multiple majority game (C-WMMG for short). C-WMMG models a basic cooperation rule, the complementary cooperation rule, and can be taken as a sister model of the famous weighted majority game (WMG for short). In this paper, we concentrate on the two dimensional C-WMMG. An interesting property of this case is that there are at most $n+1$ minimal winning coalitions (MWC for short), and they can be enumerated in time $O(n\log n)$, where $n$ is the number of players. This property guarantees that the two dimensional C-WMMG is more handleable than WMG. In particular, we prove that the main power indices, i.e. the Shapley-Shubik index, the Penrose-Banzhaf index, the Holler-Packel index, and the Deegan-Packel index, are all polynomially computable. To make a comparison with WMG, we know that it may have exponentially many MWCs, and none of the four power indices is polynomially computable (unless P=NP). Still for the two dimensional case, we show that local monotonicity holds for all of the four power indices. In WMG, this property is possessed by the Shapley-Shubik index and the Penrose-Banzhaf index, but not by the Holler-Packel index or the Deegan-Packel index. Since our model fits very well the cooperation and competition in team sports, we hope that it can be potentially applied in measuring the values of players in team sports, say help people give more objective ranking of NBA players and select MVPs, and consequently bring new insights into contest theory and the more general field of sports economics. It may also provide some interesting enlightenments into the design of non-additive voting mechanisms. Last but not least, the threshold version of C-WMMG is a generalization of WMG, and natural variants of it are closely related with the famous airport game and the stable marriage/roommates problem.Comment: 60 page

N-player quantum games in an EPR setting

The $N$-player quantum game is analyzed in the context of an Einstein-Podolsky-Rosen (EPR) experiment. In this setting, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical choice between two directions along which spin or polarization measurements are made. The players' strategies thus remain identical to their strategies in the mixed-strategy version of the classical game. In the EPR setting the quantum game reduces itself to the corresponding classical game when the shared quantum state reaches zero entanglement. We find the relations for the probability distribution for $N$-qubit GHZ and W-type states, subject to general measurement directions, from which the expressions for the mixed Nash equilibrium and the payoffs are determined. Players' payoffs are then defined with linear functions so that common two-player games can be easily extended to the $N$-player case and permit analytic expressions for the Nash equilibrium. As a specific example, we solve the Prisoners' Dilemma game for general $N \ge 2$. We find a new property for the game that for an even number of players the payoffs at the Nash equilibrium are equal, whereas for an odd number of players the cooperating players receive higher payoffs.Comment: 26 pages, 2 figure

Bell Correlations and the Common Future

Reichenbach's principle states that in a causal structure, correlations of classical information can stem from a common cause in the common past or a direct influence from one of the events in correlation to the other. The difficulty of explaining Bell correlations through a mechanism in that spirit can be read as questioning either the principle or even its basis: causality. In the former case, the principle can be replaced by its quantum version, accepting as a common cause an entangled state, leaving the phenomenon as mysterious as ever on the classical level (on which, after all, it occurs). If, more radically, the causal structure is questioned in principle, closed space-time curves may become possible that, as is argued in the present note, can give rise to non-local correlations if to-be-correlated pieces of classical information meet in the common future --- which they need to if the correlation is to be detected in the first place. The result is a view resembling Brassard and Raymond-Robichaud's parallel-lives variant of Hermann's and Everett's relative-state formalism, avoiding "multiple realities."Comment: 8 pages, 5 figure

Symmetry structure in discrete models of biochemical systems : natural subsystems and the weak control hierarchy in a new model of computation driven by interactions

© 2015 The Authors. Published by the Royal Society under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/, which permits unrestricted use, provided the original author and source are credited.Interaction Computing (IC) is inspired by the observation that cell metabolic/regulatory systems construct order dynamically, through constrained interactions between their components and based on a wide range of possible inputs and environmental conditions. The goals of this work are (1) to identify and understand mathematically the natural subsystems and hierarchical relations in natural systems enabling this, and (2) to use the resulting insights to define a new model of computation based on interactions that is useful for both biology and computation. The dynamical characteristics of the cellular pathways studied in Systems Biology relate, mathematically, to the computational characteristics of automata derived from them, and their internal symmetry structures to computational power. Finite discrete automata models of biological systems such as the lac operon, Krebs cycle, and p53-mdm2 genetic regulation constructed from Systems Biology models have canonically associated algebraic structures { transformation semigroups. These contain permutation groups (local substructures exhibiting symmetry) that correspond to "pools of reversibility". These natural subsystems are related to one another in a hierarchical manner by the notion of "weak control ". We present natural subsystems arising from several biological examples and their weak control hierarchies in detail. Finite simple non-abelian groups (SNAGs) are found in biological examples and can be harnessed to realize nitary universal computation. This allows ensembles of cells to achieve any desired finitary computational transformation, depending on external inputs, via suitably constrained interactions. Based on this, interaction machines that grow and change their structure recursively are introduced and applied, providing a natural model of computation driven by interactions.Peer reviewe

Hedgehog pathway mutations drive oncogenic transformation in high-risk T-cell acute lymphoblastic leukemia.

The role of Hedgehog signaling in normal and malignant T-cell development is controversial. Recently, Hedgehog pathway mutations have been described in T-ALL, but whether mutational activation of Hedgehog signaling drives T-cell transformation is unknown, hindering the rationale for therapeutic intervention. Here, we show that Hedgehog pathway mutations predict chemotherapy resistance in human T-ALL, and drive oncogenic transformation in a zebrafish model of the disease. We found Hedgehog pathway mutations in 16% of 109 childhood T-ALL cases, most commonly affecting its negative regulator PTCH1. Hedgehog mutations were associated with resistance to induction chemotherapy (P = 0.009). Transduction of wild-type PTCH1 into PTCH1-mutant T-ALL cells induced apoptosis (P = 0.005), a phenotype that was reversed by downstream Hedgehog pathway activation (P = 0.007). Transduction of most mutant PTCH1, SUFU, and GLI alleles into mammalian cells induced aberrant regulation of Hedgehog signaling, indicating that these mutations are pathogenic. Using a CRISPR/Cas9 system for lineage-restricted gene disruption in transgenic zebrafish, we found that ptch1 mutations accelerated the onset of notch1-induced T-ALL (P = 0.0001), and pharmacologic Hedgehog pathway inhibition had therapeutic activity. Thus, Hedgehog-activating mutations are driver oncogenic alterations in high-risk T-ALL, providing a molecular rationale for targeted therapy in this disease

Observation of trapped light within the radiation continuum

The ability to confine light is important both scientifically and technologically. Many light confinement methods exist, but they all achieve confinement with materials or systems that forbid outgoing waves. These systems can be implemented by metallic mirrors, by photonic band-gap materials, by highly disordered media (Anderson localization) and, for a subset of outgoing waves, by translational symmetry (total internal reflection) or by rotational or reflection symmetry. Exceptions to these examples exist only in theoretical proposals. Here we predict and show experimentally that light can be perfectly confined in a patterned dielectric slab, even though outgoing waves are allowed in the surrounding medium. Technically, this is an observation of an ‘embedded eigenvalue’—namely, a bound state in a continuum of radiation modes—that is not due to symmetry incompatibility. Such a bound state can exist stably in a general class of geometries in which all of its radiation amplitudes vanish simultaneously as a result of destructive interference. This method to trap electromagnetic waves is also applicable to electronic and mechanical waves.United States. Army Research Office (Institute for Soldier Nanotechnologies under contract no. W911NF-07-D0004)United States. Department of Energy (grant no. DE-SC0001299)National Science Foundation (U.S.) (NSF grant no. DMR-0819762

On the optimal investment

In 1988 Dybvig introduced the payoff distribution pricing model (PDPM) as an alternative to the capital asset pricing model (CAPM). Under this new paradigm agents preferences depend on the probability distribution of the payoff and for the same distribution agents prefer the payoff that requires less investment. In this context he gave the notion of efficient payoff. Both approaches run parallel to the theory of choice of von Neumann -Morgenstern (1947), known as the Expected Utility Theory and posterior axiomatic alternatives. In this paper we consider the notion of optimal payoff as that maximizing the terminal position for a chosen preference functional and we investigate the relationship between both concepts, optimal and efficient payoffs, as well as the behavior of the efficient payoffs under different market dynamics. We also show that path-dependent options can be efficient in some simple models

Large scale analytic calculations in quantum field theories

We present a survey on the mathematical structure of zero- and single scale quantities and the associated calculation methods and function spaces in higher order perturbative calculations in relativistic renormalizable quantum field theories.Comment: 25 pages Latex, 1 style fil