Masahito Hayashi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Masahito Hayashi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Harumichi Nishimura
School of Science Osaka Prefecture University
4 shared publications - Kazuo Iwama
Kyoto University
4 shared publications - Shigeru Yamashita
Graduate School of Information Science Nara Institute of Science and Technology
4 shared publications - Keiji Matsumoto
Department of Mathematics, Faculty of Science, Hokkaido University, Sapporo 060-0810, Japan
3 shared publications - Rudy Raymond
Tokyo Research Laboratory IBM Japan
3 shared publications - Akinori Kawachi
Tokyo Institute of Technology
1 shared publication
Latest Publications
- Open Access
General theory for decoy-state quantum key distribution with arbitrary number of intensities
We develop a general theory for quantum key distribution (QKD) in both the forward error correction and the reverse error correction cases when the QKD system is equipped with phase-randomized coherent light with arbitrary number of decoy intensities. For this purpose, generalizing Wang's expansion, we derive a convex expansion of the phase-randomized coherent state. We also numerically check that the asymptotic key generation rates are almost saturated when the number of decoy intensities is three.
Open AccessGeneral theory for decoy-state quantum key distribution with arbitrary number of intensities
We develop a general theory for quantum key distribution (QKD) in both the forward error correction and the reverse error correction cases when the QKD system is equipped with phase-randomized coherent light with arbitrary number of decoy intensities. For this purpose, generalizing Wang's expansion, we derive a convex expansion of the phase-randomized coherent state. We also numerically check that the asymptotic key generation rates are almost saturated when the number of decoy intensities is three.
- Open Access
- 1 August 2007
- Published by IOP Publishing in New Journal of Physics
- Vol. 9 (8) , 284
General theory for decoy-state quantum key distribution with an arbitrary number of intensities
We develop a general theory for quantum key distribution (QKD) in both the forward error correction and the reverse error correction cases when the QKD system is equipped with phase-randomized coherent light with an arbitrary number of decoy intensities. For this purpose, generalizing Wang's expansion, we derive a convex expansion of the phase-randomized coherent state. We also numerically check that the asymptotic key generation rates are almost saturated when the number of decoy intensities is three.
- 1 August 2007
- Published by IOP Publishing in New Journal of Physics
- Vol. 9 (8) , 284
Open AccessGeneral theory for decoy-state quantum key distribution with an arbitrary number of intensities
We develop a general theory for quantum key distribution (QKD) in both the forward error correction and the reverse error correction cases when the QKD system is equipped with phase-randomized coherent light with an arbitrary number of decoy intensities. For this purpose, generalizing Wang's expansion, we derive a convex expansion of the phase-randomized coherent state. We also numerically check that the asymptotic key generation rates are almost saturated when the number of decoy intensities is three.
- 26 July 2007
- Published by American Physical Society (APS) in Physical Review A
- Vol. 76 (1) , 012329
Upper bounds of eavesdropper’s performances in finite-length code with the decoy method
Security formulas of quantum key distribution (QKD) with imperfect resources are obtained for finite-length code when the decoy method is applied. This analysis is useful for guaranteeing the security of implemented QKD systems. Our formulas take into account the effect of the vacuum state and dark counts in the detector. We compare the asymptotic key generation rate in the presence of dark counts to that without the presence of dark counts.
- 26 July 2007
- Published by American Physical Society (APS) in Physical Review A
- Vol. 76 (1) , 012329
Upper bounds of eavesdropper’s performances in finite-length code with the decoy method
Security formulas of quantum key distribution (QKD) with imperfect resources are obtained for finite-length code when the decoy method is applied. This analysis is useful for guaranteeing the security of implemented QKD systems. Our formulas take into account the effect of the vacuum state and dark counts in the detector. We compare the asymptotic key generation rate in the presence of dark counts to that without the presence of dark counts.
- Open Access
Quantum Measurements for Hidden Subgroup Problems with Optimal Sample Complexity
One of the central issues in the hidden subgroup problem is to bound the sample complexity, i.e., the number of identical samples of coset states sufficient and necessary to solve the problem. In this paper, we present general bounds for the sample complexity of the identification and decision versions of the hidden subgroup problem. As a consequence of the bounds, we show that the sample complexity for both of the decision and identification versions is $\Theta(\log|\HH|/\log p)$ for a candidate set $\HH$ of hidden subgroups in the case that the candidate subgroups have the same prime order $p$, which implies that the decision version is at least as hard as the identification version in this case. In particular, it does so for the important instances such as the dihedral and the symmetric hidden subgroup problems. Moreover, the upper bound of the identification is attained by the pretty good measurement. This shows that the pretty good measurement can identify any hidden subgroup of an arbitrary group with at most $O(\log|\HH|)$ samples.Open AccessQuantum Measurements for Hidden Subgroup Problems with Optimal Sample Complexity
One of the central issues in the hidden subgroup problem is to bound the sample complexity, i.e., the number of identical samples of coset states sufficient and necessary to solve the problem. In this paper, we present general bounds for the sample complexity of the identification and decision versions of the hidden subgroup problem. As a consequence of the bounds, we show that the sample complexity for both of the decision and identification versions is $\Theta(\log|\HH|/\log p)$ for a candidate set $\HH$ of hidden subgroups in the case that the candidate subgroups have the same prime order $p$, which implies that the decision version is at least as hard as the identification version in this case. In particular, it does so for the important instances such as the dihedral and the symmetric hidden subgroup problems. Moreover, the upper bound of the identification is attained by the pretty good measurement. This shows that the pretty good measurement can identify any hidden subgroup of an arbitrary group with at most $O(\log|\HH|)$ samples. - Open Access
Quantum Network Coding
Since quantum information is continuous, its handling is sometimes surprisingly harder than the classical counterpart. A typical example is cloning; making a copy of digital information is straightforward but it is not possible exactly for quantum information. The question in this paper is whether or not quantum network coding is possible. Its classical counterpart is another good example to show that digital information flow can be done much more efficiently than conventional (say, liquid) flow. Our answer to the question is similar to the case of cloning, namely, it is shown that quantum network coding is possible if approximation is allowed, by using a simple network model called Butterfly. In this network, there are two flow paths, s_1 to t_1 and s_2 to t_2, which shares a single bottleneck channel of capacity one. In the classical case, we can send two bits simultaneously, one for each path, in spite of the bottleneck. Our results for quantum network coding include: (i) We can send any quantum state |psi_1> from s_1 to t_1 and |psi_2> from s_2 to t_2 simultaneously with a fidelity strictly greater than 1/2. (ii) If one of |psi_1> and |psi_2> is classical, then the fidelity can be improved to 2/3. (iii) Similar improvement is also possible if |psi_1> and |psi_2> are restricted to only a finite number of (previously known) states. (iv) Several impossibility results including the general upper bound of the fidelity are also given.
Open AccessQuantum Network Coding
Since quantum information is continuous, its handling is sometimes surprisingly harder than the classical counterpart. A typical example is cloning; making a copy of digital information is straightforward but it is not possible exactly for quantum information. The question in this paper is whether or not quantum network coding is possible. Its classical counterpart is another good example to show that digital information flow can be done much more efficiently than conventional (say, liquid) flow. Our answer to the question is similar to the case of cloning, namely, it is shown that quantum network coding is possible if approximation is allowed, by using a simple network model called Butterfly. In this network, there are two flow paths, s_1 to t_1 and s_2 to t_2, which shares a single bottleneck channel of capacity one. In the classical case, we can send two bits simultaneously, one for each path, in spite of the bottleneck. Our results for quantum network coding include: (i) We can send any quantum state |psi_1> from s_1 to t_1 and |psi_2> from s_2 to t_2 simultaneously with a fidelity strictly greater than 1/2. (ii) If one of |psi_1> and |psi_2> is classical, then the fidelity can be improved to 2/3. (iii) Similar improvement is also possible if |psi_1> and |psi_2> are restricted to only a finite number of (previously known) states. (iv) Several impossibility results including the general upper bound of the fidelity are also given.
- Open Access
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.
Open AccessA 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.
- Open Access
Quantum estimation and the quantum central limit theorem
This paper gives a survey about quantum estimation. We also describes the relation between the quantum central limit theorem and the asymptotic bound of mean square error in quantum state estimation.
Open AccessQuantum estimation and the quantum central limit theorem
This paper gives a survey about quantum estimation. We also describes the relation between the quantum central limit theorem and the asymptotic bound of mean square error in quantum state estimation.
- Open Access
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.
Open AccessSecond 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.
- 7 August 2006
- Published by American Physical Society (APS) in Physical Review A
- Vol. 74 (2) , 022307
Practical evaluation of security for quantum key distribution
Many papers have proven the security of quantum key distribution (QKD) systems 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 required, 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.
- 7 August 2006
- Published by American Physical Society (APS) in Physical Review A
- Vol. 74 (2) , 022307
Practical evaluation of security for quantum key distribution
Many papers have proven the security of quantum key distribution (QKD) systems 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 required, 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.
- Open Access
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.
Open AccessAsymptotic 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.