arXiv subjects
Publications and source records attributed to Fumiaki Morikoshi.
An information-theoretic temporal Bell inequality is formulated to contrast classical and quantum computations. Any classical algorithm satisfies the inequality, while quantum ones can violate it. Therefore, the violation of the inequality is an immediate consequence of the quantumness in the computation. Furthermore, this approach suggests a notion of temporal nonlocality in quantum computation.
Ordering physical states is the key to quantifying some physical property of the states uniquely. Bipartite pure entangled states are totally ordered under local operations and classical communication (LOCC) in the asymptotic limit and uniquely quantified by the well-known entropy of entanglement. However, we show that mixed entangled states are partially ordered under LOCC even in the asymptotic limit. Therefore, non-uniqueness of entanglement measure is understood on the basis of an operational notion of asymptotic convertibility.
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.
Effects of quantum and classical correlations on game theory are studied to clarify the new aspects brought into game theory by the quantum mechanical toolbox. In this study, we compare quantum correlation represented by a maximally entangled state and classical correlation that is generated through phase damping processes on the maximally entangled state. Thus, this also sheds light on the behavior of games under the influence of noisy sources. It is observed that the quantum correlation can always resolve the dilemmas in non-zero sum games and attain the maximum sum of both players' payoffs, while the classical correlation cannot necessarily resolve the dilemmas.
Effects of classical/quantum correlations and operations in game theory are analyzed using Samaritan's Dilemma. We observe that introducing either quantum or classical correlations to the game results in the emergence of a unique or multiple Nash equilibria (NE) which do not exist in the original classical game. It is shown that the strategies creating the NE and the amount of payoffs the players receive at these NE's depend on the type of the correlation. We also discuss whether the Samaritan can resolve the dilemma acting unilaterally.
Consider entanglement concentration schemes that convert n identical copies of a pure state into a maximally entangled state of a desired size with success probability being close to one in the asymptotic limit. We give the distillable entanglement, the number of Bell pairs distilled per copy, as a function of an error exponent, which represents the rate of decrease in failure probability as n tends to infinity. The formula fills the gap between the least upper bound of distillable entanglement in probabilistic concentration, which is the well-known entropy of entanglement, and the maximum attained in deterministic concentration. The method of types in information theory enables the detailed analysis of the distillable entanglement in terms of the error rate. In addition to the probabilistic argument, we consider another type of entanglement concentration scheme, where the initial state is deterministically transformed into a (possibly mixed) final state whose fidelity to a maximally entangled state of a desired size converges to one in the asymptotic limit. We show that the same formula as in the probabilistic argument is valid for the argument on fidelity by replacing the success probability with the fidelity. Furthermore, we also discuss entanglement yield when optimal success probability or optimal fidelity converges to zero in the asymptotic limit (strong converse), and give the explicit formulae for those cases.
Deterministic extraction of Bell pairs from a finite number of partially entangled pairs is discussed. We derive the maximum number of Bell pairs that can be obtained with probability 1 by local operations and classical communication. It is proved that the optimal deterministic concentration needs only a two-pair collective manipulation in each step, and that a collective manipulation of all entangled pairs is not necessary. Finally, this scheme reveals an entanglement measure for the deterministic concentration.
When an entangled state is transformed into another one with probability one by local operations and classical communication, the quantity of entanglement decreases. This letter shows that entanglement lost in the manipulation can be partially recovered by an auxiliary entangled pair. As an application, a maximally entangled pair can be obtained from two partially entangled pairs with probability one. Finally, this recovery scheme reveals a fundamental property of entanglement relevant to the existence of incomparable states.
Recently a new entanglemenet dilution scheme has been constructed by Lo and Popescu. This paper points out that this result has a deep implication that the entanglement measure for bipartite pure states is independent of the distance between entangled two systems.