Searcharxiv⌕ Search

arXiv subjects

Masahito Hayashi

Publications and source records attributed to Masahito Hayashi.

At least 289 records · Page 16Linked to original sources
arXiv2006

Second order asymptotics in fixed-length source coding and intrinsic randomness

Second order asymptotics of fixed-length source coding and intrinsic randomness is discussed with a constant error constraint. There was a difference between optimal rates of fixed-length source coding and intrinsic randomness, which never occurred in the first order asymptotics. In addition, the relation between uniform distribution and compressed data is discussed based on this fact. These results are valid for general information sources as well as independent and identical distributions. A universal code attaining the second order optimal rate is also constructed.

cs.IT↗
arXiv2006

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↗
arXiv2006

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↗
arXiv2006

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↗
arXiv2006

Practical Evaluation of Security for Quantum Key Distribution

Many papers proved the security of quantum key distribution (QKD) system, in the asymptotic framework. The degree of the security has not been discussed in the finite coding-length framework, sufficiently. However, to guarantee any implemented QKD system requires, it is needed to evaluate a protocol with a finite coding-length. For this purpose, we derive a tight upper bound of the eavesdropper's information. This bound is better than existing bounds. We also obtain the exponential rate of the eavesdropper's information. Further, we approximate our bound by using the normal distribution.

quant-ph↗
arXiv2006

(4,1)-Quantum Random Access Coding Does Not Exist

An (n,1,p)-Quantum Random Access (QRA) coding, introduced by Ambainis, Nayak, Ta-shma and Vazirani in ACM Symp. on Theory of Computing 1999, is the following communication system: The sender which has n-bit information encodes his/her information into one qubit, which is sent to the receiver. The receiver can recover any one bit of the original n bits correctly with probability at least p, through a certain decoding process based on positive operator-valued measures. Actually, Ambainis et al. shows the existence of a (2,1,0.85)-QRA coding and also proves the impossibility of its classical counterpart. Chuang immediately extends it to a (3,1,0.79)-QRA coding and whether or not a (4,1,p)-QRA coding such that p > 1/2 exists has been open since then. This paper gives a negative answer to this open question.

quant-ph↗
arXiv2006

Channel capacities of classical and quantum list decoding

We focus on classical and quantum list decoding. The capacity of list decoding was obtained by Nishimura in the case when the number of list does not increase exponentially. However, the capacity of the exponential-list case is open even in the classical case while its converse part was obtained by Nishimura. We derive the channel capacities in the classical and quantum case with an exponentially increasing list. The converse part of the quantum case is obtained by modifying Nagaoka's simple proof for strong converse theorem for channel capacity. The direct part is derived by a quite simple argument.

quant-ph↗
arXiv2006

Optimal Visible Compression Rate For Mixed States Is Determined By Entanglement Of Purification

Entanglement of purification was introduced by Terhal et al. for characterizing the bound of the generation of correlated states from maximally entangled states with sublinear size of classical communication. On the other hand, M. Horodecki obtained the optimal compression rate with a mixed states ensemble in the visible setting. In this paper, we prove that the optimal visible compression rate for mixed states is equal to the limit of the regularized entanglement of purification of the state corresponding to the given ensemble. This result gives a new interpretation to the entanglement of purification.

quant-ph↗
arXiv2006

Parallel Treatment of Estimation of SU(2) and Phase Estimation

We discuss the accuracy of the estimation of the $n$ identical unknown actions of $\SU(2)$ by using entanglement. This problem has a similar structure with the phase estimation problem, which was discussed by Bužek, Derka, and Massar\cite{BDM}. The estimation error asymptotically decreases to zero with an order of $\frac{1}{n^2}$ at least.

quant-ph↗
arXiv2005

General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel

Several non-asymptotic formulas are established in channel resolvability and identification capacity, and they are applied to wire-tap channel. By using these formulas, the $ε$ capacities of the above three problems are considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. As a result, we solve an open problem proposed in Han & Verdu and Han. Moreover, we obtain lower bounds of the exponents of error probability and the wire-tapper's information in wire-tap channel.

cs.IT↗
arXiv2005

Characterization of several kinds of quantum analogues of relative entropy

Quantum relative entropy $D(ρ\|σ)\defeq\Tr ρ(\log ρ- \log σ)$ plays an important role in quantum information and related fields. However, there are many quantum analogues of relative entropy. In this paper, we characterize these analogues from information geometrical viewpoint. We also consider the naturalness of quantum relative entropy among these analogues.

quant-ph↗
arXiv2005

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↗
arXiv2005

Local copying and local discrimination as a study for non-locality of a set

We focus on the non-locality concerning local copying and local discrimination, especially for a set of orthogonal maximally entangled states in prime dimensional systems, as a study of non-locality of a set of states. As a result, for such a set, we completely characterize deterministic local copiability and show that local copying is more difficult than local discrimination. From these result, we can conclude that lack algebraic symmetry causes extra non-locality of a set.

quant-ph↗
arXiv2005

General formulas for fixed-length quantum entanglement concentration

General formulas of entanglement concentration are derived by using an information-spectrum approach for the i.i.d. sequences and the general sequences of partially entangled pure states. That is, we derive general relations between the performance of the entanglement concentration and the eigenvalues of the partially traced state. The achievable rates with constant constraints and those with exponential constraints can be calculated from these formulas.

quant-ph↗
arXiv2004

Local copying of orthogonal maximally entangled states and its relationship to local discrimination

In the quantum system, perfect copying is impossible without prior knowledge. But, perfect copying is possible, if it is known that unknown states to be copied is contained by the set of orthogonal states, which is called the copied set. However, if our operation is limited to local operations and classical communications, this problem is not trivial. Recently, F. Anselmi, A. Chefles and M.B. Plenio constructed theory of local copying when the copied set consists of maximally entangled states. They also classified the copied set when it consists of two orthogonal states (New. J. Phys. 6, 164 (2004)). In this paper, we completely classify the copied set of local copying of the maximally entangled states in the prime dimensional system. That is, we prove that, in the prime dimensional system, the set of locally copiable maximally entangled states is equivalent to the set of Simultaneously Schmidt decomposable canonical form Bell states. As a result, we conclude that local copying of maximally entangled states is much more difficult than local discrimination at least in prime dimensional systems.

quant-ph↗
arXiv2004

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↗