A probabilistic position value

In this article, we generalize the position value, defined by Meessen (1988) for the class of deterministic communication situations, to the class of generalized probabilistic communication situations (G´omez et al. (2008)). We provide two characterizations of this new allocation rule. Following in Slikker’s (2005a) footsteps, we characterize the probabilistic position value using probabilistic versions of component eciency and balanced link contributions. Then we generalize the notion of link potential, defined by Slikker (2005b) for the class of deterministic communication situations, to the class of generalized probabilistic communication situations, and use it to characterize our allocation rule. Finally, we show that these two characterizations are logically equivalent.Game Theory, TU Games, Graph-restricted Games, Position Value.Game Theory, TU Games, Graph-restricted Games, Position Value.

Controlled bidirectional remote state preparation in noisy environment: A generalized view

It is shown that a realistic, controlled bidirectional remote state preparation is possible using a large class of entangled quantum states having a particular structure. Existing protocols of probabilistic, deterministic and joint remote state preparation are generalized to obtain the corresponding protocols of controlled bidirectional remote state preparation (CBRSP). A general way of incorporating the effects of two well known noise processes, the amplitude-damping and phase-damping noise, on the probabilistic CBRSP process is studied in detail by considering that noise only affects the travel qubits of the quantum channel used for the probabilistic CBRSP process. Also indicated is how to account for the effect of these noise channels on deterministic and joint remote state CBRSP protocols.Comment: 11 pages, 2 figure

Identification of a reversible quantum gate: assessing the resources

We assess the resources needed to identify a reversible quantum gate among a finite set of alternatives, including in our analysis both deterministic and probabilistic strategies. Among the probabilistic strategies we consider unambiguous gate discrimination, where errors are not tolerated but inconclusive outcomes are allowed, and we prove that parallel strategies are sufficient to unambiguously identify the unknown gate with minimum number of queries. This result is used to provide upper and lower bounds on the query complexity and on the minimum ancilla dimension. In addition, we introduce the notion of generalized t-designs, which includes unitary t-designs and group representations as special cases. For gates forming a generalized t-design we give an explicit expression for the maximum probability of correct gate identification and we prove that there is no gap between the performances of deterministic strategies an those of probabilistic strategies. Hence, evaluating of the query complexity of perfect deterministic discrimination is reduced to the easier problem of evaluating the query complexity of unambiguous discrimination. Finally, we consider discrimination strategies where the use of ancillas is forbidden, providing upper bounds on the number of additional queries needed to make up for the lack of entanglement with the ancillas.Comment: 24 + 8 pages, published versio

Hierarchical Joint Remote State Preparation in Noisy Environment

A novel scheme for quantum communication having substantial applications in practical life is designed and analyzed. Specifically, we have proposed a hierarchical counterpart of the joint remote state preparation (JRSP) protocol, where two senders can jointly and remotely prepare a quantum state. One sender has the information regarding amplitude, while the other one has the phase information of a quantum state to be jointly prepared at the receiver's port. However, there exists a hierarchy among the receivers, as far as powers to reconstruct the quantum state is concerned. A 5-qubit cluster state has been used here to perform the task. Further, it is established that the proposed scheme for hierarchical JRSP (HJRSP) is of enormous practical importance in critical situations involving defense and other sectors, where it is essential to ensure that an important decision/order that can severely affect a society or an organization is not taken by a single person, and once the order is issued all the receivers don't possess an equal right to implement it. Further, the effect of different noise models (e.g., amplitude damping (AD), phase damping (PD), collective noise and Pauli noise models) on the HJRSP protocol proposed here is investigated. It is found that in AD and PD noise models a higher power agent can reconstruct the quantum state to be remotely prepared with higher fidelity than that done by the lower power agent(s). In contrast, the opposite may happen in the presence of collective noise models. We have also proposed a scheme for probabilistic HJRSP using a non-maximally entangled 5-qubit cluster state.Comment: 24 pages, 6 figure

Parallel ACO with a Ring Neighborhood for Dynamic TSP

The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distances between cities as travel times are no longer fixed. The new technique uses a parallel model for a problem variant that allows a slight movement of nodes within their Neighborhoods. The algorithm is tested with success on several large data sets.Comment: 8 pages, 1 figure; accepted J. Information Technology Researc

Probabilistic Quantum Teleportation

We consider a generalized quantum teleportation protocol for an unknown qubit using non-maximally entangled state as a shared resource. Without recourse to local filtering or entanglement concentration, using standard Bell-state measurement and classical communication one cannot teleport the state with unit fidelity and unit probability. We show that using non-maximally entangled measurements one can teleport an unknown state with unit fidelity albeit with reduced probability, hence probabilistic teleportation. We also give a generalized protocol for entanglement swapping using non-maximally entangled states.Comment: Latex file, 11 pages, No figure

Statistical mechanical foundations of power-law distributions

The foundations of the Boltzmann-Gibbs (BG) distributions for describing equilibrium statistical mechanics of systems are examined. Broadly, they fall into: (i) probabilistic paaroaches based on the principle of equal a priori probability (counting technique and method of steepest descents), law of large numbers, or the state density considerations and (ii) a variational scheme -- maximum entropy principle (due to Gibbs and Jaynes) subject to certain constraints. A minimum set of requirements on each of these methods are briefly pointed out: in the first approach, the function space and the counting algorithm while in the second, "additivity" property of the entropy with respect to the composition of statistically independent systems. In the past few decades, a large number of systems, which are not necessarily in thermodynamic equilibrium (such as glasses, for example), have been found to display power-law distributions, which are not describable by the above-mentioned methods. In this paper, parallel to all the inquiries underlying the BG program described above are given in a brief form. In particular, in the probabilistic derivations, one employs a different function space and one gives up "additivity" in the variational scheme with a different form for the entropy. The requirement of stability makes the entropy choice to be that proposed by Tsallis. From this a generalized thermodynamic description of the system in a quasi-equilibrium state is derived. A brief account of a unified consistent formalism associated with systems obeying power-law distributions precursor to the exponential form associated with thermodynamic equilibrium of systems is presented here.Comment: 19 pages, no figures. Invited talk at Anomalous Distributions, Nonlinear Dynamics and Nonextensivity, Santa Fe, USA, November 6-9, 200