Junichi Shimamura

Faithful Qubit Distribution Assisted by One Additional Qubit against Collective Noise

We propose a distribution scheme of polarization states of a single photon over a collective-noise channel. By adding one extra photon with a fixed polarization, we can protect the state against collective noise via a parity-check measurement and postselection. While the scheme succeeds only probabilistically, it is simpler and more flexible than the schemes utilizing decoherence-free subspace. An application to the Bennett-Brassard 1984 protocol through a collective-noise channel, which is robust to the Trojan horse attack, is also given.

Entangled states that cannot reproduce original classical games in their quantum version

A model of a quantum version of classical games should reproduce the original classical games in order to be able to make a comparative analysis of quantum and classical effects. We analyze a class of symmetric multipartite entangled states and their effect on the reproducibility of the classical games. We present the necessary and sufficient condition for the reproducibility of the original classical games. Satisfying this condition means that complete orthogonal bases can be constructed from a given multipartite entangled state provided that each party is restricted to two local unitary operators. We prove that most of the states belonging to the class of symmetric states with respect to permutations, including the N-qubit W state, do not satisfy this condition.

A necessary and sufficient condition to play games in quantum mechanical settings

Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N-player situations by simply allowing N-partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.

Probabilistic cloning with supplementary information

We consider probabilistic cloning of a state chosen from a mutually nonorthogonal set of pure states, with the help of a party holding supplementary information in the form of pure states. When the number of states is 2, we show that the best efficiency of producing

Experimental ancilla-assisted qubit transmission against correlated noise using quantum parity checking

m

A distribution scheme for qubit over collective-noise channel

copies is always achieved by a two-step protocol in which the helping party first attempts to produce

QUANTUM AND CLASSICAL CORRELATIONS BETWEEN PLAYERS IN GAME THEORY

m\ensuremath{-}1

Quantum advantage does not survive in the presence of a corrupt source: optimal strategies in simultaneous move games

copies from the supplementary state, and if it fails, then the original state is used to produce

Dynamics of a discoordination game with classical and quantum correlations

m

Samaritan's Dilemma: Classical and quantum strategies in Welfare Game

copies. On the other hand, when the number of states exceeds two, the best efficiency is not always achieved by such a protocol. We give examples in which the best efficiency is not achieved even if we allow any amount of one-way classical communication from the helping party.