Searcharxiv⌕ Search

arXiv subjects

Keiji Matsumoto

Publications and source records attributed to Keiji Matsumoto.

At least 73 records · Page 4Linked to original sources

Self-teleportation and its application on LOCC estimation and other tasks

A way to characterize quantum nonlocality is to see difference in the figure of merit between LOCC optimal protocol and globally optimal protocol in doing certain task, e.g., state estimation, state discrimination, cloning and broadcasting. Especially, we focus on the case where $n$ tensor of unknown states. Our conclusion is that separable pure states are more non-local than entangled pure states. More specifically, the difference in the figure of the merit is exponentially small if the state is entangled, and the exponent is log of the largest Schmidt coefficient. On the other hand, in many cases, estimation of separable states by LOCC is worse than the global optimal estimate by $O(\frac{1}{n})$. To show that the gap is exponentially small for entangled states, we propose self-teleportation protocol as the key component of construct of LOCC protocols. Objective of the protocol is to transfer Alice's part of quantum information by LOCC, using intrinsic entanglement of $| ϕ_θ> ^{\otimes n}$ without using any extra resources. This protocol itself is of interest in its own right.

quant-ph↗

Entanglement cost and distillable entanglement of symmetric states

We compute entanglement cost and distillable entanglement of states supported on symmetric subspace. Not only giving general formula, we apply them to the output states of optimal cloning machines. Surprisingly, under some settings, the optimal n to m clone and true m copies are the same in entanglement measures. However, they differ in the error exponent of entanglement dilution. We also presented a general theory of entanglement dilution which is applicable to any non-i.i.d sequence of states.

quant-ph↗

Strong Super-additivity of the entanglement of formation for pure stabilizer states

We prove the strong super-additivity of the entanglement of formation for stabilizer pure states, and the set of mixed states which minimize their average entropy of entanglement as a mixture of stabilizer pure states sharing the same stabilizer group up to phases. The implications of the result on the additivity of the Holevo capacity of a quantum channel transmitting stabilizer states with Pauli noise is discussed.

quant-ph↗

A study of LOCC-detection of a maximally entangled state using hypothesis testing

We study how well answer to the question ``Is the given quantum state equal to a certain maximally entangled state?'' using LOCC, in the context of hypothesis testing. Under several locality and invariance conditions, optimal tests will be derived for several special cases by using basic theory of group representations. Some optimal tests are realized by performing quantum teleportation and checking whether the state is teleported. We will also give a finite process for realizing some optimal tests. The performance of the tests will be numerically compared.

quant-ph↗

Asymptotic performance of optimal state estimation in quantum two level system

We derived an asymptotic bound the accuracy of the estimation when we use the quantum correlation in the measuring apparatus. It is also proved that this bound can be achieved in any model in the quantum two-level system. Moreover, we show that this bound of such a model cannot be attained by any quantum measurement with no quantum correlation in the measuring apparatus. That is, in such a model, the quantum correlation can improve the accuracy of the estimation in an asymptotic setting.

quant-ph↗

Statistical analysis on testing of an entangled state based on Poisson distribution framework

A hypothesis testing scheme for entanglement has been formulated based on the Poisson distribution framework instead of the POVM framework. Three designs were proposed to test the entangled states in this framework. The designs were evaluated in terms of the asymptotic variance. It has been shown that the optimal time allocation between the coincidence and anti-coincidence measurement bases improves the conventional testing method. The test can be further improved by optimizing the time allocation between the anti-coincidence bases.

quant-ph↗

Hypothesis testing for an entangled state produced by spontaneous parametric down conversion

Generation and characterization of entanglement are crucial tasks in quantum information processing. A hypothesis testing scheme for entanglement has been formulated. Three designs were proposed to test the entangled photon states created by the spontaneous parametric down conversion. The time allocations between the measurement vectors were designed to consider the anisotropic deviation of the generated photon states from the maximally entangled states. The designs were evaluated in terms of the p-value based on the observed data. It has been experimentally demonstrated that the optimal time allocation between the coincidence and anti-coincidence measurement vectors improves the entanglement test. A further improvement is also experimentally demonstrated by optimizing the time allocation between the anti-coincidence vectors. Analysis on the data obtained in the experiment verified the advantage of the entanglement test designed by the optimal time allocation.

quant-ph↗

Optimal cloning of mixed Gaussian states

We construct the optimal 1 to 2 cloning transformation for the family of displaced thermal equilibrium states of a harmonic oscillator, with a fixed and known temperature. The transformation is Gaussian and it is optimal with respect to the figure of merit based on the joint output state and norm distance. The proof of the result is based on the equivalence between the optimal cloning problem and that of optimal amplification of Gaussian states which is then reduced to an optimization problem for diagonal states of a quantum oscillator. A key concept in finding the optimum is that of stochastic ordering which plays a similar role in the purely classical problem of Gaussian cloning. The result is then extended to the case of n to m cloning of mixed Gaussian states.

quant-ph↗

Properties of Conjugate Channels with Applications to Additivity and Multiplicativity

Quantum channels can be described via a unitary coupling of system and environment, followed by a trace over the environment state space. Taking the trace instead over the system state space produces a different mapping which we call the conjugate channel. We explore the properties of conjugate channels and describe several different methods of construction. In general, conjugate channels map M_d to M_d' with d < d', and different constructions may differ by conjugation with a partial isometry. We show that a channel and its conjugate have the same minimal output entropy and maximal output p-norm. It then follows that the additivity and multiplicativity conjectures for these measures of optimal output purity hold for a product of channels if and only if they also hold for the product of their conjugates. This allows us to reduce these conjectures to the special case of maps taking M_d to M_d' with a minimal representation of dimension at most d. We find explicit expressions for the conjugates for a number of well-known examples, including entanglement-breaking channels, unital qubit channels, the depolarizing channel, and a subclass of random unitary channels. For the entanglement-breaking channels, channels this yields a new class of channels for which additivity and multiplicativity of optimal output purity can be established. For random unitary channels using the generalized Pauli matrices, we obtain a new formulation of the multiplicativity conjecture. The conjugate of the completely noisy channel plays a special role and suggests a mechanism for using noise to transmit information.

quant-ph↗

A simpler proof of zero-knowledge against quantum attacks using Grover's amplitude amplification

Watrous had presented the first proof of zero-knowledge property of a proof system against a quantum verifier. The key of the proof is the construction of a quantum simulator. In the construction, the 'failure state' is rotated to the 'success' state by a tricky operation which is initially developped for the amplification of QMA proof systems. This manuscript presents a new and simpler construction of a simulator. In the construction, we simply amplify the success probability of a classical simulator using Grover's amplification.

quant-ph↗

Can entanglement efficiently be weakend by symmetrization?

Consider a quantum system with $m$ subsystems with $n$ qubits each, and suppose the state of the system is living in the symmetric subspace. It is known that, in the limit of $m\to\infty$, entanglement between any two subsystems vanishes. In this paper we study asymptotic behavior of the entanglement as $m$ and $n$ grows. Our conjecture is that if $m$ is a polynomially bounded function in $n$, then the entanglement decreases polynomially. The motivation of this study is a study of quantum Merlin-Arthur game. If this conjecture is ture, we can prove that bipartite separable certificate does not increase the computational power of the proof system. protocol. In the paper, we provide two evidences which support the conjecture. First, if $m$ is an exponential function, then entanglement decreases exponentially fast. Second, in case of a maximally entangled state, our conjecture is true.

quant-ph↗

Universal entanglement concentration

We propose a new protocol of \textit{universal} entanglement concentration, which converts many copies of an \textit{unknown} pure state to an \textit{% exact} maximally entangled state. The yield of the protocol, which is outputted as a classical information, is probabilistic, and achives the entropy rate with high probability, just as non-universal entanglement concentration protocols do. Our protocol is optimal among all similar protocols in terms of wide varieties of measures either up to higher orders or non-asymptotically, depending on the choice of the measure. The key of the proof of optimality is the following fact, which is a consequence of the symmetry-based construction of the protocol: For any invariant measures, optimal protocols are found out in modifications of the protocol only in its classical output, or the claim on the product. We also observe that the classical part of the output of the protocol gives a natural estimate of the entropy of entanglement, and prove that that estimate achieves the better asymptotic performance than any other (potentially global) measurements.

quant-ph↗

Reverse estimation theory, Complementality between RLD and SLD, and monotone distances

Many problems in quantum information theory can be vied as interconversion between resources. In this talk, we apply this view point to state estimation theory, motivated by the following observations. First, a monotone metric takes value between SLD and RLD Fisher metric. This is quite analogous to the fact that entanglement measures are sandwiched by distillable entanglement and entanglement cost. Second, SLD add RLD are mutually complement via purification of density matrices, but its operational meaning was not clear. To find a link between these observations, we define reverse estimation problem, or simulation of quantum state family by probability distribution family, proving that RLD Fisher metric is a solution to local reverse estimation problem of quantum state family with 1-dim parameter. This result gives new proofs of some known facts and proves one new fact about monotone distances. We also investigate information geometry of RLD, and reverse estimation theory of a multi-dimensional parameter family.

quant-ph↗

Yet another additivity conjecture

It is known that the additivity conjecture of Holevo capacity, output minimum entoropy, and the entanglement of formation (EoF), are equivalent with each other. Among them, the output minimum entropy is simplest, and hence many researchers are focusing on this quantity. Here, we suggest yet another entanglement measure, whose strong superadditivity and additivity are equivalent to the additivity of the quantities mentioned above. This quantity is as simple as the output minimum entropy, and in existing proofs of additivity conjecture of the output minimum entropy for the specific examples, they are essentially proving the strong superadditivity of this quantity.

quant-ph↗

Quantum estimation for non-differentiable models

State estimation is a classical problem in quantum information. In optimization of estimation scheme, to find a lower bound to the error of the estimator is a very important step. So far, all the proposed tractable lower bounds use derivative of density matrix. However, sometimes, we are interested in quantities with singularity, e.g. concurrence etc. In the paper, lower bounds to a Mean Square Error (MSE) of an estimator are derived for a quantum estimation problem without smoothness assumptions. Our main idea is to replace the derivative by difference, as is done in classical estimation theory. We applied the inequalities to several examples, and derived optimal estimator for some of them.

quant-ph↗

Qubit Channels Which Require Four Inputs to Achieve Capacity: Implications for Additivity Conjectures

An example is given of a qubit quantum channel which requires four inputs to maximize the Holevo capacity. The example is one of a family of channels which are related to 3-state channels. The capacity of the product channel is studied and numerical evidence presented which strongly suggests additivity. The numerical evidence also supports a conjecture about the concavity of output entropy as a function of entanglement parameters. However, an example is presented which shows that for some channels this conjecture does not hold for all input states. A numerical algorithm for finding the capacity and optimal inputs is presented and its relation to a relative entropy optimization discussed.

quant-ph↗

Entanglement convertibility for infinite dimensional pure bipartite states

It is shown that the order property of pure bipartite states under SLOCC (stochastic local operations and classical communications) changes radically when dimensionality shifts from finite to infinite. In contrast to finite dimensional systems where there is no pure incomparable state, the existence of infinitely many mutually SLOCC incomparable states is shown for infinite dimensional systems even under the bounded energy and finite information exchange condition. These results show that the effect of the infinite dimensionality of Hilbert space, the ``infinite workspace'' property, remains even in physically relevant infinite dimensional systems.

quant-ph↗

Existence of incomparable pure bipartite states in infinite dimensional systems

Based on set theoretic ordering properties, a general formulation for constructing a pair of convertibility monotones, which are generalizations of distillable entanglement and entanglement cost, is presented. The new pair of monotones do not always coincide for pure bipartite infinite dimensional states under SLOCC (stochastic local operations and classical communications), demonstrating the existence of SLOCC incomparable pure bipartite states, a new property of entanglement in infinite dimensional systems, with no counterpart in the corresponding finite dimensional systems.

quant-ph↗