arXiv subjects

Eyuri Wakakuwa

Publications and source records attributed to Eyuri Wakakuwa.

29 records · Page 2Linked to original sources

arXiv2018

Complexity of causal order structure in distributed quantum information processing and its trade-off with entanglement

We prove a trade-off relation between the entanglement cost and classical communication complexity of causal order structure of a protocol in distributed quantum information processing. We consider an implementation of a class of two-qubit unitary gates by local operations and classical communication (LOCC) assisted with shared entanglement, in an information theoretical scenario of asymptotically many input pairs and vanishingly small error. We prove the trade-off relation by showing that (i) one ebit of entanglement per pair is necessary for implementing the unitary by any two-round protocol, and that (ii) the entanglement cost by a three-round protocol is strictly smaller than one ebit per pair. We also provide an example of bipartite unitary gates for which there is no such trade-off.

quant-ph↗

arXiv2018

The Cost of Randomness for Converting a Tripartite Quantum State to be Approximately Recoverable

We introduce and analyze a task in which a tripartite quantum state is transformed to an approximately recoverable state by a randomizing operation on one of the three subsystems. We consider cases where the initial state is a tensor product of $n$ copies of a tripartite state $ρ^{ABC}$, and is transformed by a random unitary operation on $A^n$ to another state which is approximately recoverable from its reduced state on $A^nB^n$ (Case 1) or $B^nC^n$ (Case 2). We analyze the minimum cost of randomness per copy required for the task in an asymptotic limit of infinite copies and vanishingly small error of recovery, mainly focusing on the case of pure states. We prove that the minimum cost in Case 1 is equal to the Markovianizing cost of the state, for which a single-letter formula is known. With an additional requirement on the convergence speed of the recovery error, we prove that the minimum cost in Case 2 is also equal to the Markovianizing cost. Our results have an application for distributed quantum computation.

quant-ph↗

arXiv2018

A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation

We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic scenario, in which two distant parties perform the same bipartite unitary on infinitely many pairs of inputs. We analyze minimum cost of entanglement and classical communication per copy. For two-round LOCC protocols, we derive a single-letter formula for the minimum cost of entanglement and classical communication, under an additional requirement that the error converges to zero faster than $1/n^4$, where $n$ is the number of input pairs. The formula is given by the "Markovianizing cost" of a tripartite state associated with the unitary, which can be computed by a finite-step algorithm. We also derive a lower bound on the minimum cost of resources, which applies for protocols with arbitrary number of rounds.

quant-ph↗

arXiv2017

Operational Resource Theory of Non-Markovianity

In order to analyze non-Markovianity of tripartite quantum states from a resource theoretical viewpoint, we introduce a class of quantum operations performed by three distant parties, and investigate an operational resource theory (ORT) induced it. A tripartite state is a free state if and only if it is a quantum Markov chain. We prove monotonicity of functions such as the conditional quantum mutual information, intrinsic information, squashed entanglement, a generalization of entanglement of purification, and the relative entropy of recovery. The ORT has five bound sets, each of which corresponds to one of the monotone functions. We introduce a task of "non-Markovianity dilution", and prove that the optimal rate for the task, namely the "non-Markovianity cost", is bounded from above by entanglement of purification in the case of pure states. We also propose a classical resource theory of non-Markovianity.

quant-ph↗

arXiv2017

Large Deviation implies First and Second Laws of Thermodynamics

To reconstruct thermodynamics based on the microscopic laws is one of the most important unfulfilled goals of statistical physics. Here, we show that the first law and the second law for adiabatic processes are derived from an assumption that "probability distributions of energy in Gibbs states satisfy large deviation", which is widely accepted as a property of thermodynamic equilibrium states. We define an adiabatic transformation as a randomized energy-preserving unitary transformations on the many-body systems and the work storage. As the second law, we show that an adiabatic transformation from a set of Gibbs states to another set of Gibbs states is possible if and only if the regularized von Neumann entropy becomes large. As the first law, we show that the energy loss of the thermodynamic systems during the adiabatic transformation is stored in the work storage as "work," in the following meaning; (i) the energy of the work storage takes certain values macroscopically, in the initial state and the final state. (ii) the entropy of the work storage in the final state is macroscopically equal to the entropy of the initial state. As corollaries, our results give the principle of maximam work and the first law for the isothermal processes.

quant-ph↗

arXiv2017

Symmetrizing Cost of Quantum States

We introduce and analyze a task that we call symmetrization, in which a state of a quantum system, associated with a symmetry group, is transformed by a random unitary operation to a symmetric state. Each element of the unitary ensemble is required to be symmetry preserving, in the sense that it keeps the set of symmetric states invariant. We consider an asymptotic limit of infinitely many copies and vanishingly small error, and analyze the symmetrizing cost, that is, the minimum cost of randomness per copy required for symmetrization. We prove that the symmetrizing cost of an arbitrary quantum state is equal to the relative entropy of frameness, thereby providing it with a direct operational meaning.

quant-ph↗

arXiv2017

Asymptotic Convertibility of Entanglement: A General Approach to Entanglement Concentration and Dilution

We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily in tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of pure states.

quant-ph↗

arXiv2016

Markovianizing Cost of Tripartite Quantum States

We introduce and analyze a task that we call Markovianization, in which a tripartite quantum state is transformed to a quantum Markov chain by a randomizing operation on one of the three subsystems. We consider cases where the initial state is the tensor product of $n$ copies of a tripartite state $ρ^{ABC}$, and is transformed to a quantum Markov chain conditioned by $B^n$ with a small error, using a random unitary operation on $A^n$. In an asymptotic limit of infinite copies and vanishingly small error, we analyze the Markovianizing cost, that is, the minimum cost of randomness per copy required for Markovianization. For tripartite pure states, we derive a single-letter formula for the Markovianizing costs. Counterintuitively, the Markovianizing cost is not a continuous function of states, and can be arbitrarily large even if the state is close to a quantum Markov chain. Our results have an application in analyzing the cost of resources for simulating a bipartite unitary gate by local operations and classical communication.

quant-ph↗

arXiv2016

Regularized Boltzmann entropy determines macroscopic adiabatic accessibility

How the thermodynamic entropy $S_{TD}$ is related to the Boltzmann entropy $S_{B}$ has been one of the central issues since the beginning of statistical mechanics. Today, it is believed that the thermodynamic entropy $S_{TD}$ is equal to a function $\tilde{S}_{B}$ that is defined by regularizing the Boltzman entropy in order to ensure extensivity. However, it is not known whether $\tilde{S}_{B}$ completely determines the possibility of a macroscopic adiabatic transformation in the same way as $S_{TD}$ does. In this paper, by formulating the possibility of a macroscopic adiabatic transformations in terms of "coarse-graining" of quantum operations, we prove that $\tilde{S}_{B}$ provides a necessary and sufficient condition for the possibility of a macroscopic adiabatic transformation.

quant-ph↗

arXiv2014

Asymptotic Compressibility of Entanglement and Classical Communication in Distributed Quantum Computation

We consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical communication cost can be compressed by allowing nonzero but vanishing error in the asymptotic limit of infinite pairs. We show that a lower bound on the minimal entanglement cost, the forward classical communication cost, and the backward classical communication cost per pair is given by the Schmidt strength of the unitary. We also prove that an upper bound on these three kinds of the cost is given by the amount of randomness that is required to partially decouple a tripartite quantum state associated with the unitary. In the proof, we construct a protocol in which quantum state merging is used. For generalized Clifford operators, we show that the lower bound and the upper bound coincide. We then apply our result to the problem of distributed compression of tripartite quantum states, and derive a lower and an upper bound on the optimal quantum communication rate required therein.

quant-ph↗

arXiv2012

The chain rule implies Tsirelson's bound: an approach from generalized mutual information

In order to analyze an information theoretical derivation of Tsirelson's bound based on information causality, we introduce a generalized mutual information (GMI), defined as the optimal coding rate of a channel with classical inputs and general probabilistic outputs. In the case where the outputs are quantum, the GMI coincides with the quantum mutual information. In general, the GMI does not necessarily satisfy the chain rule. We prove that Tsirelson's bound can be derived by imposing the chain rule on the GMI. We formulate a principle, which we call the no-supersignalling condition, which states that the assistance of nonlocal correlations does not increase the capability of classical communication. We prove that this condition is equivalent to the no-signalling condition. As a result, we show that Tsirelson's bound is implied by the nonpositivity of the quantitative difference between information causality and no-supersignalling.

quant-ph↗