Faculty Profiles - HAYASHI Masahito

Finding the optimal probe state for multiparameter quantum metrology using conic programming Reviewed Open Access

Hayashi, M; Ouyang, YK

NPJ QUANTUM INFORMATION Vol. 10 ( 1 ) 2024.11

Language：English Publishing type：Research paper (scientific journal) Publisher：npj Quantum Information

The ultimate precision in quantum sensing could be achieved using optimal quantum probe states. However, current quantum sensing protocols do not use probe states optimally. Indeed, the calculation of optimal probe states remains an outstanding challenge. Here, we present an algorithm that efficiently calculates a probe state for correlated and uncorrelated measurement strategies. The algorithm involves a conic program, which minimizes a linear objective function subject to conic constraints on a operator-valued variable. Our algorithm outputs a probe state that is a simple function of the optimal variable. We prove that our algorithm finds the optimal probe state for channel estimation problems, even in the multiparameter setting. For many noiseless quantum sensing problems, we prove the optimality of maximally entangled probe states. We also analyze the performance of 3D-field sensing using various probe states. Our work opens the door for a plethora of applications in quantum metrology.

DOI： 10.1038/s41534-024-00905-x

Reverse em-problem based on Bregman divergence and its application to classical and quantum information theory Reviewed

Asymmetry activation and its relation to coherence under permutation operation Reviewed

Hayashi, M

QUANTUM Vol. 8 2024.11

Hayashi, M

INFORMATION GEOMETRY Vol. 7 ( 2 ) page： 371 - 440 2024.11

Language：English Publishing type：Research paper (scientific journal) Publisher：Information Geometry

The recent paper (IEEE Trans. IT 69, 1680) proposed an analytical calculation method for the channel capacity without iteration. However, it has restrictions for its application. Also, it does not explain why the channel capacity can be solved analytically in this special case. To expand the applicability of this method, we recall the reverse em-problem, which was proposed by Toyota (Information Geometry, 3, 1355 (2020)) as the repetition of the inverse map of the em iteration to calculate the channel capacity, which is given as the maximum of the mutual information. However, it left several open problems. We formulate the reverse em-problem based on Bregman divergence, and solve these open problems. Using these results, we convert the reverse em-problem into em-problems, and derive a non-iterative formula for the reverse em-problem, which can be considered as a generalization of the above analytical calculation method. Additionally, this derivation explains the information geometrical structure of this special case.

DOI： 10.1007/s41884-024-00147-y

Generalized quantum Arimoto-Blahut algorithm and its application to quantum information bottleneck Reviewed Open Access

Hayashi, M; Liu, G

QUANTUM SCIENCE AND TECHNOLOGY Vol. 9 ( 4 ) 2024.10

Language：English Publishing type：Research paper (scientific journal) Publisher：Quantum Science and Technology

Quantum information bottleneck was proposed by Grimsmo and Still (2016 Phys. Rev. A 94 012338) as a promising method for quantum supervised machine learning. To study this method, we generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al (2021 IEEE Trans. Inf. Theory 67 946) to a function defined over a set of density matrices with linear constraints so that our algorithm can be applied to optimizations of quantum operations. This algorithm has wider applicability, and we apply our algorithm to the quantum information bottleneck with three quantum systems. We numerically compare our obtained algorithm with the existing algorithm by Grimsmo and Still. Our numerical analysis shows that our algorithm is better than their algorithm.

DOI： 10.1088/2058-9565/ad6eb1

Measurement-device-independent detection of beyond-quantum state Reviewed Open Access

Yu, BC; Hayashi, M

NEW JOURNAL OF PHYSICS Vol. 26 ( 10 ) 2024.10

Language：English Publishing type：Research paper (scientific journal) Publisher：New Journal of Physics

In quantum theory, a quantum state on a composite system of two parties realizes a non-negative probability with any measurement element with a tensor product form. However, there also exist non-quantum states which satisfy the above condition. Such states are called beyond-quantum states, and cannot be detected by standard Bell tests. To distinguish a beyond-quantum state from quantum states, we propose a measurement-device-independent (MDI) test for beyond-quantum state detection, which is composed of quantum input states on respective parties and quantum measurements across the input system and the target system on respective parties. The performance of our protocol is independent of the forms of the tested states and the measurement operators, which provides an advantage in practical scenarios. We also discuss the importance of tomographic completeness of the input sets to the detection.

DOI： 10.1088/1367-2630/ad787c

Iterative minimization algorithm on a mixture family Reviewed

Hayashi, M

INFORMATION GEOMETRY 2024.8

Language：English Publishing type：Research paper (scientific journal) Publisher：Information Geometry

Iterative minimization algorithms appear in various areas including machine learning, neural networks, and information theory. The em algorithm is one of the famous iterative minimization algorithms in the area of machine learning, and the Arimoto–Blahut algorithm is a typical iterative algorithm in the area of information theory. However, these two topics had been separately studied for a long time. In this paper, we generalize an algorithm that was recently proposed in the context of the Arimoto–Blahut algorithm. Then, we show various convergence theorems, one of which covers the case when each iterative step is done approximately. Also, we apply this algorithm to the target problem of the em algorithm, and propose its improvement. In addition, we apply it to other various problems in information theory.

DOI： 10.1007/s41884-024-00140-5

Alexander S. Holevo's researches in quantum information theory in 20th century Reviewed Open Access

Hayashi, M

INTERNATIONAL JOURNAL OF QUANTUM INFORMATION Vol. 22 ( 05 ) 2024.8

Language：English Publishing type：Research paper (scientific journal) Publisher：International Journal of Quantum Information

This paper reviews Holevo's contributions to quantum information theory during the 20 century. At that time, he mainly studied three topics, classical-quantum channel coding, quantum estimation with Craméro-Rao approach and quantum estimation with the group covariant approach. This paper addresses these three topics.

DOI： 10.1142/S0219749924400069

Detecting beyond-quantum nonlocality using standard local quantum observables Reviewed

Arai, H; Yu, BC; Hayashi, M

PHYSICAL REVIEW A Vol. 110 ( 1 ) 2024.7

Language：English Publishing type：Research paper (scientific journal) Publisher：Physical Review A

We study the detection of beyond-quantum nonlocal states that can exist in a theoretical model whose local systems are standard quantum theory in the framework of general probabilistic theories (GPTs). We find that device-dependent detections are possible for beyond-quantum nonlocal states in GPTs even though device-independent detections are not valid. We give a device-dependent detection based on local observables to distinguish any beyond-quantum nonlocal state from all standard quantum states. In particular, we give a way to detect any beyond-quantum nonlocal state of the two-qubit system by observing only spin observables on local systems. Our results will help in the experimental detection of beyond-quantum nonlocality or justification of standard quantum theory.

DOI： 10.1103/PhysRevA.110.L010201

<i>q</i>-Racah probability distribution Reviewed

Hayashi, M; Hora, A; Yanagida, S

RAMANUJAN JOURNAL Vol. 64 ( 3 ) page： 963 - 990 2024.7

Language：English Publishing type：Research paper (scientific journal) Publisher：Ramanujan Journal

We introduce a certain discrete probability distribution Pn,m,k,l;q having non-negative integer parameters n, m, k, l and quantum parameter q which arises from a zonal spherical function of the Grassmannian over the finite field Fq with a distinguished spherical vector. Using representation theoretic arguments and hypergeometric summation technique, we derive the presentation of the probability mass function by a single q-Racah polynomial, and also the presentation of the cumulative distribution function in terms of a terminating 4ϕ3-hypergeometric series.

DOI： 10.1007/s11139-024-00859-w

Non-Adaptive Coding for Two-Way Wiretap Channel With or Without Cost Constraints Reviewed Open Access

Hayashi, M; Chen, YL

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 70 ( 7 ) page： 4611 - 4633 2024.7

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Information Theory

This paper studies the secrecy results for the two-way wiretap channel (TW-WC) with an external eavesdropper under a strong secrecy metric. Employing non-adaptive coding, we analyze the information leakage and the decoding error probability, and derive inner bounds on the secrecy capacity regions for the TW-WC under strong joint and individual secrecy constraints. For the TW-WC without cost constraint, both the secrecy and error exponents could be characterized by the conditional Rényi mutual information in a concise and compact form. And, some special cases secrecy capacity region and sum-rate capacity results are established, demonstrating that adaption is useless in some cases or the maximum sum-rate that could be achieved by non-adaptive coding. For the TW-WC with cost constraint, we consider the peak cost constraint and extend our secrecy results by using the constant composition codes. Accordingly, we characterize both the secrecy and error exponents by a modification of Rényi mutual information, which yields inner bounds on the secrecy capacity regions for the general discrete memoryless TW-WC with cost constraint. Our method works even when a pre-noisy processing is employed based on a conditional distribution in the encoder and can be easily extended to other multi-user communication scenarios.

DOI： 10.1109/TIT.2023.3343362

When quantum memory is useful for dense coding Reviewed

Takagi, R; Hayashi, M

LETTERS IN MATHEMATICAL PHYSICS Vol. 114 ( 3 ) 2024.6

Language：English Publishing type：Research paper (scientific journal) Publisher：Letters in Mathematical Physics

We discuss dense coding with n copies of a specific preshared state between the sender and the receiver when the encoding operation is limited to the application of group representation. Typically, to act on multiple local copies of these preshared states, the receiver needs quantum memory, because in general the multiple copies will be generated sequentially. Depending on available encoding unitary operations, we investigate what preshared state offers an advantage of using quantum memory on the receiver’s side.

DOI： 10.1007/s11005-024-01831-x

Derivation of standard quantum theory via state discrimination Reviewed Open Access

Arai, H; Hayashi, M

NEW JOURNAL OF PHYSICS Vol. 26 ( 5 ) 2024.5

Language：English Publishing type：Research paper (scientific journal) Publisher：New Journal of Physics

It is a key issue to characterize the model of standard quantum theory out of general models by an operational condition. The framework of general probabilistic theories (GPTs) is a new information theoretical approach to single out standard quantum theory. It is known that traditional properties, for example, Bell-CHSH inequality, are not sufficient to single out standard quantum theory among possible models in GPTs. As a more precise property, we focus on the bound of the performance for an information task called state discrimination in general models. We give an equivalent condition for outperforming the minimum discrimination error probability under the standard quantum theory given by the trace norm. Besides, by applying the equivalent condition, we characterize standard quantum theory out of general models in GPTs by the bound of the performance for state discrimination.

DOI： 10.1088/1367-2630/ad4d18

Two-Server Oblivious Transfer for Quantum Messages Reviewed International coauthorship Open Access

Hayashi, M; Song, SH

ADVANCED QUANTUM TECHNOLOGIES Vol. 7 ( 4 ) 2024.4

Language：English Publishing type：Research paper (scientific journal) Publisher：Advanced Quantum Technologies

Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over a quantum network. It is an essential building block for secure multiparty computation. It is known that one-server oblivious transfer is impossible. When the task is the transmission of classical messages, protocols for two-server oblivious transfer exist, i.e., existing protocols work under the assumption that two servers do not communicate with each other. However, when the task is the transmission of a quantum state, no existing method works even under the above two-server assumption. Two-server oblivious transfer protocols for quantum messages are proposed for the first time.

DOI： 10.1002/qute.202300184

Equivocations, Exponents, and Second-Order Coding Rates Under Various Renyi Information Measures ( vol 63, pg 975, 2016) Reviewed

Hayashi, M; Tan, VYF

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 70 ( 4 ) page： 3046 - 3048 2024.4

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Information Theory

There exists a gap for the proofs of the converse parts of (49) and (50) in Theorem 1 and (74) of Theorem 3. These converse parts use Lemma 4, whose proofs contain a gap. We fix these errors when the rate is larger than the critical rate. A special case of (50) does not coincide the recent result (Li and Yao, 2022, arXiv:2209.00554v1) when the rate is smaller than the critical rate.

DOI： 10.1109/TIT.2024.3355506

Covert Communication With Gaussian Noise: From Random Access Channel to Point-to-Point Channel Reviewed Open Access

Hayashi, M; Vázquez-Castro, A

IEEE TRANSACTIONS ON COMMUNICATIONS Vol. 72 ( 3 ) page： 1516 - 1531 2024.3

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Communications

We propose a covert communication protocol for the spread-spectrum multiple random access with additive white Gaussian noise (AWGN) channel. No existing paper has studied covert communication for the random access channel. Our protocol assumes binary discrete phase-shift keying (BPSK) modulation, and it works well under imperfect channel state information (I-CSI) for both the legitimate and adversary receivers, which is a realistic assumption in the low power regime. Also, our method assumes that the legitimate users share secret variables in a similar way as the preceding studies. Although several studies investigated the covert communication for the point-to-point communication, no existing paper considers the covert communication under the above uncertainty assumption even for point-to-point communication. Our protocol under the above uncertainty assumption allows O(n) legitimate senders and O(n/n) active legitimate senders. Furthermore, our protocol can be converted to a protocol for point-to-point communication that works under the above uncertainty assumption.

DOI： 10.1109/TCOMM.2023.3332861

Universal Adaptive Construction of Verifiable Secret Sharing and Its Application to Verifiable Secure Distributed Data Storage Reviewed International coauthorship

Hayashi, M; Koshiba, T

IEEE-ACM TRANSACTIONS ON NETWORKING Vol. 32 ( 1 ) page： 253 - 267 2024.2

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE/ACM Transactions on Networking

Secret sharing is a useful method for secure distributed data storage. Such a distributed data storage can avoid the information leakage under an attack to a limited number of distributed servers. While such distributed servers send their shares to an end user according to the request, there is a risk that malicious distributed servers send incorrect shares. To detect or identify such malicious servers, we need verifiable secure distributed data storage, which can be constructed from verifiable secret sharing. However, many of previous protocols for verifiable secret sharing are constructed in a specific form. This paper proposes an adaptive construction of verifiable secret sharing, which uses an existing secret sharing protocol as a subprotocol. Also, our method can be applied to any existing secret sharing protocol. This type construction realizes an economical construction.

DOI： 10.1109/TNET.2023.3283577

Asymmetry activation and its relation to coherence under permutation operation Reviewed Open Access

Hayashi M.

Quantum Vol. 8 2024

Language：English Publishing type：Research paper (scientific journal) Publisher：Quantum

A Dicke state and its decohered state are invariant for permutation. However, when another qubits state to each of them is attached, the whole state is not invariant for permutation, and has a certain asymmetry for permutation. The amount of asymmetry can be measured by the number of distinguishable states under the group action or the mutual information. Generally, the amount of asymmetry of the whole state is larger than the amount of asymmetry of the added state. That is, the asymmetry activation happens in this case. This paper investigates the amount of the asymmetry activation under Dicke states. To address the asymmetry activation asymptotically, we introduce a new type of central limit theorem by using several formulas on hypergeometric functions. We reveal that the amounts of the asymmetry and the asymmetry activation with a Dicke state have a strictly larger order than those with the decohered state in a specific type of the limit.

DOI： 10.22331/q-2024-11-07-1517

Non-Iterative Algorithm for Channel Capacity Reviewed

Hayashi M.

2024 IEEE Information Theory Workshop, ITW 2024 page： 651 - 656 2024

Language：English Publishing type：Research paper (scientific journal) Publisher：2024 IEEE Information Theory Workshop, ITW 2024

Generalizing the algorithm by (IEEE Trans. IT 69, 1681), we propose a non-iterative algorithm to calculate the channel capacity. Unlike the preceding method, which is limited to a specific class of channels, our method is applicable to all channels. Leveraging the information geometrical structure, our approach avoids any iteration steps.

DOI： 10.1109/ITW61385.2024.10806936

Robust and efficient verification of graph states in blind measurement-based quantum computation Reviewed International coauthorship Open Access

Li, ZH; Zhu, HJ; Hayashi, M

NPJ QUANTUM INFORMATION Vol. 9 ( 1 ) 2023.11

Language：English Publishing type：Research paper (scientific journal) Publisher：npj Quantum Information

Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. Measurement-based quantum computation (MBQC) is a promising approach for realizing BQC. To obtain reliable results in blind MBQC, it is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. However, previous verification protocols for this task are too resource-consuming or noise-susceptible to be applied in practice. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension in the adversarial scenario, which leads to a robust and efficient protocol for verifying the resource state in blind MBQC. Our protocol requires only local Pauli measurements and is thus easy to realize with current technologies. Nevertheless, it can achieve optimal scaling behaviors with respect to the system size and the target precision as quantified by the infidelity and significance level, which has never been achieved before. Notably, our protocol can exponentially enhance the scaling behavior with the significance level.

DOI： 10.1038/s41534-023-00783-9

Comments on 'Analytical Algorithm for Capacities of Classical and Classical-Quantum Channels' Reviewed

Hayashi M.

IEEE Transactions on Information Theory Vol. 69 ( 11 ) 2023.11

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Information Theory

After completing the review process of the above article, the author found the reference Muroga (1953), which has already derived an analytical calculation method for the channel capacity under a certain condition. This comment explains the relation between Muroga's article and this article.

DOI： 10.1109/TIT.2023.3299885

Unified Approach to Secret Sharing and Symmetric Private Information Retrieval With Colluding Servers in Quantum Systems Reviewed Open Access

Hayashi, M; Song, S

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 69 ( 10 ) page： 6537 - 6563 2023.10

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Information Theory

This paper unifiedly addresses two kinds of key quantum secure tasks, i.e., quantum versions of secret sharing (SS) and symmetric private information retrieval (SPIR) by using multi-target monotone span program (MMSP), which characterizes the classical linear protocols of SS and SPIR. SS has two quantum extensions; One is the classical-quantum (CQ) setting, in which the secret to be sent is classical information and the shares are quantum systems. The other is the quantum-quantum (QQ) setting, in which the secret to be sent is a quantum state and the shares are quantum systems. The relation between these quantum protocols and MMSP has not been studied sufficiently. We newly introduce the third setting, i.e., the entanglement-assisted (EA) setting, which is defined by modifying the CQ setting with allowing prior entanglement between the dealer and the end-user who recovers the secret by collecting the shares. Showing that the linear version of SS with the EA setting is directly linked to MMSP, we characterize linear quantum versions of SS with the CQ ad QQ settings via MMSP. Further, we introduce the EA setting of SPIR, which is shown to link to MMSP. In addition, we discuss the quantum version of maximum distance separable codes.

DOI： 10.1109/TIT.2023.3282940

Commitment Capacity of Classical-Quantum Channels Reviewed Open Access

Hayashi, M; Warsi, NA

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 69 ( 8 ) page： 5083 - 5099 2023.8

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Information Theory

We study commitment scheme for classical-quantum channels. To accomplish this we define various notions of commitment capacity for these channels and prove matching upper and lower bound on it in terms of the conditional entropy. Our achievability (lower bound) proof is quantum generalisation of the work of one of the authors (arXiv:2103.11548) which studied the problem of secure list decoding and its application to bit-string commitment. The techniques we use in the proof of converse (upper bound) is similar in spirit to the techniques introduced by Winter, Nascimento and Imai (Cryptography and Coding 2003) to prove upper bound on the commitment capacity of classical channels. However, generalisation of this technique to the quantum case is not so straightforward and requires some new constructions, which can be of independent interest.

DOI： 10.1109/TIT.2023.3268321

Bregman Divergence Based Em Algorithm and its Application to Classical and Quantum Rate Distortion Theory Reviewed Open Access

Hayashi, M

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 69 ( 6 ) page： 3460 - 3492 2023.6

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Information Theory

We formulate em algorithm in the framework of Bregman divergence, which is a general problem setting of information geometry. That is, we address the minimization problem of the Bregman divergence between an exponential subfamily and a mixture subfamily in a Bregman divergence system. Then, we show the convergence and its speed under several conditions. We apply this algorithm to rate distortion and its variants including the quantum setting, and show the usefulness of our general algorithm. In fact, existing applications of Arimoto-Blahut algorithm to rate distortion theory make the optimization of the weighted sum of the mutual information and the cost function by using the Lagrange multiplier. However, in rate distortion theory, it is needed to minimize the mutual information under the constant constraint for the cost function. Our algorithm directly solves this minimization. In addition, we have numerically checked the convergence speed of our algorithm in the classical case of rate distortion problem.

DOI： 10.1109/TIT.2023.3239955

Analytical Algorithm for Capacities of Classical and Classical-Quantum Channels Reviewed Open Access

Hayashi, M

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 69 ( 3 ) page： 1381 - 1393 2023.3

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Information Theory

We derive an analytical algorithm for the channel capacity of a classical channel without any iteration, while its existing algorithms require iterations and the number of iterations depends on the required precision level. Hence, our algorithm is its first analytical algorithm for this task without any iteration, while this algorithm needs several conditions for the channel. We apply the obtained algorithm to examples, and see how the obtained algorithm works in these examples. Then, we extend it to the channel capacity of a classical-quantum (cq-) channel. Many existing studies proposed algorithms for a cq-channel and all of them require iterations. Our extended analytical algorithm has also no iteration, and outputs the exactly optimum value.

DOI： 10.1109/TIT.2022.3215178

Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification Reviewed Open Access

Li, K; Yao, YS; Hayashi, M

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 69 ( 3 ) page： 1680 - 1694 2023.3

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Information Theory

The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. In this paper, we derive the exact exponent for the asymptotic decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance. We then apply this result to the problem of privacy amplification against quantum side information, and we obtain an upper bound for the exponent of the asymptotic decreasing of the insecurity, measured using either purified distance or relative entropy. Our upper bound complements the earlier lower bound established by Hayashi, and the two bounds match when the rate of randomness extraction is above a critical value. Thus, for the case of high rate, we have determined the exact security exponent. Following this, we give examples and show that in the low-rate case, neither the upper bound nor the lower bound is tight in general. This exhibits a picture similar to that of the error exponent in channel coding. Lastly, we investigate the asymptotics of equivocation and its exponent under the security measure using the sandwiched Rényi divergence of order s (1,2] , which has not been addressed previously in the quantum setting.

DOI： 10.1109/TIT.2022.3217671

Efficient algorithms for quantum information bottleneck Reviewed International coauthorship Open Access

Hayashi, M; Yang, YX

QUANTUM Vol. 7 2023.2

Language：English Publishing type：Research paper (scientific journal) Publisher：Quantum

The ability to extract relevant information is critical to learning. An ingenious approach as such is the information bottleneck, an optimisation problem whose solution corresponds to a faithful and memory-efficient representation of relevant information from a large system. The advent of the age of quantum computing calls for efficient methods that work on information regarding quantum systems. Here we address this by proposing a new and general algorithm for the quantum generalisation of information bottleneck. Our algorithm excels in the speed and the definiteness of convergence compared with prior results. It also works for a much broader range of problems, including the quantum extension of deterministic information bottleneck, an important variant of the original information bottleneck problem. Notably, we discover that a quantum system can achieve strictly better performance than a classical system of the same size regarding quantum information bottleneck, providing new vision on justifying the advantage of quantum machine learning.

DOI： 10.22331/q-2023-03-02-936

Pseudo standard entanglement structure cannot be distinguished from standard entanglement structure Reviewed Open Access

Arai, H; Hayashi, M

NEW JOURNAL OF PHYSICS Vol. 25 ( 2 ) 2023.2

Language：English Publishing type：Research paper (scientific journal) Publisher：New Journal of Physics

An experimental verification of the maximally entangled state ensures that the constructed state is close to the maximally entangled state, but it does not guarantee that the state is exactly the same as the maximally entangled state. Further, the entanglement structure is not uniquely determined in general probabilistic theories even if we impose that the local subsystems are fully equal to quantum systems. Therefore, the existence of the maximally entangled state depends on whether the standard entanglement structure (SES) is valid. To examine this issue, we introduce pseudo SES as a structure of quantum composite system under natural assumptions based on the existence of projective measurements and the existence of approximations of all maximally entangled standard states. Surprisingly, there exist infinitely many pseudo SESs different from the SES. In our setting, any maximally entangled state can be arbitrarily approximated by an entangled state that belongs to our obtained pseudo standard entanglement structure. That is, experimental verification does not exclude the possibility of our obtained pseudo standard entanglement structure that is different from the standard entanglement structure. On the other hand, such pseudo structures never possess global unitary symmetry, i.e. global unitary symmetry is essential condition for the SES.

DOI： 10.1088/1367-2630/acb565

Tight Cramér-Rao type bounds for multiparameter quantum metrology through conic programming Reviewed Open Access

Hayashi M., Ouyang Y.

Quantum Vol. 7 2023

Language：English Publishing type：Research paper (scientific journal) Publisher：Quantum

In the quest to unlock the maximum potential of quantum sensors, it is of paramount importance to have practical measurement strategies that can estimate incompatible parameters with best precisions possible. However, it is still not known how to find practical measurements with optimal precisions, even for uncorrelated measurements over probe states. Here, we give a concrete way to find uncorrelated measurement strategies with optimal precisions. We solve this fundamental problem by introducing a framework of conic programming that unifies the theory of precision bounds for multiparameter estimates for uncorrelated and correlated measurement strategies under a common umbrella. Namely, we give precision bounds that arise from linear programs on various cones defined on a tensor product space of matrices, including a particular cone of separable matrices. Subsequently, our theory allows us to develop an efficient algorithm that calculates both upper and lower bounds for the ultimate precision bound for uncorrelated measurement strategies, where these bounds can be tight. In particular, the uncorrelated measurement strategy that arises from our theory saturates the upper bound to the ultimate precision bound. Also, we show numerically that there is a strict gap between the previous efficiently computable bounds and the ultimate precision bound.

DOI： 10.22331/Q-2023-08-29-1094

Dense Coding with Locality Restriction on Decoders: Quantum Encoders versus Superquantum Encoders Reviewed

Hayashi, M; Wang, K

PRX QUANTUM Vol. 3 ( 3 ) 2022.9

Language：English Publishing type：Research paper (scientific journal) Publisher：PRX Quantum

We investigate practical dense coding by imposing locality restrictions on decoders and symmetry restrictions on encoders within the resource theory of asymmetry framework. In this task, the sender Alice and the helper Fred preshare an entangled state. Alice encodes a classical message into the quantum state using a symmetric preserving encoder and sends the encoded state to Bob through a noiseless quantum channel. The receiver Bob and helper Fred are limited to performing quantum measurements satisfying certain locality restrictions to decode the classical message. We are interested in the ultimate dense coding capacity under these constraints. Our contributions are summarized as follows. First, we derive both one-shot and asymptotic optimal achievable transmission rates of the dense coding task under different encoder and decoder combinations. Surprisingly, our results reveal that the transmission rate cannot be improved even when the decoder is relaxed from one-way local operations and classical communication (LOCC) to two-way LOCC, separable measurements, and partial transpose positive measurements of the bipartite system. Second, depending on the class of allowed decoders with certain locality restrictions, we relax the class of encoding operations to superquantum encoders in the general probability theory framework and derive dense coding transmission rates under this setting. For example, when the decoder is fixed to a separable measurement, theoretically, a positive operation is allowed as an encoding operation. Remarkably, even under this superquantum relaxation, the transmission rate still cannot be lifted. This fact highlights the universal validity of our analysis on practical dense coding beyond quantum theory.

DOI： 10.1103/PRXQuantum.3.030346

Graph-Theoretic Approach for Self-Testing in Bell Scenarios Reviewed Open Access

Bharti, K; Ray, M; Xu, ZP; Hayashi, M; Kwek, LC; Cabello, A

PRX QUANTUM Vol. 3 ( 3 ) 2022.9

Language：English Publishing type：Research paper (scientific journal) Publisher：PRX Quantum

Self-testing is a technology to certify states and measurements using only the statistics of the experiment. Self-testing is possible if some extremal points in the set BQ of quantum correlations for a Bell experiment are achieved, up to isometries, with specific states and measurements. However, BQ is difficult to characterize, so it is also difficult to prove whether or not a given matrix of quantum correlations allows for self-testing. Here, we show how some tools from graph theory can help to address this problem. We observe that BQ is strictly contained in an easy-to-characterize set associated with a graph, Θ(G). Therefore, whenever the optimum over BQ and the optimum over Θ(G) coincide, self-testing can be demonstrated by simply proving self-testability with Θ(G). Interestingly, these maxima coincide for the quantum correlations that maximally violate many families of Bell-like inequalities. Therefore, we can apply this approach to prove the self-testability of many quantum correlations, including some that are not previously known to allow for self-testing. In addition, this approach connects self-testing to some open problems in discrete mathematics. We use this connection to prove a conjecture [M. Araújo et al., Phys. Rev. A, 88, 022118 (2013)] about the closed-form expression of the Lovász theta number for a family of graphs called the Möbius ladders. Although there are a few remaining issues (e.g., in some cases, the proof requires the assumption that measurements are of rank 1), this approach provides an alternative method to self-testing and draws interesting connections between quantum mechanics and discrete mathematics.

DOI： 10.1103/PRXQuantum.3.030344

Quantum verifiable protocol for secure modulo zero-sum randomness Reviewed

Hayashi, M; Koshiba, T

QUANTUM INFORMATION PROCESSING Vol. 21 ( 8 ) 2022.8

Language：English Publishing type：Research paper (scientific journal) Publisher：Quantum Information Processing

We propose a new cryptographic resource, secure modulo zero-sum randomness, as a resource to implement a task of secure modulo summation, and its quantum protocol. Secure modulo summation is the calculation of modulo summation Y1+ ⋯ + Ym when m players have their individual variables Y1, … , Ym with keeping the secrecy of the individual variables. Secure modulo zero-sum randomness is a set of m variables X1, … , Xm held by m players that satisfy the zero sum condition X1+ ⋯ + Xm= 0 with a certain security condition. This paper explains the relation between these two concepts and proposes a quantum verifiable protocol for secure modulo summation. The advantage for quantum protocol is the verifiability based on self-testing, which does not need to trust measurement devices and can be realized by using a statistical concept, significance level, while any classical method needs to trust several components of the protocol. Then, we propose various cryptographic applications for secure modulo zero-sum randomness. We also compare our quantum verifiable protocol with the conventional method for secure modulo summation.

DOI： 10.1007/s11128-022-03639-x

Quantum causal unravelling Reviewed Open Access

Bai, G; Wu, YD; Zhu, Y; Hayashi, M; Chiribella, G

NPJ QUANTUM INFORMATION Vol. 8 ( 1 ) 2022.6

Language：English Publishing type：Research paper (scientific journal) Publisher：npj Quantum Information

Complex processes often arise from sequences of simpler interactions involving a few particles at a time. These interactions, however, may not be directly accessible to experiments. Here we develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process, under the assumption that the process has bounded information loss and induces causal dependencies whose strength is above a fixed (but otherwise arbitrary) threshold. Our method is based on a quantum algorithm whose complexity scales polynomially in the total number of input/output systems, in the dimension of the systems involved in each interaction, and in the inverse of the chosen threshold for the strength of the causal dependencies. Under additional assumptions, we also provide a second algorithm that has lower complexity and requires only local state preparation and local measurements. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography. Similarly, they can be used to identify useful communication channels in quantum networks, and to test the internal structure of uncharacterized quantum circuits.

DOI： 10.1038/s41534-022-00578-4

Quantum Secure Direct Communication with Private Dense Coding Using a Reviewed Open Access

Wu, JW; Long, GL; Hayashi, M

PHYSICAL REVIEW APPLIED Vol. 17 ( 6 ) 2022.6

Language：English Publishing type：Research paper (scientific journal) Publisher：Physical Review Applied

We study quantum secure direct communication using a general preshared quantum state and a generalization of dense coding. In this scenario, Alice is allowed to apply a unitary operation on the preshared state to encode her message, and the set of allowed unitaries forms a group. To decode the message, Bob is allowed to apply a measurement across his system and the system he receives. In the worst scenario, we guarantee that Eve obtains no information for the message even when Eve accesses the joint system between the system that she intercepts and her original system of the preshared state. For a practical application, we propose a concrete protocol and derive an upper bound of information leakage in the finite-length setting. We also discuss how to apply our scenario to the case with discrete Weyl-Heisenberg representation when the preshared state is unknown.

DOI： 10.1103/PhysRevApplied.17.064011

Secure list decoding and its application to bit-string commitment Reviewed International coauthorship Open Access

Hayashi M.

IEEE Transactions on Information Theory Vol. 68 ( 6 ) page： 3620 - 3642 2022.6

Global Heisenberg scaling in noisy and practical phase estimation Reviewed Open Access

Hayashi, M; Liu, ZW; Yuan, HD

QUANTUM SCIENCE AND TECHNOLOGY Vol. 7 ( 2 ) 2022.4

Language：English Publishing type：Research paper (scientific journal) Publisher：Quantum Science and Technology

Heisenberg scaling characterizes the ultimate precision of parameter estimation enabled by quantum mechanics, which represents an important quantum advantage of both theoretical and technological interest. Here, we present a comprehensive and rigorous study of the attainability of strong, global notions of Heisenberg scaling (in contrast to the commonly studied local estimation based on e.g. quantum Fisher information) in the fundamental problem of quantum metrology, in noisy environments. As our first contribution, we formally define two useful notions of Heisenberg scaling in global estimation respectively based on the average estimation error and the limiting distribution of estimation error (which we highlight as a practically important figure of merit). A main result of this work is that for the standard phase damping noise, an O(n -1) noise rate is a necessary and sufficient condition for attaining global Heisenberg scaling. We first prove that O(n -1) is an upper bound on the noise rate for Heisenberg scaling to be possible, and then show by constructing a 'robust' estimation procedure that global Heisenberg scaling in both senses can indeed be achieved under Θ(n -1) noise. In addition, we provide a practically more friendly adaptive protocol using only an one-qubit memory, which achieves global Heisenberg scaling in terms of limiting distribution as well under O(n -1) noise.

DOI： 10.1088/2058-9565/ac5d7e

Equivalence of Non-Perfect Secret Sharing and Symmetric Private Information Retrieval With General Access Structure Reviewed International coauthorship International journal Open Access

Song, S; Hayashi, M

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS Vol. 40 ( 3 ) page： 999 - 1012 2022.3

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Journal on Selected Areas in Communications

We study the equivalence between non-perfect secret sharing (NSS) and symmetric private information retrieval (SPIR) with arbitrary response and collusion patterns. NSS and SPIR are defined with an access structure, which corresponds to the authorized/forbidden sets for NSS and the response/collusion patterns for SPIR. We prove the equivalence between NSS and SPIR in the following two senses. 1) Given any SPIR protocol with an access structure, an NSS protocol is constructed with the same access structure and the same rate. 2) Given any linear NSS protocol with an access structure, a linear SPIR protocol is constructed with the same access structure and the same rate. We prove the first relation even if the SPIR protocol has imperfect correctness and secrecy. From the first relation, we derive an upper bound of the SPIR capacity for arbitrary response and collusion patterns. For the special case of \mathsf {n} -server SPIR with \mathsf {r} responsive and \mathsf {t} colluding servers, this upper bound proves that the SPIR capacity is (\mathsf {r}-\mathsf {t})/\mathsf {n}. From the second relation, we prove that a SPIR protocol exists for any response and collusion patterns.

DOI： 10.1109/JSAC.2022.3142375

On the Capacity of Quantum Private Information Retrieval From MDS-Coded and Colluding Servers Reviewed International coauthorship Open Access

Allaix, M; Song, S; Holzbaur, L; Pllaha, T; Hayashi, M; Hollanti, C

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS Vol. 40 ( 3 ) page： 885 - 898 2022.3

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Journal on Selected Areas in Communications

In quantum private information retrieval (QPIR), a user retrieves a classical file from multiple servers by downloading quantum systems without revealing the identity of the file. The QPIR capacity is the maximal achievable ratio of the retrieved file size to the total download size. In this paper, the capacity of QPIR from MDS-coded and colluding servers is studied for the first time. Two general classes of QPIR, called stabilizer QPIR and dimension-squared QPIR induced from classical strongly linear PIR are defined, and the related QPIR capacities are derived. For the non-colluding case, the general QPIR capacity is derived when the number of files goes to infinity. A general statement on the converse bound for QPIR with coded and colluding servers is derived showing that the capacities of stabilizer QPIR and dimension-squared QPIR induced from any class of PIR are upper bounded by twice the classical capacity of the respective PIR class. The proposed capacity-achieving scheme combines the star-product scheme by Freij-Hollanti et al. and the stabilizer QPIR scheme by Song et al. by employing (weakly) self-dual Reed-Solomon codes.

DOI： 10.1109/JSAC.2022.3142363

Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding Reviewed

Hayashi, M; Cai, N

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 68 ( 3 ) page： 1822 - 1850 2022.3

Usefulness of adaptive strategies in asymptotic quantum channel discrimination Reviewed International coauthorship Open Access

Physical Review A Vol. 105 ( 2 ) 2022.2

Information geometry approach to parameter estimation in hidden Markov model Reviewed International coauthorship

Hayashi M.

Bernoulli Vol. 28 ( 1 ) page： 307 - 342 2022.2

Secure Physical Layer Network Coding versus Secure Network Coding. Reviewed International coauthorship Open Access

Hayashi M

Entropy (Basel, Switzerland) Vol. 24 ( 1 ) 2022.1

Quantum-Inspired Secure Wireless Communication Protocol Under Spatial and Local Gaussian Noise Assumptions Reviewed Open Access

Hayashi, M

IEEE ACCESS Vol. 10 page： 29040 - 29068 2022

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Access

Inspired by quantum key distribution, we consider wireless communication between Alice and Bob when the noise generated in the intermediate space between Alice and Bob is controlled by Eve. Our model divides the channel noise into two parts, the noise generated during the transmission and the noise generated in the detector. Eve is allowed to control the former, but is not allowed to do the latter. While the latter is assumed to be a Gaussian random variable, the former is not assumed to be a Gaussian random variable. In this situation, using backward reconciliation and random sampling, we propose a protocol to generate secure keys between Alice and Bob under the assumption that Eve's detector has a Gaussian noise and Eve is not so close to Alice's transmitting device. In our protocol, the security criteria are quantitatively guaranteed even with finite block-length code based on the evaluation of error of the estimation of the channel.

DOI： 10.1109/ACCESS.2022.3159331

Analytical calculation formulas for capacities of classical and classical-quantum channels Reviewed Open Access

Hayashi M.

IEEE International Symposium on Information Theory - Proceedings Vol. 2022-June page： 91 - 96 2022

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE International Symposium on Information Theory - Proceedings

We derive an analytical calculation formula for the channel capacity of a classical channel without any iteration while its existing algorithms require iterations and the number of iteration depends on the required precision level. Hence, our formula is its first analytical formula without any iteration. We apply the obtained formula to examples and see how the obtained formula works in these examples.

DOI： 10.1109/ISIT50566.2022.9834600

Exponents in smoothing the max-relative entropy and of randomness extraction against quantum side information Reviewed

Li K., Yao Y., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings Vol. 2022-June page： 1862 - 1867 2022

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE International Symposium on Information Theory - Proceedings

This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award.The smooth max-relative entropy is a basic tool in quantum information theory and cryptography. In this paper, we derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy. We then apply this result to the problem of privacy amplification against quantum side information and obtain an upper bound for the exponent of the decreasing of the insecurity, measured using either purified distance or relative entropy. Our upper bound complements the earlier lower bound established by Hayashi, and the two bounds match when the rate of randomness extraction is above a critical value. Thus, for the case of high rate, we have determined the exact security exponent. Following this, we give examples and show that in the low-rate case, neither the upper bound nor the lower bound is tight in general.Lastly, we investigate the asymptotics of equivocation and its exponent under the security measure using the sandwiched Rényi divergence of order between 1 and 2, which has not been addressed previously in the quantum setting.

DOI： 10.1109/ISIT50566.2022.9834595

Commitment capacity of classical-quantum channels Reviewed Open Access

Hayashi M., Warsi N.A.

IEEE International Symposium on Information Theory - Proceedings Vol. 2022-June page： 1058 - 1063 2022

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE International Symposium on Information Theory - Proceedings

DOI： 10.1109/ISIT50566.2022.9834801

Refined Density Evolution Analysis of LDPC Codes for Successive Interference Cancellation Reviewed International coauthorship

Takabe S., Wadayama T., Hayashi M.

IEEE Global Communications Conference, 2021.12

Erratum: Concise and tight security analysis of the Bennett-Brassard 1984 protocol with finite key lengths (New Journal of Physics (2012) 14 (093014) DOI: 10.1088/1367-2630/14/9/093014) Reviewed International coauthorship

Hayashi M., Tsurumaru T.

New Journal of Physics Vol. 23 ( 12 ) 2021.12

Asymptotic Separation Between Adaptive and Non-adaptive Strategies in Quantum Channel Discrimination Reviewed International coauthorship

Salek M., Hayashi M., Winter A.

IEEE International Symposium on Information Theory - Proceedings 2021.7

Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Reviewed International coauthorship

Hayashi M, Fang K., Wang K.

IEEE International Symposium on Information Theory - Proceedings 2021.7

Universal classical-quantum multiple access channel coding Reviewed International coauthorship

Hayashi M, Cai N.

IEEE International Symposium on Information Theory - Proceedings 2021.7

Equivalence of Non-Perfect Secret Sharing and Symmetric Private Information Retrieval with General Access Structure Reviewed International coauthorship

IEEE International Symposium on Information Theory - Proceedings Vol. 2021-July page： 982 - 987 2021.7

Secure Modulo Sum via Multiple Access Channel Reviewed International coauthorship

Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 2021.7

Asymptotic Separation Between Adaptive and Non-adaptive Strategies in Quantum Channel Discrimination Reviewed International coauthorship

Salek M., Hayashi M., Winter A.

IEEE International Symposium on Information Theory - Proceedings 2021.7

Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Reviewed International coauthorship

Hayashi M, Fang K., Wang K.

IEEE International Symposium on Information Theory - Proceedings 2021.7

Universal classical-quantum multiple access channel coding Reviewed International coauthorship

Hayashi M, Cai N.

IEEE International Symposium on Information Theory - Proceedings 2021.7

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication Reviewed International coauthorship

Kato G., Owari M., Hayashi M.

IEEE Transactions on Information Theory Vol. 67 ( 7 ) page： 4564 - 4586 2021.6

Quantum state estimation with nuisance parameters Reviewed International coauthorship

Vol. 53 ( 45 ) 2020.11

Perfect Discrimination in Approximate Quantum Theory of General Probabilistic Theories. Reviewed International coauthorship

Yoshida Y, Arai H, Hayashi M

Physical review letters Vol. 125 ( 15 ) page： 150402 2020.10

Authorship：Last author,　Corresponding author Language：English Publishing type：Research paper (scientific journal) Publisher：Physical Review Letters

As a modern approach for the foundation of quantum theory, existing studies of general probabilistic theories gave various models of states and measurements that are quite different from quantum theory. In this Letter, to seek a more realistic situation, we investigate models approximately close to quantum theory. We define larger measurement classes that are smoothly connected with the class of POVMs via a parameter, and investigate the performance of perfect discrimination. As a result, we give a sufficient condition of perfect discrimination, which shows a significant improvement beyond the class of POVMs.

DOI： 10.1103/PhysRevLett.125.150402

Communication cost of quantum processes Reviewed International coauthorship

IEEE Journal on Selected Areas in Information Theory Vol. 1 page： 387 - 400 2020.9

Reduction Theorem for Secrecy over Linear Network Code for Active Attacks. Reviewed International coauthorship

Hayashi M, Owari M, Kato G, Cai N

Entropy (Basel, Switzerland) Vol. 22 ( 9 ) 2020.9

Authorship：Lead author,　Last author,　Corresponding author Language：English Publishing type：Research paper (scientific journal) Publisher：Entropy

We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot increase the power of eavesdropping by sequential error injection when the operations in the network are linear operations. We demonstrated the usefulness of this reduction theorem by applying a concrete example of network.

DOI： 10.3390/e22091053

Secure Communication over Fully Quantum Gel'fand-Pinsker Wiretap Channel Reviewed International coauthorship

Anshu A., Hayashi M., Warsi N.A.

IEEE Transactions on Information Theory Vol. 66 ( 9 ) page： 5548 - 5566 2020.9

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Information Theory

In this work we study the problem of secure communication over a fully quantum Gel'fand-Pinsker channel. The best known achievability rate for this channel model in the classical case was proven by Goldfeld, Cuff and Permuter, and here we generalize their result. One key feature of the results obtained in this work is that all the bounds are based on error exponents. We obtain our achievability result via the technique of simultaneous pinching. This in turn allows us to show the existence of a simultaneous decoder. Further, to obtain our encoding technique and to prove the security feature of our coding scheme we prove a bivariate classical-quantum channel resolvability lemma and a conditional classical-quantum channel resolvability lemma. As a byproduct of the achievability result obtained in this work, we also obtain an achievable rate for a fully quantum Gel'fand-Pinsker channel in the absence of Eve. The form of this achievable rate matches with its classical counterpart. The Gel'fand-Pinsker channel model had earlier only been studied for the classical-quantum case and in the case where Alice (the sender) and Bob (the receiver) have shared entanglement between them.

DOI： 10.1109/TIT.2020.3005015

Quantum state transmission over partially corrupted quantum information network Reviewed International coauthorship

Hayashi M., Song S.

Physical Review Research Vol. 2 ( 3 ) 2020.7

Language：English Publishing type：Research paper (scientific journal) Publisher：Physical Review Research

Quantum communication over network is particularly appealing in a similar way to classical network communication, but a partially corrupted quantum network has not been sufficiently studied. We discuss quantum state transmission over a partially corrupted quantum network, in which the sender transmits m0 qudits, i.e., d-level systems, to the receiver via network, but m1 channels are corrupted. As our result, we show that the optimal transmission rate is at least (m0-2m1+1)logd under the following two settings. In the first case, the unitaries on intermediate nodes are arbitrary and the corruptions on the m1 channels are individual. In the second case, the unitaries on intermediate nodes are restricted to Clifford operations and the corruptions on the m1 channels are adaptive, i.e., they are caused by an attack with a quantum memory. Further, our code in the second case realizes the noiseless communication even with the single-shot setting and is constructed dependently only on the network topology and the places of the m1 corrupted channels.

DOI： 10.1103/PhysRevResearch.2.033079

Asymptotic Behavior of Spatial Coupling LDPC Coding for Compute-and-Forward Two-Way Relaying Reviewed International coauthorship

Takabe S., Wadayama T., Hayashi M.

IEEE Transactions on Communications Vol. 68 ( 7 ) page： 4063 - 4072 2020.7

Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Communications

Compute-and-forward (CAF) relaying is an effective way to increase bandwidth efficiency of wireless two-way relay channels. Design of error-correcting codes and their decoding algorithms suitable for CAF relaying schemes remains an important issue to be studied. In this paper, we will analyze an asymptotic behavior of LDPC codes over two-way relay channels based on density evolution (DE). Because of the asymmetric characteristics of the channel, we use the population dynamics DE combined with DE formulas for asymmetric channels to obtain the belief propagation (BP) thresholds. Additionally, we also evaluate the asymptotic performance of spatially coupled LDPC codes for two-way relay channels. The results indicate that the spatially coupled codes yield improvements in the BP threshold compared with corresponding uncoupled codes for two-way relay channels.

DOI： 10.1109/TCOMM.2020.2987891

Capacity of Quantum Private Information Retrieval with Colluding Servers Reviewed International coauthorship

Song S., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings Vol. 2020-June page： 1077 - 1082 2020.6

Authorship：Last author Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE International Symposium on Information Theory - Proceedings

Quantum private information retrieval (QPIR) is a protocol that a user retrieves one of f files from non-communicating n servers by downloading quantum systems without revealing the identity of the target file. As variants of the QPIR with stronger security requirements, the symmetric QPIR is that the files except for the target file are not leaked to the user, and the t-private QPIR is that the identity of the target file is kept secret even if at most t servers may collude to reveal the identity. The QPIR capacity is the maximum ratio of the one file size to the size of downloaded quantum systems, and we prove that the symmetric t-private QPIR capacity is min {1, 2(n - t)/n} for any 1 ≤ t < n. We construct a capacity-achieving QPIR protocol by the stabilizer formalism and prove the optimality of our protocol. The proposed capacity is greater than the classical counterpart.

DOI： 10.1109/ISIT44484.2020.9174005

Erratum: Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes (IEEE Transactions on Information Theory ( 2020) 66:3 (1428–1448) DOI: 10.1109/TIT.2019.2957078) Reviewed International coauthorship

Cai N., Hayashi M.

IEEE Transactions on Information Theory Vol. 66 ( 6 ) 2020.6

Authorship：Last author,　Corresponding author Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Information Theory

In the proof of Theorem 5, we stated that Eq. (47) follows from Eq. (59) of Lemma 4. However, the derivation of Eq. (59) is incorrect, and the inequality used in the derivation of Eq. (47) is not Eq. (59). Eq. (47) follows from another inequality. This correction fixes the error of our derivation of Eq. (47).

DOI： 10.1109/TIT.2020.2979957

Permutation Enhances Classical Communication Assisted by Entangled States Reviewed International coauthorship

Wang K., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings Vol. 2020-June page： 1840 - 1845 2020.6

Authorship：Last author Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE International Symposium on Information Theory - Proceedings

We give a capacity formula for the classical communication over a noisy quantum channel, when local operations and global permutations allowed in the encoding and bipartite states preshared between the sender and the receiver. The two endpoints of this formula are the Holevo capacity (without entanglement assistance) and the entanglement assisted capacity (with unlimited entanglement assistance). What's more, we show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. We prove that the difference between the assisted capacity and the Holevo capacity is upper bounded by the discord of formation of the preshared state. As examples, we derive analytically the classical capacity of various quantum channels of interests. Our result witnesses the power of random permutation in classical communication, whenever entanglement assistance is available.

DOI： 10.1109/ISIT44484.2020.9174125

Classical Mechanism is Optimal in Classical-Quantum Differentially Private Mechanisms Reviewed International coauthorship

Yoshida Y., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings Vol. 2020-June page： 1973 - 1977 2020.6

Authorship：Last author Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE International Symposium on Information Theory - Proceedings

Differential privacy (DP) is an influential privacy measure and has been studied to protect private data. DP has been often studied in classical probability theory, but few researchers studied quantum versions of DP. In this paper, we consider classical-quantum DP mechanisms which (i) convert binary private data to quantum states and (ii) satisfy a quantum version of the DP constraint. The class of classical-quantum DP mechanisms contains classical DP mechanisms. As a main result, we show that some classical DP mechanism optimizes any information quantity satisfying the information processing inequality. Therefore, the performance of classical DP mechanisms attains that of classical-quantum DP mechanisms.

DOI： 10.1109/ISIT44484.2020.9174484

LOCC estimator for pure state model in quantum parameter estimation with nuisance parameters (New Developments in Statistical Model) Reviewed International coauthorship

RIMS Kokyuroku Vol. 2157 page： 104 - 116 2020.6

Capacity of Quantum Private Information Retrieval with Colluding Servers Reviewed International coauthorship

2020.6

Asymptotic properties for Markovian dynamics in quantum theory and general probabilistic theories Reviewed International coauthorship

Yoshida Y., Hayashi M.

Journal of Physics A: Mathematical and Theoretical Vol. 53 ( 21 ) 2020.5

Authorship：Last author Language：English Publishing type：Research paper (scientific journal) Publisher：Journal of Physics A: Mathematical and Theoretical

We address asymptotic decoupling in the context of Markovian quantum dynamics. Asymptotic decoupling is an asymptotic property on a bipartite quantum system, and asserts that any correlation between two quantum systems is broken after a sufficiently long time passes. In this paper, we show that asymptotic decoupling is equivalent to local mixing which asserts the convergence to a unique stationary state on at least one quantum system. If dynamics is asymptotically decoupling, any correlation between two quantum systems is broken exponentially. Also, we give a criterion of mixing that is a system of linear equations. All results in this paper are proved in the framework of general probabilistic theories, but we also summarize them in quantum theory.

DOI： 10.1088/1751-8121/ab8599

Two-Way Physical Layer Security Protocol for Gaussian Channels Reviewed International coauthorship

Hayashi M., Vazquez-Castro Á.

IEEE Transactions on Communications Vol. 68 ( 5 ) page： 3068 - 3078 2020.5

Authorship：Lead author Language：English Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Communications

In this paper we propose a two-way protocol of physical layer security using the method of privacy amplification against eavesdroppers. First we justify our proposed protocol by analyzing the physical layer security provided by the classic wiretap channel model (i.e. one-way protocol). In the Gaussian channels, the classic one-way protocol requires Eve's channel to be degraded w.r.t. Bob's channel. However, this channel degradation condition depends on Eve's location and whether Eve's receiving antenna is more powerful than Bob's. To overcome this limitation, we introduce a two-way protocol inspired in IEEE TIT (1993) that eliminates the channel degradation condition. In the proposed two-way protocol, on a first phase, via Gaussian channel, Bob sends randomness to Alice, which is partially leaked to Eve. Then, on a second phase, Alice transmits information to Bob over a public noiseless channel. We derive the secrecy capacity of the two-way protocol when the channel to Eve is also Gaussian. We show that the capacity of the two-way protocol is always positive. We present numerical values of the capacities illustrating the gains obtained by our proposed protocol. We apply our result to simple yet realistic models of satellite communication channels.

DOI： 10.1109/TCOMM.2020.2973618

Finite-Length Analyses for Source and Channel Coding on Markov Chains. Reviewed International coauthorship

Hayashi M, Watanabe S

Entropy (Basel, Switzerland) Vol. 22 ( 4 ) 2020.4

Authorship：Lead author,　Corresponding author Language：English Publishing type：Research paper (scientific journal) Publisher：Entropy

We derive finite-length bounds for two problems with Markov chains: source coding with side-information where the source and side-information are a joint Markov chain and channel coding for channels with Markovian conditional additive noise. For this purpose, we point out two important aspects of finite-length analysis that must be argued when finite-length bounds are proposed. The first is the asymptotic tightness, and the other is the efficient computability of the bound. Then, we derive finite-length upper and lower bounds for the coding length in both settings such that their computational complexity is low. We argue the first of the above-mentioned aspects by deriving the large deviation bounds, the moderate deviation bounds, and second-order bounds for these two topics and show that these finite-length bounds achieve the asymptotic optimality in these senses. Several kinds of information measures for transition matrices are introduced for the purpose of this discussion.

DOI： 10.3390/e22040460

Application of the Resource Theory of Channels to Communication Scenarios. Reviewed International coauthorship

Takagi R, Wang K, Hayashi M

Physical review letters Vol. 124 ( 12 ) page： 120502 2020.3

Secure network code for adaptive and active attacks with no-randomness in intermediate nodes Reviewed International coauthorship

Cai N., Hayashi M.

IEEE Transactions on Information Theory Vol. 66 ( 3 ) page： 1428 - 1448 2020.3

Secure Quantum Network Code without Classical Communication Reviewed International coauthorship

Song S., Hayashi M.

IEEE Transactions on Information Theory Vol. 66 ( 2 ) page： 1178 - 1192 2020.2

Physical Layer Security Protocol for Poisson Channels for Passive Man-in-the-Middle Attack Reviewed International coauthorship

Hayashi M., Vazquez-Castro, A.

IEEE Transactions on Information Forensics and Security Vol. 15 page： 2295 - 2305 2020

Quantifying Time-Varying Sources in Magnetoencephalography -- A Discrete Approach Reviewed International coauthorship

Vol. 14 page： 1379 - 1408 2020

Efficient Verification of Pure Quantum States in the Adversarial Scenario. Reviewed International coauthorship

Zhu H, Hayashi M

Physical review letters Vol. 123 ( 26 ) page： 260504 2019.12

General framework for verifying pure quantum states in the adversarial scenario Reviewed International coauthorship

Zhu H, Hayashi M

Physical Review A Vol. 100 ( 6 ) 2019.12

Efficient verification of hypergraph states Reviewed International coauthorship

Zhu H, Hayashi M

Physical Review Applied Vol. 12 ( 5 ) 2019.11

Perfect discrimination of non-orthogonal separable pure states on bipartite system in general probabilistic theory Reviewed International coauthorship

Arai H.,Yoshida Y., Hayashi M.

Journal of Physics A: Mathematical and Theoretical Vol. 52 ( 46 ) 2019.10

Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements. Reviewed International coauthorship

Takeuchi Y, Morimae T, Hayashi M

Scientific reports Vol. 9 ( 1 ) page： 13585 2019.9

Second Order Analysis for Joint Source-Channel Coding With General Channel and Markovian Source Reviewed International coauthorship

Yaguchi Ryo, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 65 ( 9 ) page： 5750-5770 2019.9

Optimal verification and fidelity estimation of maximally entangled states Reviewed International coauthorship

Zhu Huangjun, Hayashi Masahito

PHYSICAL REVIEW A Vol. 99 ( 5 ) 2019.5

Attaining the Ultimate Precision Limit in Quantum State Estimation Reviewed International coauthorship

Yang Y.,Chiribella G., Hayashi M.

Communications in Mathematical Physics Vol. 368 ( 1 ) page： 223-293 2019.5

Physical layer security for rf satellite channels in the finite-length regime Reviewed International coauthorship

Vazquez-Castro A., Hayashi M.

IEEE Transactions on Information Forensics and Security Vol. 14 ( 4 ) page： 981-993 2019.4

Correction to 'Quantum stopwatch: how to store time in a quantum memory'. Reviewed International coauthorship

Yang Y, Chiribella G, Hayashi M

Proceedings. Mathematical, physical, and engineering sciences Vol. 475 ( 2223 ) page： 20190052 2019.3

Secure computation-and-forward communication with linear codes Reviewed International coauthorship

Hayashi M. Wadayama T. Vazuez-Castro A.

2018 IEEE Information Theory Workshop, ITW 2018 2019.1

Secure quantum network code without classical communication Reviewed International coauthorship

Song S. Hayashi M

2018 IEEE Information Theory Workshop, ITW 2018 2019.1

Secure physical layer network coding versus secure network coding Invited Reviewed International coauthorship

Hayashi M.

2018 IEEE Information Theory Workshop, ITW 2018 2019.1

Resolving unattainable Cramer-Rao bounds for quantum sensors Reviewed International coauthorship

Hayashi M., Vinjanampathy S., Kwek L.-C.

Journal of Physics B: Atomic, Molecular and Optical Physics Vol. 52 ( 1 ) 2019.1

Universal Channel Coding for General Output Alphabet Reviewed International coauthorship

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 65 ( 1 ) page： 302-321 2019.1

Asymptotically Decoupling and Mixing Properties in Quantum System Reviewed International coauthorship

Yoshida Y., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings Vol. 2018-June page： 261-265 2018.8

Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication Reviewed International coauthorship

Hayashi M., Koshiba T.

IEEE International Symposium on Information Theory - Proceedings Vol. 2018-June page： 2614-2618 2018.8

Secure Communication over Fully Quantum Gel' Fand-Pinsker Wiretap Channel Reviewed International coauthorship

Anshu A., Hayashi M., Warsi N.

IEEE International Symposium on Information Theory - Proceedings Vol. 2018-June page： 2679-2683 2018.8

Compression for Qubit Clocks Reviewed International coauthorship

Yang Y., Chiribella G., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings Vol. 2018-June page： 2476-2480 2018.8

Asymptotic and non-asymptotic analysis for a hidden Markovian process with a quantum hidden system Reviewed International coauthorship

Hayashi M., Yoshida Y.

Journal of Physics A: Mathematical and Theoretical Vol. 51 ( 33 ) 2018.7

Quantum network code for multiple-unicast network with quantum invertible linear operations Reviewed International coauthorship

Song S., Hayashi M.

Leibniz International Proceedings in Informatics, LIPIcs Vol. 111 page： 10:1-10:20 2018.7

Compression for Quantum Population Coding Reviewed International coauthorship

Yang Y., Bai G., Chiribella G., Hayashi M.

IEEE Transactions on Information Theory Vol. 64 ( 7 ) page： 4766-4783 2018.7

Second-Order Asymptotics of Conversions of Distributions and Entangled States Based on Rayleigh-Normal Probability Distributions (vol 63, pg 1829, 2017) Reviewed International coauthorship

Kumagai Wataru, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 64 ( 7 ) page： 5455 - 5455 2018.7

Self-guaranteed measurement-based quantum computation Reviewed International coauthorship

Hayashi Masahito, Hajdusek Michal

PHYSICAL REVIEW A Vol. 97 ( 5 ) 2018.5

Analysis of Remaining Uncertainties and Exponents Under Various Conditional Renyi Entropies Reviewed International coauthorship

Tan Vincent Y. F., Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 64 ( 5 ) page： 3734-3755 2018.5

Quantum stopwatch: how to store time in a quantum memory. International coauthorship

Yang Y, Chiribella G, Hayashi M

Proceedings. Mathematical, physical, and engineering sciences Vol. 474 ( 2213 ) page： 20170773 2018.5

Axiomatic and operational connections between the l1 -norm of coherence and negativity Reviewed International coauthorship

Zhu H.

Physical Review A Vol. 97 ( 2 ) 2018.2

Minimum Rates of Approximate Sufficient Statistics Reviewed International coauthorship

Hayashi Masahito, Tan Vincent Y. F.

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 64 ( 2 ) page： 875-888 2018.2

Operational Interpretation of Renyi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions Reviewed International coauthorship

Tomamichel Marco, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 64 ( 2 ) page： 1064-1082 2018.2

Universally Fisher-Symmetric Informationally Complete Measurements Reviewed International coauthorship

Zhu Huangjun, Hayashi Masahito

PHYSICAL REVIEW LETTERS Vol. 120 ( 3 ) page： 030404 2018.1

Secure uniform random-number extraction via incoherent strategies Reviewed International coauthorship

Hayashi Masahito, Zhu Huangjun

PHYSICAL REVIEW A Vol. 97 ( 1 ) 2018.1

Single-shot secure quantum network coding on butterfly network with free public communication Reviewed International coauthorship

Owari M., Kato G., Hayashi M.

Quantum Science and Technology Vol. 3 ( 1 ) 2018.1

Optimal performance of generalized heat engines with finite-size baths of arbitrary multiple conserved quantities beyond independent-and-identical-distribution scaling Reviewed International coauthorship

Ito Kosuke, Hayashi Masahito

PHYSICAL REVIEW E Vol. 97 ( 1-1 ) page： 012129 2018.1

Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels Reviewed International coauthorship

Takabe Satoshi, Ishimatsu Yuta, Wadayama Tadashi, Hayashi Masahito

2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 1021-1025 2018

Verification of hypergraph states Reviewed International coauthorship

Morimae Tomoyuki, Takeuchi Yuki, Hayashi Masahito

PHYSICAL REVIEW A Vol. 96 ( 6 ) 2017.12

Coherence and entanglement measures based on Rnyi relative entropies International coauthorship

Zhu Huangjun, Hayashi Masahito, Chen Lin

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL Vol. 50 ( 47 ) 2017.11

Verifiable fault tolerance in measurement-based quantum computation Reviewed International coauthorship

Fujii Keisuke, Hayashi Masahito

PHYSICAL REVIEW A Vol. 96 ( 3 ) 2017.9

Minimum rates of approximate sufficient statistics Reviewed International coauthorship

Hayashi M., Tan V.

IEEE International Symposium on Information Theory - Proceedings page： 3035-3039 2017.8

Compression for quantum population coding Reviewed International coauthorship

Yang Y., Bai G., Chiribella G., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings page： 1973-1977 2017.8

Secure wireless communication under spatial and local Gaussian noise assumptions Reviewed International coauthorship

Hayashi M.

IEEE International Symposium on Information Theory - Proceedings page： 1698-1702 2017.8

Secrecy and robustness for active attack in secure network coding Reviewed International coauthorship

Hayashi M., Owari M., Kato G., Cai N.

IEEE International Symposium on Information Theory - Proceedings page： 1172-1176 2017.8

Second order analysis for joint source-channel coding with Markovian source Reviewed International coauthorship

Yaguchi R., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings page： 918-922 2017.8

Finite-size effect on optimal efficiency of heat engines Reviewed International coauthorship

Hayashi M., Tajima H.

PHYSICAL REVIEW E Vol. 96 ( 1 ) 2017.7

Tight Asymptotic Bounds on Local Hypothesis Testing Between a Pure Bipartite State and the White Noise State Reviewed International coauthorship

Hayashi Masahito, Owari Masaki

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 63 ( 6 ) page： 4008-4036 2017.6

Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages Reviewed International coauthorship

Matsumoto Ryutaroh, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 63 ( 6 ) page： 3773-3782 2017.6

Discrimination Power of a Quantum Detector Reviewed International coauthorship

Hirche Christoph, Hayashi Masahito, Bagan Emilio, Calsamiglia John

PHYSICAL REVIEW LETTERS Vol. 118 ( 16 ) page： 160502 2017.4

FINITE-LENGTH ANALYSIS ON TAIL PROBABILITY FOR MARKOV CHAIN AND APPLICATION TO SIMPLE HYPOTHESIS TESTING Reviewed International coauthorship

Watanabe Shun, Hayashi Masahito

ANNALS OF APPLIED PROBABILITY Vol. 27 ( 2 ) page： 811-845 2017.4

Random Number Conversion and LOCC Conversion via Restricted Storage Reviewed International coauthorship

Kumagai Wataru, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 63 ( 4 ) page： 2504-2532 2017.4

Measurement-based formulation of quantum heat engines Reviewed International coauthorship

Hayashi Masahito, Tajima Hiroyasu

PHYSICAL REVIEW A Vol. 95 ( 3 ) 2017.3

Second-Order Asymptotics of Conversions of Distributions and Entangled States Based on Rayleigh-Normal Probability Distributions Reviewed International coauthorship

Kumagai Wataru, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 63 ( 3 ) page： 1829-1857 2017.3

Equivocations, Exponents, and Second-Order Coding Rates Under Various Renyi Information Measures Reviewed International coauthorship

Hayashi Masahito, Tan Vincent Y. F.

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 63 ( 2 ) page： 975-1005 2017.2

Mathematical Formulation of Quantum Systems International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 1-24 2017

Limits and Linear Algebra International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 607-625 2017

Finite-block-length analysis in classical and quantum information theory International coauthorship

HAYASHI Masahito

Proceedings of the Japan Academy, Series B Vol. 93 ( 3 ) page： 99 - 124 2017

Language：English Publishing type：Research paper (scientific journal) Publisher：The Japan Academy

<p>Coding technology is used in several information processing tasks. In particular, when noise during transmission disturbs communications, coding technology is employed to protect the information. However, there are two types of coding technology: coding in classical information theory and coding in quantum information theory. Although the physical media used to transmit information ultimately obey quantum mechanics, we need to choose the type of coding depending on the kind of information device, classical or quantum, that is being used. In both branches of information theory, there are many elegant theoretical results under the ideal assumption that an infinitely large system is available. In a realistic situation, we need to account for finite size effects. The present paper reviews finite size effects in classical and quantum information theory with respect to various topics, including applied aspects.</p>

DOI： 10.2183/pjab.93.007

Information-theoretic Physical Layer Security for Satellite Channels Reviewed International coauthorship

Vazquez-Castro Angeles, Hayashi Masahito

2017 IEEE AEROSPACE CONFERENCE page： . 2017

Asymptotic Analysis for Hidden Markovian Process with Quantum Hidden System Reviewed International coauthorship

Hayashi Masahito

2017 IEEE INFORMATION THEORY WORKSHOP (ITW) page： 469-473 2017

Quantum Measurements and State Reduction International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 323-356 2017

Quantum Information Theory Mathematical Foundation Second Edition Prologue International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： XXXV-XLIII 2017

Quantum Information Theory Mathematical Foundation Second Edition Preface to the Japanese Edition International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： XIII-XIV 2017

Quantum Information Theory Mathematical Foundation Second Edition Preface International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： VII-IX 2017

Quantum Information Geometry and Quantum Estimation International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 253-322 2017

Quantum Hypothesis Testing and Discrimination of Quantum States International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 95-153 2017

Postface to Japanese version International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 627-629 2017

State Evolution and Trace-Preserving Completely Positive Maps Reviewed International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 197-251 2017

Source Coding in Quantum Systems International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 569-605 2017

Information Quantities and Parameter Estimation in Classical Systems International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 25-94 2017

Entanglement and Locality Restrictions International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 357-490 2017

Classical-Quantum Channel Coding (Message Transmission) International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 155-195 2017

Analysis of Quantum Communication Protocols International coauthorship

Hayashi Masahito

QUANTUM INFORMATION THEORY: MATHEMATICAL FOUNDATION, 2ND EDITION page： 491-568 2017

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free Public Communication Reviewed International coauthorship

Kato Go, Owari Masaki, Hayashi Masahito

INFORMATION THEORETIC SECURITY, ICITS 2017 Vol. 10681 page： 166-187 2017

Correlation detection and an operational interpretation of the Renyi mutual information International coauthorship

Hayashi Masahito, Tomamichel Marco

JOURNAL OF MATHEMATICAL PHYSICS Vol. 57 ( 10 ) page： 102201 2016.10

Fourier Analytic Approach to Quantum Estimation of Group Action Reviewed International coauthorship

Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS Vol. 347 ( 1 ) page： 3-82 2016.10

Optimal Compression for Identically Prepared Qubit States. Reviewed International coauthorship

Yang Y, Chiribella G, Hayashi M

Physical review letters Vol. 117 ( 9 ) page： 090502 2016.8

INFORMATION GEOMETRY APPROACH TO PARAMETER ESTIMATION IN MARKOV CHAINS Reviewed International coauthorship

Hayashi Masahito, Watanabe Shun

ANNALS OF STATISTICS Vol. 44 ( 4 ) page： 1495-1535 2016.8

Secret Key Agreement: General Capacity and Second-Order Asymptotics Reviewed International coauthorship

Hayashi Masahito, Tyagi Himanshu, Watanabe Shun

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 62 ( 7 ) page： 3796-3810 2016.7

Security Analysis of epsilon-Almost Dual Universal(2) Hash Functions: Smoothing of Min Entropy Versus Smoothing of Renyi Entropy of Order 2 Reviewed International coauthorship

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 62 ( 6 ) page： 3451-3476 2016.6

Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages Reviewed International coauthorship

Hayashi Masahito, Matsumoto Ryutaroh

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 62 ( 5 ) page： 2355-2409 2016.5

Optimal decoy intensity for decoy quantum key distribution Reviewed International coauthorship

Hayashi Masahito

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL Vol. 49 ( 16 ) 2016.4

More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function Reviewed International coauthorship

Hayashi Masahito, Tsurumaru Toyohiro

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 62 ( 4 ) page： 2213-2232 2016.4

Uniform Random Number Generation From Markov Chains: Non-Asymptotic and Asymptotic Analyses Reviewed International coauthorship

Hayashi Masahito, Watanabe Shun

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 62 ( 4 ) page： 1795-1822 2016.4

Universal Steering Criteria. Reviewed International coauthorship

Zhu H, Hayashi M, Chen L

Physical review letters Vol. 116 ( 7 ) page： 070403 2016.2

Role of Quantum Information Theory in Information Theory International coauthorship

HAYASHI Masahito

IEICE ESS Fundamentals Review Vol. 10 ( 1 ) page： 4 - 13 2016

Language：Japanese Publishing type：Research paper (scientific journal) Publisher：The Institute of Electronics, Information and Communication Engineers

There are several interesting results in quantum information theory behind the recent remarkable progress in information theory. This article focuses on the contribution of quantum information theory to information theory, and explains the role of quantum information theory in the progress in information theory, which indicates that the results of quantum information theory are applicable to other research areas.

DOI： 10.1587/essfr.10.1_4

Operational Interpretation of Renyi Conditional Mutual Information via Composite Hypothesis Testing Against Markov Distributions Reviewed International coauthorship

Tomamichel Marco, Hayashi Masahito

2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY page： 585-589 2016

Remaining Uncertainties and Exponents under Renyi Information Measures Reviewed International coauthorship

Hayashi Masahito, Tan Vincent Y. F.

2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY page： 1536-1540 2016

Asymmetric Evaluations of Erasure and Undetected Error Probabilities Reviewed International coauthorship

Hayashi Masahito, Tan Vincent Y. F.

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 61 ( 12 ) page： 6560-6577 2015.12

Local Hypothesis Testing Between a Pure Bipartite State and the White Noise State Reviewed International coauthorship

Owari Masaki, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 61 ( 12 ) page： 6995-7011 2015.12

Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing. Reviewed International coauthorship

Hayashi M, Morimae T

Physical review letters Vol. 115 ( 22 ) page： 220502 2015.11

Asymptotic compatibility between local-operations-and-classical-communication conversion and recovery Reviewed International coauthorship

Ito Kosuke, Kumagai Wataru, Hayashi Masahito

PHYSICAL REVIEW A Vol. 92 ( 5 ) 2015.11

QUANTUM MERLIN-ARTHUR WITH CLIFFORD ARTHUR Reviewed International coauthorship

Morimae Tomoyuki, Hayashi Masahito, Nishimura Harumichi, Fujii Keisuke

QUANTUM INFORMATION & COMPUTATION Vol. 15 ( 15-16 ) page： 1420-1430 2015.11

Error-Control Coding for Physical-Layer Secrecy Reviewed International coauthorship

Bloch Matthieu, Hayashi Masahito, Thangaraj Andrew

PROCEEDINGS OF THE IEEE Vol. 103 ( 10 ) page： 1725-1746 2015.10

Quantum Wiretap Channel With Non-Uniform Random Number and Its Exponent and Equivocation Rate of Leaked Information Reviewed International coauthorship

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 61 ( 10 ) page： 5595-5622 2015.10

Precise Evaluation of Leaked Information with Secure Randomness Extraction in the Presence of Quantum Attacker Reviewed International coauthorship

Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS Vol. 333 ( 1 ) page： 335-350 2015.1

21aAJ-7 Formularization of work extraction as a measurement process Reviewed International coauthorship

Tajima H., Hayashi M.

Meeting Abstracts of the Physical Society of Japan Vol. 70.1 ( 0 ) page： 2811 2015

17aCX-8 Derivation of optimal efficiency of quantum heat engines based on strong large deviation theory Reviewed International coauthorship

Tajima H., Hayashi M.

Meeting Abstracts of the Physical Society of Japan Vol. 70.2 ( 0 ) page： 2648 2015

Correlation Detection and an Operational Interpretation of the Renyi Mutual Information Reviewed International coauthorship

Hayashi Masahito, Tomamichel Marco

2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 1447-1451 2015

Erasure and Undetected Error Probabilities in the Moderate Deviations Regime Reviewed International coauthorship

Hayashi Masahito, Tan Vincent Y. F.

2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 1821-1825 2015

Equivocations and Exponents under Various Renyi Information Measures Reviewed International coauthorship

Hayashi Masahito, Tan Vincent Y. F.

2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 281-285 2015

More Efficient Privacy Amplification with Less Random Seeds Reviewed International coauthorship

Hayashi Masahito, Tsurumaru Toyohiro

2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 1786-1790 2015

Tight asymptotic bounds on local hypothesis testing between a pure bipartite state and the white noise state Reviewed International coauthorship

Hayashi Masahito, Owari Masaki

2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 691-695 2015

Large Deviation Analysis for Quantum Security via Smoothing of Renyi Entropy of Order 2 Reviewed International coauthorship

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 60 ( 10 ) page： 6702-6732 2014.10

Asymptotic local hypothesis testing between a pure bipartite state and the completely mixed state Reviewed International coauthorship

Owari Masaki, Hayashi Masahito

PHYSICAL REVIEW A Vol. 90 ( 3 ) 2014.9

AT-2-1 Finite-length analysis on secret random number generation and data compression Invited International coauthorship

Hayashi Masahito

Proceedings of the Society Conference of IEICE Vol. 2014 page： "SS-21"-"SS-24" 2014.9

Relating different quantum generalizations of the conditional Renyi entropy Reviewed International coauthorship

Tomamichel Marco, Berta Mario, Hayashi Masahito

JOURNAL OF MATHEMATICAL PHYSICS Vol. 55 ( 8 ) 2014.8

Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths Reviewed International coauthorship

Hayashi Masahito, Nakayama Ryota

NEW JOURNAL OF PHYSICS Vol. 16 2014.6

Random Number Conversion via Restricted Storage Reviewed International coauthorship

Kumagai Wataru, Hayashi Masahito

2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 2047-2051 2014

Asymptotic Reversibility of LOCC Conversions Reviewed International coauthorship

Ito Kosuke, Kumagai Wataru, Hayashi Masahito

2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 531-535 2014

Secret Key Agreement: General Capacity and Second-Order Asymptotics Reviewed International coauthorship

Hayashi Masahito, Tyagi Himanshu, Watanabe Shun

2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 1136-1140 2014

Information Geometry Approach to Parameter Estimation in Markov Chains Reviewed International coauthorship

Hayashi Masahito, Watanabe Shun

2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 1091-1095 2014

A duality relation connecting different quantum generalizations of the conditional Renyi entropy Reviewed International coauthorship

Tomamichel Marco, Berta Mario, Hayashi Masahito

2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) page： 731-735 2014

Finite-length analysis for secret random number generation and coding theorems Reviewed International coauthorship

Hayashi Masahito

2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA) page： 322-326 2014

Non-Asymptotic and Asymptotic Analyses on Markov Chains in Several Problems Reviewed International coauthorship

Hayashi Masahito, Watanabe Shun

2014 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA) page： 328-337 2014

Moderate deviations for joint source-channel coding of systems with Markovian memory Reviewed International coauthorship

Tan V.

IEEE International Symposium on Information Theory - Proceedings page： 1687-1691 2014

Finite-length Analysis on Tail probability and Simple Hypothesis Testing for Markov Chain Reviewed International coauthorship

Watanabe Shun, Hayashi Masahito

2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA) page： 196-200 2014

Strong converse and second-order asymptotics of channel resolvability Reviewed International coauthorship

Watanabe S.

IEEE International Symposium on Information Theory - Proceedings page： 1882-1886 2014

Universal channel coding with continuous output system Reviewed International coauthorship

Hayashi Masahito

2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA) page： 21-25 2014

Strong Converse for a Degraded Wiretap Channel via Active Hypothesis Testing Reviewed International coauthorship

Hayashi Masahito, Tyagi Himanshu, Watanabe Shun

2014 52ND ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON) page： 148-151 2014

Tight Exponential Analysis of Universally Composable Privacy Amplification and Its Applications Reviewed International coauthorship

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 59 ( 11 ) page： 7728-7746 2013.11

A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks Reviewed International coauthorship

Tomamichel Marco, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 59 ( 11 ) page： 7693-7710 2013.11

Entanglement concentration is irreversible. Reviewed International coauthorship

Kumagai W, Hayashi M

Physical review letters Vol. 111 ( 13 ) page： 130407 2013.9

ベクトルの近似直交化を用いた高階線型常微分方程式の整数型解法 (次世代計算科学の基盤技術とその展開 : RIMS研究集会報告集) Reviewed International coauthorship

坂口文則, 林正人

数理解析研究所講究録 ( 1848 ) page： 132 - 146 2013.8

ベクトルの近似直交化を用いた高階線型常微分方程式の整数型解法 (次世代計算科学の基盤技術とその展開) Reviewed International coauthorship

坂口文則, 林正人

数理解析研究所講究録 Vol. 1848 page： 132 - 146 2013.8

Dual Universality of Hash Functions and Its Applications to Quantum Cryptography Reviewed International coauthorship

Tsurumaru Toyohiro, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 59 ( 7 ) page： 4700-4717 2013.7

Quantum Hypothesis Testing for Gaussian States: Quantum Analogues of chi(2), t-, and F-Tests Reviewed International coauthorship

Kumagai Wataru, Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS Vol. 318 ( 2 ) page： 535-574 2013.3

Second Order Asymptotics for Random Number Generation Reviewed International coauthorship

Kumagai Wataru, Hayashi Masahito

2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) page： 1506-+ 2013

Non-Asymptotic Bounds on Fixed Length Source Coding for Markov Chains Reviewed International coauthorship

Hayashi Masahito, Watanabe Shun

2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON) page： 875-882 2013

NONDISTILLABLE ENTANGLEMENT GUARANTEES DISTILLABLE ENTANGLEMENT International coauthorship

Chen Lin, Hayashi Masahito

INTERNATIONAL JOURNAL OF MODERN PHYSICS B Vol. 26 ( 27n28 ) page： 1243008 2012.9

Concise and tight security analysis of the Bennett-Brassard 1984 protocol with finite key lengths Reviewed International coauthorship

Hayashi Masahito, Tsurumaru Toyohiro

NEW JOURNAL OF PHYSICS Vol. 14 2012.9

Precise evaluation of leaked information with universal(2) privacy amplification in the presence of quantum attacker International coauthorship

Hayashi Masahito

2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) page： 890-894 2012

Quantum wiretap channel with non-uniform random number and its exponent of leaked information Reviewed International coauthorship

Hayashi Masahito

2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) page： 895-899 2012

Explanation of Second-Order Asymptotic Theory Via Information Spectrum Method International coauthorship

HAYASHI Masahito

IEICE ESS Fundamentals Review Vol. 6 ( 1 ) page： 12 - 25 2012

Language：Japanese Publishing type：Research paper (scientific journal) Publisher：The Institute of Electronics, Information and Communication Engineers

We explain second-order asymptotic theory via the information spectrum method. From a unified viewpoint based on the generality of the information spectrum method, we consider second-order asymptotic theory for use in fixed-length data compression, uniform random number generation, and channel coding. Additionally, we discuss its application to quantum cryptography, folklore in source coding, and security analysis.

DOI： 10.1587/essfr.6.12

The geometric measure of entanglement for a symmetric pure state with non-negative amplitudes Reviewed

Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages Reviewed International coauthorship

Hayashi Masahito, Matsumoto Ryutaroh

2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON) page： 954-959 2012

Large deviation theory for non-regular location shift family Reviewed International coauthorship

Hayashi Masahito

ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS Vol. 63 ( 4 ) page： 689-716 2011.8

Weaker entanglement between two parties guarantees stronger entanglement with a third party Reviewed International coauthorship

Masahito Hayashi, Lin Chen

Physical Review A Vol. 84 ( 1 ) page： 012325 2011.7

Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification Reviewed International coauthorship

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 57 ( 6 ) page： 3989-4001 2011.6

Comparison between the Cramer-Rao and the mini-max approaches in quantum channel estimation Reviewed International coauthorship

Masahito Hayashi

Communications in Mathematical Physics Vol. 304 ( 3 ) page： 689-709 2011.6

Discrimination of the change point in a quantum setting Reviewed International coauthorship

Daiki Akimoto, Masahito Hayashi

Physical Review A Vol. 83 ( 5 ) page： 052328 2011.5

光子個数制約の下での位相推定 Reviewed International coauthorship

林正人

Progress in informatics ( 8 ) page： 81 - 87 2011.3

Publishing type：Research paper (scientific journal) Publisher：国立情報学研究所

位相推定問題についての多くの研究ではNoon 状態を入力状態として用いる方法が提案されている.理由はNoon 状態を入力状態とした場合,ある点でFisher 情報量が最大となるからである.しかし,Fisher 情報量が必ずしも達成可能な推定誤差を与えるとは限らない.本稿では,Mini-max 基準に加え,局所漸近Mini-max 基準を考え,これらの場合に,Fisher 情報量が達成可能な推定誤差を与えないことを示す.さらに,Noon 状態に代わり,漸近的に最適な入力状態を光子数に関する制約条件の下で与える.

Multicopy and stochastic transformation of multipartite pure states Reviewed International coauthorship

Lin Chen, Masahito Hayashi

Physical Review A Vol. 83 ( 2 ) page： 022331 2011.2

Dual universality of hash functions and its applications to quantum cryptography (ワイドバンドシステム・情報通信基礎サブソサイエティ合同研究会) Reviewed International coauthorship

鶴丸豊広, 林正人

電子情報通信学会技術研究報告. WBS, ワイドバンドシステム : IEICE technical report Vol. 110 ( 444 ) page： 295 - 302 2011.2

Publishing type：Research paper (scientific journal) Publisher：一般社団法人電子情報通信学会

In this paper, we introduce the concept of dual universality of hash functions and present its applications to various quantum and classical communication models including cryptography. We begin by establishing the one-to-one correspondence between a linear function family F and a code family C, and thereby defining ε-almost dual universal_2 hash functions, as a generalization of the conventional universal_2 hash functions. Then we give a security proof for the Bennett-Brassard 1984 protocol, where the Shor-Preskill-type argument is used, but nevertheless ε-almost dual universal_2 functions can be used for privacy amplification.

Dual universality of hash functions and its applications to quantum cryptography (情報理論・情報通信基礎サブソサイエティ合同研究会) Reviewed International coauthorship

鶴丸豊広, 林正人

電子情報通信学会技術研究報告. IT, 情報理論 Vol. 110 ( 442 ) page： 295 - 302 2011.2

Language：English Publishing type：Research paper (scientific journal) Publisher：一般社団法人電子情報通信学会

Universally Attainable Error and Information Exponents, and Equivocation Rate for the Broadcast Channels with Confidential Messages Reviewed International coauthorship

Forty-Ninth Annual Allerton Conference page： . 2011

General theory for integer-type algorithm for higher order differential equations Reviewed International coauthorship

Fuminori Sakaguchi, Masahito Hayashi,

Numerical Functional Analysis and Optimization Vol. 32 ( 5 ) page： 541-582 2011

Secure Multiplex Coding with a Common Message Reviewed International coauthorship

Matsumoto Ryutaroh, Hayashi Masahito

2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) page： . 2011

PRACTICAL IMPLEMENTATION AND ERROR BOUND OF INTEGER-TYPE ALGORITHM FOR HIGHER-ORDER DIFFERENTIAL EQUATIONS Reviewed International coauthorship

Sakaguchi Fuminori, Hayashi Masahito

NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION Vol. 32 ( 12 ) page： 1316-1364 2011

Phase estimation with photon number constraint Reviewed International coauthorship

Masahito HAYASHI

Progress of Informatics ( 8 ) page： 81-87 2011

Secure Multiplex Network Coding Reviewed International coauthorship

Matsumoto, Ryutaroh, Hayashi, Masahito,

2011 International Symposium on Network Coding (NetCod) 2011

Weaker entanglement between two parties guarantees stronger entanglement with a third party Reviewed International coauthorship

林正人

Physical Review A Vol. Vol, 84 page： 12325 2011

Weaker entanglement between two parties guarantees stronger entanglement with a third party Reviewed International coauthorship

林正人

Physical Beview A Vol. 84 page： 12325 2011

Comparison between the Cramer-Rao and the mini-max approaches in quantum channel estimation Reviewed International coauthorship

林正人

Communications in Mathematical Physics Vol. 304 page： 689 - 709 2011

Practical Implementation and Error Bound of Integer-Type Algorithm for Higher-Order Differential Equations Reviewed International coauthorship

林正人

Numerical Functional Analysis and Optimization Vol. 32 page： 1316 - 1364 2011

Phase estimation with photon number constraint," Progress of Informatics Reviewed International coauthorship

林正人

Progress of Informatics Vol. 8 page： 81 - 87 2011

Multi-copy and stochastic transformation of multipartite pure states Reviewed International coauthorship

林正人

Physical Review A Vol. Vol.83 page： 22331 2011

General theory for integer-type algorithm for higher order differential equations Reviewed International coauthorship

林正人

Numerical Functional Analysis and Optimization Vol. 32 page： 541 - 582 2011

Exponential decreasing rate of leaked information in universal random privacy amplification Reviewed International coauthorship

林正人

IEEE Transactions on Information Theory Vol. 57 page： 3989 - 4001 2011

Discrimination of the change point in a quantum setting Reviewed International coauthorship

林正人

Physical Review A Vol. 83 page： 52328 2011

Additivity and non-additivity of multipartite entanglement measures Reviewed International coauthorship

Huangjun Zhu, Lin Chen, M. Hayashi

New Journal of Physics Vol. 12 page： 083002- 2010.8

Capacity With Energy Constraint in Coherent State Channel Reviewed International coauthorship

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 57 ( 8 ) page： 4071-4079 2010.8

Unitary-process discrimination with error margin Reviewed International coauthorship

T. Hashimoto, A. Hayashi, M. Hayashi, M. Horibe

Phys. Rev. A Vol. 81 ( 6 ) page： 062327 2010.6

Limiting behavior of relative Renyi entropy in a non-regular location shift family Reviewed International coauthorship

Masahito Hayashi

Annals of Institute of Statistical Mathematics Vol. 62 ( 3 ) page： 547-569 2010.6

Universal Approximation of Multi-copy States and Universal Quantum Lossless Data Compression Reviewed International coauthorship

Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS Vol. 293 ( 1 ) page： 171-183 2010.1

Two Non-Regular Extensions of Large Deviation Bound Reviewed International coauthorship

Hayashi Masahito

COMMUNICATIONS IN STATISTICS-THEORY AND METHODS Vol. 39 ( 8-9 ) page： 1404-1423 2010

Construction of wiretap codes from ordinary channel codes Reviewed International coauthorship

M. Hayashi and R. Matsumoto

Proceedings of the International Symposium on Information Theory 2010 (ISIT2010) page： 2538-2542 2010

Universal approximation of multi-copy states and universal quantum lossless data compression Reviewed International coauthorship

林正人

Communications in Mathematical Physics 293, No.1 page： 171 - 183 2010

Two non-regular extensions of large deviation bound Reviewed International coauthorship

林正人

Communications in Statistics 39(829) page： 1404 - 1423 2010

Masahito Hayashi, Damian Markham, Mio Murao, Masaki Owari, Shashank Virmani

Journal of Mathematical Physics Vol. 50 ( 12 ) page： 122104 2009.12

Information Spectrum Approach to Second-Order Coding Rate in Channel Coding Reviewed

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 55 ( 11 ) page： 4947-4966 2009.11

Quantum hypothesis testing with group symmetry Reviewed

F.Hiai, M.Mosonyi, M.Hayashi

JOURNAL OF MATHEMATICAL PHYSICS Vol. 50 ( 10 ) page： 103304 2009.10

Universal Coding for Classical-Quantum Channel Reviewed

Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS Vol. 289 ( 3 ) page： 1087-1098 2009.8

Discrimination of Two Channels by Adaptive Methods and Its Application to Quantum System Reviewed

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY Vol. 55 ( 8 ) page： 3807-3820 2009.8

ユニバーサルランダム秘匿性増強における指数的評価 Reviewed

林正人

電子情報通信学会技術研究報告. IT, 情報理論 Vol. 109 ( 143 ) page： 115 - 120 2009.7

Publishing type：Research paper (scientific journal) Publisher：一般社団法人電子情報通信学会

We derive a new upper bound for Eve's information in secret key generation from a common random number without communication. This bound improves on Bennett's bound based on the Renyi entropy of order 2 because the bound obtained here uses the Renyi entropy of order 1+s for s∈[0,1]. This bound is applied to a wire-tap channel. Then, we derive an exponential upper bound for Eve's information. Our exponent is compared with Hayashi's exponent. For the additive case, the bound obtained here is better. The result is applied to secret key agreement by public discussion.

Group theoretical study of LOCC-detection of maximally entangled states using hypothesis testing Reviewed

Hayashi Masahito

NEW JOURNAL OF PHYSICS Vol. 11 2009.4

Fourier Analytic Approach to Phase Estimation in Quantum Systems Reviewed

H.Imai,M.Hayashi

New Journal of Physics Vol. 11 ( 4 ) page： 043034- 2009.4

Optimal ratio between phase basis and bit basis in quantum key distributions Reviewed

Hayashi Masahito

PHYSICAL REVIEW A Vol. 79 ( 2 ) 2009.2

Upper bounds of eavesdropper's performances in finite-length code with the decoy method (vol 76, art no 012329, 2007) Reviewed

Hayashi Masahito

PHYSICAL REVIEW A Vol. 79 ( 1 ) 2009.1

Quantum Information Theory and Its Difficulty

HAYASHI Masahito

IEICE ESS Fundamentals Review Vol. 3 ( 1 ) page： 44 - 56 2009

29pTB-1 Quantum Theory from Information Viewpoint Reviewed

Hayashi Masahito

Meeting Abstracts of the Physical Society of Japan Vol. 64.1.2 ( 0 ) page： 306 2009

Universal coding for classical-quantum channel Reviewed

林正人

Communications in Mathematical Physics 283 No.3 page： 1087 - 1098 2009

Capacity with energy constraint in coherent state channel Reviewed

林正人

IEEE Transactions on Information Theory 2009

量子情報理論とその難しさ Reviewed

林正人

電子情報通信学会基礎・境界ソサイエティ誌 3, No.1 page： 44 - 56 2009

東北大学サイエンスカフェ実施報告-偏光板による量子暗号の模擬実験- Reviewed

林正人

数学通信 14巻2号 page： 38 - 46 2009

Optimal ratio between phase basis and bit basis in quantum key distribution Reviewed

林正人

Physical Review A 79 page： 20303 2009

Large deviation theory for non-regular location shift family Reviewed

林正人

Annals of the Institute of Statistical Mathematics 2009

Information Spectrum Approach to Second-Order Coding Rate in Channel Coding Reviewed

林正人

IEEE Transactions on Information Theory 55, Issue 11 page： 4947 - 4966 2009

Group theoretical study of LOCC-detection of maximally entangled state using hypothesis testing Reviewed

林正人

New Journal of Physics 11 No.4 page： 43028 2009

Discrimination of two channels by adaptive methods and its application to quantum system Reviewed

林正人

IEEE Transactions on Information Theory 55, Issue 8 page： 3807 - 3820 2009

Asymptotic performance of optimal state estimation in qubit system Reviewed

Hayashi Masahito, Matsumoto Keiji

JOURNAL OF MATHEMATICAL PHYSICS Vol. 49 ( 10 ) 2008.10

Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness Reviewed

M. Hayashi

IEEE Transactions on Information Theory Vol. 54 ( 10 ) page： 4619-4637 2008.10

AK-1-3 Quantum information spectrum and its application Reviewed

Hayashi Masahito

Proceedings of the Society Conference of IEICE Vol. 2008 page： "SS - 4"-"SS-6" 2008.9

Information extraction versus irreversibility in quantum measurement processes Reviewed

Buscemi Francesco, Hayashi Masahito, Horodecki Michal

INTERNATIONAL JOURNAL OF QUANTUM INFORMATION Vol. 6 page： 613-619 2008.7

Global information balance in quantum measurements. Reviewed

Buscemi F, Hayashi M, Horodecki M

Physical review letters Vol. 100 ( 21 ) page： 210504 2008.5

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

M. Hayashi, A. Tomita, and K. Matsumoto

New Journal of Physics Vol. 10 page： 043029- 2008.4

Quantum measurements for hidden subgroup problems with optimal sample complexity Reviewed

Hayashi M.

Quantum Information and Computation Vol. 8 ( 3-4 ) page： 345-358 2008.3

Two-way classical communication remarkably improves local distinguishability Reviewed

M. Owari and M. Hayashi

New Journal of Physics Vol. 10 page： 013006- 2008.1

Entanglement of multiparty stabilizer, symmetric, and antisymmetric states Reviewed

M. Hayashi, D. Markham, M. Murao, M. Owari, S. Virmani

Physical Review A Vol. 77 ( 1,Pt.A ) page： 012104 2008

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

林正人

New Journal of physics 10(オンラインジャーナル) 2008

Second-order asymptotics in channel capacity Reviewed

林正人

信学技法 IT2008-5 page： 23 - 28 2008

Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness Reviewed

林正人

IEEE Transaction on Information Theory 54 page： 4619 - 4637 2008

Asymptotic performance of optimal state estimation in qubit system Reviewed

林正人

Journal of Mathematical Physics 49 page： 102101 2008

Quantum measurements for hidden subgroup problems with optimal sample complexity Reviewed

林正人

Quantum Information and Computation 8 page： 345 - 358 2008

Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding Reviewed

M Hayashi

Phys. Rev. A Vol. 76 ( 6 ) page： 062301 2007.12

General theory for decoy-state quantum key distribution with an arbitrary number of intensities Reviewed

M Hayashi

New J. Phys Vol. 9 page： 284- 2007.8

Universal distortion-free entanglement concentration Reviewed

K. Matsumoto, and M. Hayashi

Physical Review A Vol. 75 ( 6 ) page： 062338 2007.6

An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses Reviewed

H. Nagaoka, and M. Hayashi

IEEE Transactions on Information Theory Vol. 53 ( 2 ) page： 534-549 2007.2

Upper bounds of eavesdropper's performances in finite-length code with the decoy method Reviewed

M Hayashi

Physical Review A Vol. 76 ( 1,Pt.A ) page： 012329 2007

19pXG-2 Monogamy Inequality for Distributed Gaussian Entanglement Reviewed

Hayashi M., Tomita A., Hiroshima T., Hasegawa J.

Meeting Abstracts of the Physical Society of Japan Vol. 62.1.2 ( 0 ) page： 144 2007

A general entropic approach to the information-disturbance tradeoff problem in quantum measurements Reviewed

F. Buscemi, M. Hayashi, and M. Horodecki

Asian Conference on Quantum Information Science Shiran Kaikan page： 40-41 2007

General theory for decoy-state QKD with arbitrary number of intensities Reviewed

M. Hayashi

Asian Conference on Quantum Information Science Shiran Kaikan page： 75-76 2007

Quantum network coding Reviewed

Hayashi Masahito, Wama Kazuo, Nishimura Harumichi, Raymond Rudy, Yamashita Shigeru

STACS 2007, PROCEEDINGS Vol. 4393 page： 610-+ 2007

Quantum information with Gaussian states Reviewed

X.-B. Wang, T. Hiroshima, A. Tomita, and M. Hayashi

Physics Reports Vol. 448 ( 1-4 ) page： 1-111 2007

Prior entanglement between senders enables perfect quantum network coding with modification Reviewed

M Hayashi

Phys. Rev. A Vol. 76 ( 4,Pt.A ) page： 040301 2007

Prior entanglement between senders enables perfect quantum network coding Reviewed

M. Hayashi

Asian Conference on Quantum Information Science Shiran Kaikan page： 38-39 2007

Security analysis and experiment of decoy state quantum key distribution incorporating finite statistics Reviewed

J. Hasegawa, M. Hayashi, Tohya Hiroshima , and Akihisa Tomita

Asian Conference on Quantum Information Science Shiran Kaikan page： 77-78 2007

21pWA-2 Classical and Quantum Coding Theory Reviewed

Hayashi Masahito

Meeting Abstracts of the Physical Society of Japan Vol. 62.1.2 ( 0 ) page： 316 2007

Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding Reviewed

林正人

Physical Review A 76 page： 62301 2007

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

M. Hayashi

Physics Letters A Vol. 354 ( 3 ) page： 183-189 2006.5

(4, 1)-量子ランダムアクセス符号の非存在について

林正人, 岩間一雄, 西村治道, レイモンドルディ, 山下茂

電子情報通信学会技術研究報告. COMP, コンピュテーション Vol. 106 ( 63 ) page： 33-38 2006.5

Language：English

1999年にAmbainis, Nayak, Ta-shma, Vaziraniによって導入された(n,1,p)-量子ランダムアクセス符号とは,次のような通信システムである.nビットの情報を持つ送信者はその情報を1キュビットに符号化してそれを受信者に送る.受信者は正作用素値測度によって定義される量子的復号プロセスによりp以上の確率で正しく元のnビットの任意の1ビットを復号することができる.Ambainisらは(2,1,0.85)-量子ランダムアクセス符号の存在を示し,同時に古典的にはそのような符号は不可能であることを示した.ChaungはAmbainisらの符号を(3,1,0.79)-量子ランダムアクセス符号に拡張したが,それ以来p>1/2をみたす(4,1,p)-量子ランダムアクセス符号の存在は未解決であった.この論文ではこの未解決問題に対する否定的回答を与える.

Efficient Transmission of Information on the Quantum Network(New Trends in Theory of Computation and Algorithm) Reviewed

HAYASHI MASAHITO, IWAMA KAZUO, NISHIMURA HARUMICHI, RAYMOND RUDY, YAMASHITA SHIGERU

Vol. 1489 ( 1489 ) page： 128 - 134 2006.5

General formulas for fixed-length quantum entanglement concentration Reviewed

M Hayashi

Transactions on Information Theory Vol. 52 ( 5 ) page： 1904 - 1921 2006.5

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

M. Hayashi, K. Iwama, H. Nishimura, R. Raymond, and S. Yamashita

ISIT 2006, the 2006 IEEE International Symposium on Information Theory page： 446-450 2006

(4,1)-Quantum random access coding does not exist-one qubit is not enough to recover one of four bits Reviewed

M. Hayashi, K. Iwama, H. Nishimura, R. Raymond, and S. Yamashita

New J. Phys. Vol. 8 ( 129 ) page： 1-11 2006

Characterization of several kinds of quantum analogues of relative entropy Reviewed

M Hayashi

Quantum Information and Computation Vol. 6 ( 7 ) page： 583-596 2006

Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication Reviewed

M. Hayashi, D. Markham, M. Murao, M. Owari, and S. Virmani

Phys. Rev. Lett Vol. 96 page： 040501- 2006

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

M. Hayashi, K. Matsumoto, and Y. Tsuda

Journal of Physics A: Mathematical and General Vol. 39 page： 14427-14446 2006

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

M Hayashi

IEEE Transactions on Information Theory Vol. 52 ( 4 ) page： 1562-1575 2006

Practical Evaluation of Security for Quantum Key Distribution Reviewed

M Hayashi

Physical Review A Vol. 74 ( 2,Pt.A ) page： 022307 2006

Practical Evaluation of Security for Quantum Key Distribution Reviewed

M. Hayashi

Asian conference on Quantum Information Science 2006 (AQIS 06) page： 9-10 2006

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

M Hayashi

Physical Review A Vol. 73 ( 6,Pt.A ) page： 060301 2006

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

M. Owari, and M. Hayashi

Physical Review A Vol. 74 ( 3,Pt.A ) page： 032108 2006

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

M. Hayashi, B.-S. Shi, A. Tomita, K. Matsumoto, Y. Tsuda, and Y.-K. Jiang

Physical Review A Vol. 74 ( 6,Pt.A ) page： 062321 2006

Quantum Effect on Eigen-value Estimation in Quantum Two-level System Reviewed

HAYASHI MASAHITO

IPSJ journal Vol. 46 ( 10 ) page： 2447 - 2464 2005.10

Publishing type：Research paper (scientific journal) Publisher：Information Processing Society of Japan (IPSJ)

Concerning the estimation problem of the eigen-value of the density in the quantum two-level system, I compare the accuracy of a estimator based on a quantum measurement with quantum correlation in measuring apparatus with that of the optimal estimator based on a measurement without quantum correlation. It is proven that the estimator realized by Hendrych, et al. (2003) is better than the optimal case without quantum correlation when the true state is closed to a pure state. Although Hendrych, et al. did not discuss the accuracy of their estimation sufficiently, it is expected to be able to be realized to perform an estimation whose accuracy is better than the optimal case without quantum correlation.

On the Second Order Asymptotics for Pure States Family Reviewed

HAYASHI Masahito

The Transactions of the Institute of Electronics, Information and Communication Engineers. A Vol. 88 ( 8 ) page： 903 - 916 2005.8

Hypotheses testing for maximally entangled state (Statistical Inference of Records and Related Statistics) Reviewed

林正人

数理解析研究所講究録 ( 1439 ) page： 225 - 240 2005.7

Local Discrimination and multipartite entanglement measures Reviewed

D. Markham, S. Virmani, M. Owari, M. Murao, M. Hayashi

ERATO conference on Quantum Information Science 2005 (EQIS 05) page： 91-92 2005

Qubit channels which require four inputs to achieve capacity: Implications for additivity conjectures Reviewed

M. Hayashi, H. Imai, K. Matsumoto, M. B. Ruskai and T. Shimono

Quantum information and computation Vol. 5 ( 1 ) page： 13-31 2005

The relationship between local copying and local discrimination Reviewed

M. Owari and M. Hayashi

ERATO conference on Quantum Information Science 2005 (EQIS 05) page： 31-32 2005

Intrinsic randomness based on KL-divergence criterion

HAYASHI Masahito

Vol. 27 ( 1 ) page： 69-72 2004.12

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

HAYASHI Masahito

Vol. 27 ( 1 ) page： 65-68 2004.12

Estimation of SU(2) action by using entanglement Reviewed

M. Hayashi

ERATO conference on Quantum Information Science 2004 (EQIS'04) page： 68-69 2004

Finding a maximally correlated state -- Simultaneous Schmidt decomposition of bipartite pure states Reviewed

T. Hiroshima and M. Hayashi

Physical Review A Vol. 70 ( 3 ) page： 030302 2004

Finding a maximally correlated state -- Simultaneous Schmidt decomposition of bipartite pure states Reviewed

T. Hiroshima and M. Hayashi

ERATO conference on Quantum Information Science 2004 (EQIS'04) page： 43-44 2004

Exponents of channel resolvability and wire-tapped channel Reviewed

M. Hayashi

International Symposium on Information Theory and its Applications (ISITA 2004) page： 1080-1085 2004

Estimation of SU(2) action by using entanglement Reviewed

M. Hayashi

ERATO conference on Quantum Information Science 2004 (EQIS'04) page： 68-69 2004

General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity Reviewed

M. Hayashi

International Symposium on Information Theory and its Applications (ISITA 2004) page： 1562-1567 2004

Qubit channels which require four inputs to achieve capacity: Implications for additivity conjectures Reviewed

M. Hayashi, H. Imai, K. Matsumoto, M. B. Ruskai and T. Shimono

ERATO conference on Quantum Information Science 2004 (EQIS'04) page： 45-46 2004

On error exponents in quantum hypothesis testing Reviewed

T. Ogawa and M. Hayashi

IEEE Transactions on Information Theory Vol. 50 ( 6 ) page： 1368-1372 2004

Hypothesis testing for entanglement Reviewed

Y. Tsuda, M. Hayashi and K. Matsumoto

ERATO conference on Quantum Information Science 2004 (EQIS'04) page： 70-71 2004

Universal distortion-free entanglement concentration Reviewed

K. Matsumoto and M. Hayashi

Proceedings of the International Symposium on Information Theory 2004 (ISIT2004) page： 323- 2004

15aTF-1 Finding a Maximally Correlated State Reviewed

Hiroshima T, Hayashi M

Meeting Abstracts of the Physical Society of Japan Vol. 59.2.2 ( 0 ) page： 130 2004

量子系の統計的推測と量子相関 : 推定における量子効果の検証に向けて Reviewed

林正人

物性研究 Vol. 80 ( 5 ) page： 662 - 699 2003.8

Language：Japanese Publishing type：Research paper (scientific journal) Publisher：物性研究刊行会

量子力学では量子状態の量子相関が非局所性を表すものとして扱われているが,量子系の統計的推測においては量子状態の量子相関だけでなく,量子測定における量子相関も重要な役割を果たすことを解説する.さらに,現在の技術で十分に可能な測定で量子相関を用いることによる効果が明確なものを量子ガウス状態や量子2準位系を例にとって提案する.