arXiv subjects
Publications and source records attributed to Berry Groisman.
It has been shown elsewhere that quantum resources can allow us to achieve a family of equilibria that can have sometimes a better social welfare, while guaranteeing privacy. We use graph games to propose a way to build non-cooperative games from graph states, and we show how to achieve an unlimited improvement with quantum advice compared to classical advice.
N. Vyas and C. Benjamin (arXiv:1701.08573[quant-ph]) propose a new mixed strategy for the (quantum) Hawk-Dove and Prisoners' Dilemma games and argue that this strategy yields payoffs, which cannot be obtained in the corresponding classical games. They conclude that this refutes the earlier assertion by S.J. van Enk and R. Pike that the quantum equilibrium solution is present in a corresponding extended classical game. This paper argues that the scheme suggested by N. Vyas and C. Benjamin changes the rules of the original game, and hence it does not refute the argument put forward by van Enk and Pike.
We introduce a new aspect of nonlocality which arises when the task of quantum states distinguishability is considered under local operations and shared entanglement in the absence of classical communication. We find the optimal amount of entanglement required to accomplish the task perfectly for sets of orthogonal states and argue that it quantifies information nonlocality.
We propose a toy-model theory, that mimics various characteristic features of quantum mechanics. Unlike the toy-models previously studied in the literature, our toy-model allows for an observer to have a full knowledge of a system's real (ontic) state. This is achieved by introducing domains of disjointness, that is by allowing ontic states to be "non-orthogonal". The observer can perform tests which allow her to distinguish between the states in a single domain of disjointness, but not between all ontic states at once. The consequence of this assumption is that the ontic picture is extended to include joint states of two or more systems. This effectively amounts to emergence of entanglement in the model. We argue that these features, albeit being a "non-classical" element in the theory, support the view that quantum-mechanical states are ontic states.
The method of using concepts and insight from quantum information theory in order to solve problems in reversible classical computing (introduced in Ref. [1]) have been generalized to irreversible classical computing. The method have been successfully tested on two computational tasks. Several basic logic gates have been analyzed and the nonlocal content of the associate quantum transformations have been calculated. The results provide us with new interesting insight into the notion of complexity of logic operations.
Since its discovery quantum teleportation has often been seen as a manifestation, indeed the epitome, of the very paradoxical and mysterious nature of quantum theory itself. It is commonly regarded as genuinely quantum and essentially paradoxical. Although a common approach to teleportation amongst physicists nowadays is a somewhat operational one, some researchers are making an effort to deflate the above views. On the one hand, it was recently argued that the paradox of information transfer taking place in teleportation is dissolved (Timpson, 2006) by appealing the very notion of information. On the other hand, it was demonstrated that some classical versions of teleportation retain its important features, which hitherto were considered genuinely quantum (Cohen, 2003; Collins&Popescu, 2002; Hardy, 1999; Mor, 2006; Spekkens, 2007). I will present a special version of a quantum teleportation protocol which is in a sense split into classical and quantum steps. This description provides us with a unified picture of teleportation in both domains. It will be explicitly shown how classical teleportation is embedded in the quantum protocol. Moreover, the classical step can be successfully accomplished even if the state shared by the parties is completely disentangled [this is consistent with the result obtained in (Wang, 2005)]. Yet, all the (apparent) paradoxical features usually associated with quantum teleportation are clearly present in this step. In particular, this demonstrates that entanglement cannot be ultimately responsible and not necessary for the (paradoxical?) information transfer. Thus, even if one considers teleportation as mysterious, all its mysteries are shifted from quantum domain into purely classical one.
The way a rational agent changes her belief in certain propositions/hypotheses in the light of new evidence lies at the heart of Bayesian inference. The basic natural assumption, as summarized in van Fraassen's Reflection Principle ([1984]), would be that in the absence of new evidence the belief should not change. Yet, there are examples that are claimed to violate this assumption. The apparent paradox presented by such examples, if not settled, would demonstrate the inconsistency and/or incompleteness of the Bayesian approach and without eliminating this inconsistency, the approach cannot be regarded as scientific. The Sleeping Beauty Problem is just such an example. The existing attempts to solve the problem fall into three categories. The first two share the view that new evidence is absent, but differ about the conclusion of whether Sleeping Beauty should change her belief or not, and why. The third category is characterized by the view that, after all, new evidence (although hidden from the initial view) is involved. My solution is radically different and does not fall in either of these categories. I deflate the paradox by arguing that the two different degrees of belief presented in the Sleeping Beauty Problem are in fact beliefs in two different propositions, i.e. there is no need to explain the (un)change of belief.
Entangling and disentangling capacities are the key manifestation of the nonlocal content of a quantum operation. A lot of effort has been put recently into investigating (dis)entangling capacities of unitary operations, but very little is known about capacities of non-unitary operations. Here we investigate (dis)entangling capacities of unital CPTP maps acting on two qubits.
Entanglement is one of the pillars of quantum mechanics and quantum information processing, and as a result the quantumness of nonentangled states has typically been overlooked and unrecognized. We give a robust definition for the classicality versus quantumness of a single multipartite quantum state, a set of states, and a protocol using quantum states. We show a variety of nonentangled (separable) states that exhibit interesting quantum properties, and we explore the ``zoo'' of separable states; several interesting subclasses are defined based on their diagonalizing bases, and their non-classical behavior is investigated.
The problem of the reliable transfer of entanglement from one pure bipartite quantum state to another using local operations is analyzed. It is shown that in the case of qubits the amount that can be transferred is restricted to the difference between the entanglement of the two states. In the presence of a catalytic state the range of the transferrable amount broadens to a certain degree.
We investigate the concentration of multi-party entanglement by focusing on simple family of three-partite pure states, superpositions of Greenberger-Horne-Zeilinger states and singlets. Despite the simplicity of the states, we show that they cannot be reversibly concentrated by the standard entanglement concentration procedure, to which they seem ideally suited. Our results cast doubt on the idea that for each N there might be a finite set of N-party states into which any pure state can be reversibly transformed. We further relate our results to the concept of locking of entanglement of formation.
The question of finding a lower bound on the number of Toffoli gates in a classical reversible circuit is addressed. A method based on quantum information concepts is proposed. The method involves solely concepts from quantum information - there is no need for an actual physical quantum computer. The method is illustrated on the example of classical Shannon data compression.
We give an operational definition of the quantum, classical and total amount of correlations in a bipartite quantum state. We argue that these quantities can be defined via the amount of work (noise) that is required to erase (destroy) the correlations: for the total correlation, we have to erase completely, for the quantum correlation one has to erase until a separable state is obtained, and the classical correlation is the maximal correlation left after erasing the quantum correlations. In particular, we show that the total amount of correlations is equal to the quantum mutual information, thus providing it with a direct operational interpretation for the first time. As a byproduct, we obtain a direct, operational and elementary proof of strong subadditivity of quantum entropy.
We propose and study a method for using non-maximally entangled states to implement probabilistically non-local gates. Unlike distillation-based protocols, this method does not generate a maximally entangled state at intermediate stages of the process. As a consequences, the method becomes more efficient at a certain range of parameters. Gates of the form $\exp[iξσ_{n_A}σ_{n_B}]$ with $ξ\ll1$, can be implemented with nearly unit probability and with vanishingly small entanglement, while for the distillation-based method the gate is produced with a vanishing success probability. We also derive an upper bound to the optimal success probability and show that in the small entanglement limit, the bound is tight.
Consistency with relativistic causality narrows down dramatically the class of measurable observables. We argue that by weakening the preparation role of ideal measurements, many of these observables become measurable. Particularly, we show by applying entanglement assisted remote operations, that all Hermitian observable of a $2\times2$-dimensional bipartite system are measurable.
We present a systematic simple method for constructing deterministic remote operations on single and multiple systems of arbitrary discrete dimensionality. These operations include remote rotations, remote interactions and measurements. The resources needed for an operation on a two-level system are one ebit and a bidirectional communication of two cbits, and for an n-level system, a pair of entangled n-level particles and two classical ``nits''. In the latter case, there are $n-1$ possible distinct operations per one n-level entangled pair. Similar results apply for generating interaction between a pair of remote systems and for remote measurements. We further consider remote operations on $N$ spatially distributed systems, and show that the number of possible distinct operations increases here exponentially, with the available number of entangled pairs that are initial distributed between the systems. Our results follow from the properties of a hybrid state-operator object (``stator''), which describes quantum correlations between states and operations.
An alternative proof for existence of ``quantum nonlocality without entanglement'', i.e. existence of variables with product-state eigenstates which cannot be measured locally, is presented. A simple``nonlocal'' variable for the case of one-way communication is given and the limit for its approximate measurability is found.