研究者詳細 - 林　正人

Capacity of Quantum Private Information Retrieval with Colluding Servers 査読有り国際共著

Song S., Hayashi M.

IEEE Transactions on Information Theory 67 巻 ( 8 ) 頁： 5491 - 5508 2021年8月

担当区分：最終著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：IEEE Transactions on Information Theory

Quantum private information retrieval (QPIR) is a protocol in which a user retrieves one of multiple files from n non-communicating servers by downloading quantum systems without revealing which file is retrieved. As variants of QPIR with stronger security requirements, symmetric QPIR is a protocol in which no other files than the target file are leaked to the user, and t-private QPIR is a protocol in which 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 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/TIT.2021.3077269

Quantum Private Information Retrieval for Quantum Messages 査読有り国際共著

Song S., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 2021-July 巻頁： 1052 - 1057 2021年7月

担当区分：筆頭著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）出版者・発行元：IEEE International Symposium on Information Theory - Proceedings

Quantum private information retrieval (QPIR) for quantum messages is the protocol in which a user retrieves one of the multiple quantum states from one or multiple servers without revealing which state is retrieved. We consider QPIR in two different settings: the blind setting, in which the servers contain one copy of the message states, and the visible setting, in which the servers contain the description of the message states. One trivial solution in both settings is downloading all states from the servers and the main goal of this paper is to find more efficient QPIR protocols. First, we prove that the trivial solution is optimal for one-server QPIR in the blind setting. In one-round protocols, the same optimality holds even in the visible setting. On the other hand, when the user and the server share entanglement, we prove that there exists an efficient one-server QPIR protocol in the blind setting. Furthermore, in the visible setting, we prove that it is possible to construct symmetric QPIR protocols in which the user obtains no information of the non-targeted messages. We construct two-server symmetric QPIR protocols for pure states. Note that symmetric classical PIR is impossible without shared randomness unknown to the user.

DOI： 10.1109/ISIT45174.2021.9517794

Physical Layer Computation as NOMA for Integrated Wireless Systems 査読有り国際共著

Hayashi M., Vazquez-Castro A.

IEEE Transactions on Communications 69 巻 ( 7 ) 頁： 4520 - 4535 2021年7月

担当区分：筆頭著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：IEEE Transactions on Communications

We consider two users A and B wanting to exchange their messages M_{A} and M_{B} via a relay in a wireless communication network. To this aim, we have two methods: direct forward (DF) and computation and forward (CAF). In the first method, after an orthogonal multiple access (OMA) or non-orthogonal multiple access (NOMA) phase, the receiver decodes the two messages. In the second method, after a NOMA phase, the receiver decodes only the (modulo) sum. In the latter case the capacity region (computation region) is not known. This paper compares the two methods. To such aim, we propose a unified coding framework and identify a lower bound of achievable computation rates. We consider three constellations for the symmetric two-user Gaussian channel with Eisenstein constellation showing highest performance. We also show that a minimum signal-to-noise ratio is required for our CAF method to outperform DF, and we obtain the numerical values of such minimum ratios for the three constellations. Finally, we show achievability of our bounds, which is proved to require affine codes for computation, which has not been proved before. Overall, our results are useful for communication system designers towards practical implementation of multiple access methods in integrated wireless systems.

DOI： 10.1109/TCOMM.2021.3067907

Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Extraction 査読有り国際共著

Hayashi M., Fang K., Wang K.

IEEE Transactions on Information Theory 67 巻 ( 6 ) 頁： 3926 - 3944 2021年6月

担当区分：筆頭著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：IEEE Transactions on Information Theory

We give the first systematic study on the second order asymptotics of the operational task of coherence distillation with and without assistance. In the unassisted setting, we introduce a variant of randomness extraction framework where free incoherent operations are allowed before the incoherent measurement and the randomness extractors. We then show that the maximum number of random bits extractable from a given quantum state is precisely equal to the maximum number of coherent bits distillable from the same state. This relation enables us to derive tight second order expansions of both tasks in the independent and identically distributed setting. Remarkably, the incoherent operation classes that can empower coherence distillation for generic states all admit the same second order expansions, indicating their operational equivalence for coherence distillation in both asymptotic and large block length regimes. We then generalize the above line of research to the assisted setting, arising naturally in bipartite quantum systems where Bob distills coherence from the state at hand, aided by the benevolent Alice possessing the other system. More precisely, we introduce a new assisted incoherent randomness extraction task and establish an exact relation between this task and the assisted coherence distillation. It strengthens the one-shot relation in the unassisted setting and confirms that this cryptographic framework offers a new perspective to the study of quantum coherence distillation. Likewise, this relation yields second order characterizations to the assisted tasks. As by-products, we show the strong converse property of the tasks above from their second order expansions.

DOI： 10.1109/TIT.2021.3064009

Permutation Enhances Classical Communication Assisted by Entangled States 査読有り国際共著

Wang K., Hayashi M.

IEEE Transactions on Information Theory 67 巻 ( 6 ) 頁： 3905 - 3925 2021年6月

担当区分：最終著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：IEEE Transactions on Information Theory

We study classical communication over a noisy quantum channel when bipartite states are preshared between the sender and the receiver, and one of the following encoding strategies are available: i) local operations; ii) local operations and one-way classical communication; iii) local operations and global permutations. Our main result is a capacity formula for strategy iii). This formula's two endpoints are the capacity formula in strategy i) and the entanglement-assisted classical capacity. Interestingly, these capacities satisfy 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 capacities by strategy i) and strategy iii) is upper bounded by the discord of formation of the preshared state. What's more, we show that strategy ii) has no advantage over strategy i) in the weak converse regime. As examples, we derive these capacities analytically by the above strategies for some fundamental quantum channels. In some cases, the capacity of strategy iii) is strictly larger than those of strategies i) and ii) whenever entanglement assistance is available. Our results witness the power of random permutation in entanglement-assisted classical communication.

DOI： 10.1109/TIT.2021.3060452

Representation matching for remote quantum computing 査読有り国際共著

Yang Y, Hayashi M

2 巻 2021年5月

Asymptotically Secure Network Code for Active Attacks 査読有り国際共著

Hayashi M., Cai N.

IEEE Transactions on Communications 69 巻 ( 5 ) 頁： 3245 - 3259 2021年5月

担当区分：筆頭著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：IEEE Transactions on Communications

When there exists a malicious attacker in the network, we need to be careful of eavesdropping and contamination. This problem is crucial for network communication when the network is realized by a partially trusted relay of quantum key distribution. We discuss the asymptotic rate in a linear network with the secrecy and robustness conditions when the above type of attacker exists. Also, under the same setting, we discuss the asymptotic rate in a linear network when we impose the secrecy condition alone.

DOI： 10.1109/TCOMM.2021.3057112

Secure Computation-and-Forward with Linear Codes 査読有り国際共著

Hayashi M,, Wadayama T., Vazquez-Catro A.

2 巻 2021年3月

Secure non-linear network code over one-hop relay network 査読有り国際共著

Hayashi M, Cai N.

2 巻 2021年3月

Capacity of Quantum Symmetric Private Information Retrieval with Collusion of All But One of Servers 査読有り国際共著

Song S., Hayashi M.

2 巻 2021年3月

Secure Computation-and-Forward with Linear Codes 査読有り国際共著

Hayashi M,, Wadayama T., Vazquez-Catro A.

2 巻 2021年3月

Capacity of Quantum Private Information Retrieval with Multiple Servers 査読有り国際共著

Song S., Hayashi M.

IEEE Transactions on Information Theory 67 巻 ( 1 ) 頁： 452 - 463 2021年1月

担当区分：最終著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：IEEE Transactions on Information Theory

We study the capacity of quantum private information retrieval (QPIR) with multiple servers. In the QPIR problem with multiple servers, a user retrieves a classical file by downloading quantum systems from multiple servers each of which contains the copy of a classical file set while the identity of the downloaded file is not leaked to each server. The QPIR capacity is defined as the maximum rate of the file size over the whole dimension of the downloaded quantum systems. When the servers are assumed to share prior entanglement, we prove that the QPIR capacity with multiple servers is 1 regardless of the number of servers and files. We construct a rate-one protocol only with two servers. This capacity-achieving protocol outperforms its classical counterpart in the sense of the capacity, server secrecy, and upload cost. The strong converse bound is derived concisely without using any secrecy condition. We also prove that the capacity of multi-round QPIR is 1.

DOI： 10.1109/TIT.2020.3022515

Prior entanglement exponentially improves one-server quantum private information retrieval for quantum messages 査読有り

Song, SH; Gall, FL; Hayashi, M

EPJ QUANTUM TECHNOLOGY 11 巻 ( 1 ) 2024年12月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：EPJ Quantum Technology

Quantum private information retrieval (QPIR) for quantum messages is a quantum communication task, in which a user retrieves one of the multiple quantum states from the server without revealing which state is retrieved. In the one-server setting, we find an exponential gap in the communication complexities between the presence and absence of prior entanglement in this problem with the one-server setting. To achieve this aim, as the first step, we prove that the trivial solution of downloading all messages is optimal under QPIR for quantum messages, which is a similar result to that of classical PIR but different from QPIR for classical messages. As the second step, we propose an efficient one-server one-round QPIR protocol with prior entanglement by constructing a reduction from a QPIR protocol for classical messages to a QPIR protocol for quantum messages in the presence of prior entanglement.

DOI： 10.1140/epjqt/s40507-024-00266-6

Finding the optimal probe state for multiparameter quantum metrology using conic programming 査読有り Open Access

Hayashi, M; Ouyang, YK

NPJ QUANTUM INFORMATION 10 巻 ( 1 ) 2024年11月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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

Asymmetry activation and its relation to coherence under permutation operation 査読有り

Hayashi, M

QUANTUM 8 巻 2024年11月

Reverse em-problem based on Bregman divergence and its application to classical and quantum information theory 査読有り

Hayashi, M

INFORMATION GEOMETRY 7 巻 ( 2 ) 頁： 371 - 440 2024年11月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi, M; Liu, G

QUANTUM SCIENCE AND TECHNOLOGY 9 巻 ( 4 ) 2024年10月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Yu, BC; Hayashi, M

NEW JOURNAL OF PHYSICS 26 巻 ( 10 ) 2024年10月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り

Hayashi, M

INFORMATION GEOMETRY 2024年8月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi, M

INTERNATIONAL JOURNAL OF QUANTUM INFORMATION 22 巻 ( 05 ) 2024年8月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り

Arai, H; Yu, BC; Hayashi, M

PHYSICAL REVIEW A 110 巻 ( 1 ) 2024年7月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り

Hayashi, M; Hora, A; Yanagida, S

RAMANUJAN JOURNAL 64 巻 ( 3 ) 頁： 963 - 990 2024年7月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi, M; Chen, YL

IEEE TRANSACTIONS ON INFORMATION THEORY 70 巻 ( 7 ) 頁： 4611 - 4633 2024年7月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り

Takagi, R; Hayashi, M

LETTERS IN MATHEMATICAL PHYSICS 114 巻 ( 3 ) 2024年6月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Arai, H; Hayashi, M

NEW JOURNAL OF PHYSICS 26 巻 ( 5 ) 2024年5月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著 Open Access

Hayashi, M; Song, SH

ADVANCED QUANTUM TECHNOLOGIES 7 巻 ( 4 ) 2024年4月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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) 査読有り

Hayashi, M; Tan, VYF

IEEE TRANSACTIONS ON INFORMATION THEORY 70 巻 ( 4 ) 頁： 3046 - 3048 2024年4月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi, M; Vázquez-Castro, A

IEEE TRANSACTIONS ON COMMUNICATIONS 72 巻 ( 3 ) 頁： 1516 - 1531 2024年3月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著

Hayashi, M; Koshiba, T

IEEE-ACM TRANSACTIONS ON NETWORKING 32 巻 ( 1 ) 頁： 253 - 267 2024年2月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi M.

Quantum 8 巻 2024年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り

Hayashi M.

2024 IEEE Information Theory Workshop, ITW 2024 頁： 651 - 656 2024年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著 Open Access

Li, ZH; Zhu, HJ; Hayashi, M

NPJ QUANTUM INFORMATION 9 巻 ( 1 ) 2023年11月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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' 査読有り

Hayashi M.

IEEE Transactions on Information Theory 69 巻 ( 11 ) 2023年11月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi, M; Song, S

IEEE TRANSACTIONS ON INFORMATION THEORY 69 巻 ( 10 ) 頁： 6537 - 6563 2023年10月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi, M; Warsi, NA

IEEE TRANSACTIONS ON INFORMATION THEORY 69 巻 ( 8 ) 頁： 5083 - 5099 2023年8月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi, M

IEEE TRANSACTIONS ON INFORMATION THEORY 69 巻 ( 6 ) 頁： 3460 - 3492 2023年6月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi, M

IEEE TRANSACTIONS ON INFORMATION THEORY 69 巻 ( 3 ) 頁： 1381 - 1393 2023年3月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Li, K; Yao, YS; Hayashi, M

IEEE TRANSACTIONS ON INFORMATION THEORY 69 巻 ( 3 ) 頁： 1680 - 1694 2023年3月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著 Open Access

Hayashi, M; Yang, YX

QUANTUM 7 巻 2023年2月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Arai, H; Hayashi, M

NEW JOURNAL OF PHYSICS 25 巻 ( 2 ) 2023年2月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi M., Ouyang Y.

Quantum 7 巻 2023年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り

Hayashi, M; Wang, K

PRX QUANTUM 3 巻 ( 3 ) 2022年9月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

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

PRX QUANTUM 3 巻 ( 3 ) 2022年9月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り

Hayashi, M; Koshiba, T

QUANTUM INFORMATION PROCESSING 21 巻 ( 8 ) 2022年8月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

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

NPJ QUANTUM INFORMATION 8 巻 ( 1 ) 2022年6月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Wu, JW; Long, GL; Hayashi, M

PHYSICAL REVIEW APPLIED 17 巻 ( 6 ) 2022年6月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著 Open Access

Hayashi, M

IEEE TRANSACTIONS ON INFORMATION THEORY 68 巻 ( 6 ) 頁： 3620 - 3642 2022年6月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：IEEE Transactions on Information Theory

We propose a new concept of secure list decoding, which is related to bit-string commitment. While the conventional list decoding requires that the list contains the transmitted message, secure list decoding requires the following additional security conditions to work as a modification of bit-string commitment. The first additional security condition is the receiver's uncertainty for the transmitted message, which is stronger than the impossibility of the correct decoding, even though the transmitted message is contained in the list. The other additional security condition is the impossibility for the sender to estimate another element of the decoded list except for the transmitted message. The first condition is evaluated by the equivocation rate. The asymptotic property is evaluated by three parameters, the rates of the message and list sizes, and the equivocation rate. We derive the capacity region of this problem. We show that the combination of hash function and secure list decoding yields the conventional bit-string commitment. Our results hold even when the input and output systems are general probability spaces including continuous systems. When the input system is a general probability space, we formulate the abilities of the honest sender and the dishonest sender in a different way.

DOI： 10.1109/TIT.2022.3150498

Global Heisenberg scaling in noisy and practical phase estimation 査読有り Open Access

Hayashi, M; Liu, ZW; Yuan, HD

QUANTUM SCIENCE AND TECHNOLOGY 7 巻 ( 2 ) 2022年4月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著国際誌 Open Access

Song, S; Hayashi, M

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 40 巻 ( 3 ) 頁： 999 - 1012 2022年3月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著 Open Access

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

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 40 巻 ( 3 ) 頁： 885 - 898 2022年3月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り

Hayashi, M; Cai, N

IEEE TRANSACTIONS ON INFORMATION THEORY 68 巻 ( 3 ) 頁： 1822 - 1850 2022年3月

Usefulness of adaptive strategies in asymptotic quantum channel discrimination 査読有り国際共著 Open Access

Salek, F; Hayashi, M; Winter, A

PHYSICAL REVIEW A 105 巻 ( 2 ) 2022年2月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：Physical Review A

Adaptiveness is a key principle in information processing including statistics and machine learning. We investigate the usefulness adaptive methods in the framework of asymptotic binary hypothesis testing, when each hypothesis represents asymptotically many independent instances of a quantum channel, and the tests are based on using the unknown channel and observing outputs. Unlike the familiar setting of quantum states as hypotheses, there is a fundamental distinction between adaptive and nonadaptive strategies with respect to the channel uses, and we introduce a number of further variants of the discrimination tasks by imposing different restrictions on the test strategies. The following results are obtained: (1) We prove that for classical-quantum channels, adaptive and nonadaptive strategies lead to the same error exponents both in the symmetric (Chernoff) and asymmetric (Hoeffding, Stein) settings. (2) The first separation between adaptive and nonadaptive symmetric hypothesis testing exponents for quantum channels, which we derive from a general lower bound on the error probability for nonadaptive strategies; the concrete example we analyze is a pair of entanglement-breaking channels. (3) We prove, in some sense generalizing the previous statement, that for general channels adaptive strategies restricted to classical feed-forward and product state channel inputs are not superior in the asymptotic limit to nonadaptive product state strategies. (4) As an application of our findings, we address the discrimination power of an arbitrary quantum channel and show that adaptive strategies with classical feedback and no quantum memory at the input do not increase the discrimination power of the channel beyond nonadaptive tensor product input strategies.

DOI： 10.1103/PhysRevA.105.022419

Information geometry approach to parameter estimation in hidden Markov model 査読有り国際共著

Hayashi, M

BERNOULLI 28 巻 ( 1 ) 頁： 307 - 342 2022年2月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：Bernoulli

We consider the estimation of the transition matrix of a hidden Markovian process by using information geometry with respect to transition matrices. In this paper, only the histogram of k-memory data is used for the estimation. To establish our method, we focus on a partial observation model with the Markovian process and we propose an efficient estimator whose asymptotic estimation error is given as the inverse of projective Fisher information of transition matrices. This estimator is applied to the estimation of the transition matrix of the hidden Markovian process. In this application, we carefully discuss the equivalence problem for hidden Markovian process on the tangent space.

DOI： 10.3150/21-BEJ1344

Secure Physical Layer Network Coding versus Secure Network Coding 査読有り国際共著 Open Access

Hayashi, M

ENTROPY 24 巻 ( 1 ) 2022年1月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：Entropy

When a network has relay nodes, there is a risk that a part of the information is leaked to an untrusted relay. Secure network coding (secure NC) is known as a method to resolve this problem, which enables the secrecy of the message when the message is transmitted over a noiseless network and a part of the edges or a part of the intermediate (untrusted) nodes are eavesdropped. If the channels on the network are noisy, the error correction is applied to noisy channels before the application of secure NC on an upper layer. In contrast, secure physical layer network coding (secure PLNC) is a method to securely transmit a message by a combination of coding operation on nodes when the network is composed of set of noisy channels. Since secure NC is a protocol on an upper layer, secure PLNC can be considered as a cross-layer protocol. In this paper, we compare secure PLNC with a simple combination of secure NC and error correction over several typical network models studied in secure NC.

DOI： 10.3390/e24010047

Quantum-Inspired Secure Wireless Communication Protocol Under Spatial and Local Gaussian Noise Assumptions 査読有り Open Access

Hayashi, M

IEEE ACCESS 10 巻頁： 29040 - 29068 2022年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 2022-June 巻頁： 91 - 96 2022年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り

Li K., Yao Y., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 2022-June 巻頁： 1862 - 1867 2022年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り Open Access

Hayashi M., Warsi N.A.

IEEE International Symposium on Information Theory - Proceedings 2022-June 巻頁： 1058 - 1063 2022年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：IEEE International Symposium on Information Theory - Proceedings

DOI： 10.1109/ISIT50566.2022.9834801

Refined Density Evolution Analysis of LDPC Codes for Successive Interference Cancellation 査読有り国際共著

Takabe S., Wadayama T., Hayashi M.

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) 査読有り国際共著

Hayashi M., Tsurumaru T.

New Journal of Physics 23 巻 ( 12 ) 2021年12月

担当区分：筆頭著者,　最終著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：New Journal of Physics

The paper (Hayashi M and Tsurumaru T 2012 New J. Phys. 14 093014) contains an error at the definition of g t (x) in section 5.3 while g t (x) is used for the second order asymptotic expansion for the sacrifice bit. This corrigendum corrects this error and shows its derivation.

DOI： 10.1088/1367-2630/ac3c61

Asymptotic Separation Between Adaptive and Non-adaptive Strategies in Quantum Channel Discrimination 査読有り国際共著

Salek M., Hayashi M., Winter A.

2021年7月

Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness 査読有り国際共著

Hayashi M, Fang K., Wang K.

2021年7月

Universal classical-quantum multiple access channel coding 査読有り国際共著

Hayashi M, Cai N.

2021年7月

Equivalence of Non-Perfect Secret Sharing and Symmetric Private Information Retrieval with General Access Structure 査読有り国際共著

Song S., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 2021-July 巻頁： 982 - 987 2021年7月

担当区分：最終著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）出版者・発行元：IEEE International Symposium on Information Theory - Proceedings

We study the equivalence between non-perfect secret sharing (NSS) and symmetric private information retrieval (SPIR) with colluding and unresponsive servers. We prove the equivalence between NSS and SPIR in the following two senses. 1) Given any SPIR protocol, we can construct an NSS protocol. 2) Given any linear NSS protocol, we can construct a SPIR protocol. 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 general access structure. For the special case of n-server SPIR with r responsive and t colluding servers, this upper bound proves that the SPIR capacity is (r-t)/n. From the second relation, we prove that a SPIR protocol exists for any access structure.

DOI： 10.1109/ISIT45174.2021.9517803

Universal classical-quantum multiple access channel coding 査読有り国際共著

Hayashi M, Cai N.

2021年7月

Secure Modulo Sum via Multiple Access Channel 査読有り国際共著

Hayashi M.

2021年7月

Asymptotic Separation Between Adaptive and Non-adaptive Strategies in Quantum Channel Discrimination 査読有り国際共著

Salek M., Hayashi M., Winter A.

2021年7月

Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness 査読有り国際共著

Hayashi M, Fang K., Wang K.

2021年7月

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication 査読有り国際共著

Kato G., Owari M., Hayashi M.

IEEE Transactions on Information Theory 67 巻 ( 7 ) 頁： 4564 - 4586 2021年6月

Quantum state estimation with nuisance parameters 査読有り国際共著

Suzuki J., Yang Y., Hayashi M.

Journal of Physics A: Mathematical and Theoretical 53 巻 ( 45 ) 2020年11月

担当区分：最終著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：Journal of Physics A: Mathematical and Theoretical

In parameter estimation, nuisance parameters refer to parameters that are not of interest but nevertheless affect the precision of estimating other parameters of interest. For instance, the strength of noises in a probe can be regarded as a nuisance parameter. Despite its long history in classical statistics, the nuisance parameter problem in quantum estimation remains largely unexplored. The goal of this article is to provide a systematic review of quantum estimation in the presence of nuisance parameters, and to supply those who work in quantum tomography and quantum metrology with tools to tackle relevant problems. After an introduction to the nuisance parameter and quantum estimation theory, we explicitly formulate the problem of quantum state estimation with nuisance parameters. We extend quantum Cramér–Rao bounds to the nuisance parameter case and provide a parameter orthogonalization tool to separate the nuisance parameters from the parameters of interest. In particular, we put more focus on the case of one-parameter estimation in the presence of nuisance parameters, as it is most frequently encountered in practice.

DOI： 10.1088/1751-8121/ab8b78

Perfect Discrimination in Approximate Quantum Theory of General Probabilistic Theories. 査読有り国際共著

Yoshida Y, Arai H, Hayashi M

Physical review letters 125 巻 ( 15 ) 頁： 150402 2020年10月

担当区分：最終著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著

IEEE Journal on Selected Areas in Information Theory 1 巻頁： 387 - 400 2020年9月

Reduction Theorem for Secrecy over Linear Network Code for Active Attacks. 査読有り国際共著

Hayashi M, Owari M, Kato G, Cai N

Entropy (Basel, Switzerland) 22 巻 ( 9 ) 2020年9月

担当区分：筆頭著者,　最終著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著

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

IEEE Transactions on Information Theory 66 巻 ( 9 ) 頁： 5548 - 5566 2020年9月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著

Hayashi M., Song S.

Physical Review Research 2 巻 ( 3 ) 2020年7月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著

Takabe S., Wadayama T., Hayashi M.

IEEE Transactions on Communications 68 巻 ( 7 ) 頁： 4063 - 4072 2020年7月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著

Song S., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 2020-June 巻頁： 1077 - 1082 2020年6月

担当区分：最終著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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) 査読有り国際共著

Cai N., Hayashi M.

IEEE Transactions on Information Theory 66 巻 ( 6 ) 2020年6月

担当区分：最終著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著

Wang K., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 2020-June 巻頁： 1840 - 1845 2020年6月

担当区分：最終著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著

Yoshida Y., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 2020-June 巻頁： 1973 - 1977 2020年6月

担当区分：最終著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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) 査読有り国際共著

RIMS Kokyuroku 2157 巻頁： 104 - 116 2020年6月

Capacity of Quantum Private Information Retrieval with Colluding Servers 査読有り国際共著

2020年6月

Asymptotic properties for Markovian dynamics in quantum theory and general probabilistic theories 査読有り国際共著

Yoshida Y., Hayashi M.

Journal of Physics A: Mathematical and Theoretical 53 巻 ( 21 ) 2020年5月

担当区分：最終著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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 査読有り国際共著

Hayashi M., Vazquez-Castro Á.

IEEE Transactions on Communications 68 巻 ( 5 ) 頁： 3068 - 3078 2020年5月

担当区分：筆頭著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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. 査読有り国際共著

Hayashi M, Watanabe S

Entropy (Basel, Switzerland) 22 巻 ( 4 ) 2020年4月

担当区分：筆頭著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：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. 査読有り国際共著

Takagi R, Wang K, Hayashi M

Physical review letters 124 巻 ( 12 ) 頁： 120502 2020年3月

Secure network code for adaptive and active attacks with no-randomness in intermediate nodes 査読有り国際共著

Cai N., Hayashi M.

IEEE Transactions on Information Theory 66 巻 ( 3 ) 頁： 1428 - 1448 2020年3月

Secure Quantum Network Code without Classical Communication 査読有り国際共著

Song S., Hayashi M.

IEEE Transactions on Information Theory 66 巻 ( 2 ) 頁： 1178 - 1192 2020年2月

Physical Layer Security Protocol for Poisson Channels for Passive Man-in-the-Middle Attack 査読有り国際共著

Hayashi M., Vazquez-Castro, A.

IEEE Transactions on Information Forensics and Security 15 巻頁： 2295 - 2305 2020年

Quantifying Time-Varying Sources in Magnetoencephalography -- A Discrete Approach 査読有り国際共著

14 巻頁： 1379 - 1408 2020年

Efficient Verification of Pure Quantum States in the Adversarial Scenario. 査読有り国際共著

Zhu H, Hayashi M

Physical review letters 123 巻 ( 26 ) 頁： 260504 2019年12月

General framework for verifying pure quantum states in the adversarial scenario 査読有り国際共著

Zhu H, Hayashi M

Physical Review A 100 巻 ( 6 ) 2019年12月

Efficient verification of hypergraph states 査読有り国際共著

Zhu H, Hayashi M

Physical Review Applied 12 巻 ( 5 ) 2019年11月

Perfect discrimination of non-orthogonal separable pure states on bipartite system in general probabilistic theory 査読有り国際共著

Arai H.,Yoshida Y., Hayashi M.

Journal of Physics A: Mathematical and Theoretical 52 巻 ( 46 ) 2019年10月

Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements. 査読有り国際共著

Takeuchi Y, Morimae T, Hayashi M

Scientific reports 9 巻 ( 1 ) 頁： 13585 2019年9月

Second Order Analysis for Joint Source-Channel Coding With General Channel and Markovian Source 査読有り国際共著

Yaguchi Ryo, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 65 巻 ( 9 ) 頁： 5750-5770 2019年9月

Optimal verification and fidelity estimation of maximally entangled states 査読有り国際共著

Zhu Huangjun, Hayashi Masahito

PHYSICAL REVIEW A 99 巻 ( 5 ) 2019年5月

Attaining the Ultimate Precision Limit in Quantum State Estimation 査読有り国際共著

Yang Y.,Chiribella G., Hayashi M.

Communications in Mathematical Physics 368 巻 ( 1 ) 頁： 223-293 2019年5月

Physical layer security for rf satellite channels in the finite-length regime 査読有り国際共著

Vazquez-Castro A., Hayashi M.

IEEE Transactions on Information Forensics and Security 14 巻 ( 4 ) 頁： 981-993 2019年4月

Correction to 'Quantum stopwatch: how to store time in a quantum memory'. 査読有り国際共著

Yang Y, Chiribella G, Hayashi M

Proceedings. Mathematical, physical, and engineering sciences 475 巻 ( 2223 ) 頁： 20190052 2019年3月

Secure computation-and-forward communication with linear codes 査読有り国際共著

Hayashi M. Wadayama T. Vazuez-Castro A.

2018 IEEE Information Theory Workshop, ITW 2018 2019年1月

Secure quantum network code without classical communication 査読有り国際共著

Song S. Hayashi M

2018 IEEE Information Theory Workshop, ITW 2018 2019年1月

Secure physical layer network coding versus secure network coding 招待有り査読有り国際共著

Hayashi M.

2018 IEEE Information Theory Workshop, ITW 2018 2019年1月

Resolving unattainable Cramer-Rao bounds for quantum sensors 査読有り国際共著

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

Journal of Physics B: Atomic, Molecular and Optical Physics 52 巻 ( 1 ) 2019年1月

Universal Channel Coding for General Output Alphabet 査読有り国際共著

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 65 巻 ( 1 ) 頁： 302-321 2019年1月

Asymptotically Decoupling and Mixing Properties in Quantum System 査読有り国際共著

Yoshida Y., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 2018-June 巻頁： 261-265 2018年8月

Secure Communication over Fully Quantum Gel' Fand-Pinsker Wiretap Channel 査読有り国際共著

Anshu A., Hayashi M., Warsi N.

IEEE International Symposium on Information Theory - Proceedings 2018-June 巻頁： 2679-2683 2018年8月

Compression for Qubit Clocks 査読有り国際共著

Yang Y., Chiribella G., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 2018-June 巻頁： 2476-2480 2018年8月

Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication 査読有り国際共著

Hayashi M., Koshiba T.

IEEE International Symposium on Information Theory - Proceedings 2018-June 巻頁： 2614-2618 2018年8月

Asymptotic and non-asymptotic analysis for a hidden Markovian process with a quantum hidden system 査読有り国際共著

Hayashi M., Yoshida Y.

Journal of Physics A: Mathematical and Theoretical 51 巻 ( 33 ) 2018年7月

Quantum network code for multiple-unicast network with quantum invertible linear operations 査読有り国際共著

Song S., Hayashi M.

Leibniz International Proceedings in Informatics, LIPIcs 111 巻頁： 10:1-10:20 2018年7月

Compression for Quantum Population Coding 査読有り国際共著

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

IEEE Transactions on Information Theory 64 巻 ( 7 ) 頁： 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) 査読有り国際共著

Kumagai Wataru, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 64 巻 ( 7 ) 頁： 5455 - 5455 2018年7月

Self-guaranteed measurement-based quantum computation 査読有り国際共著

Hayashi Masahito, Hajdusek Michal

PHYSICAL REVIEW A 97 巻 ( 5 ) 2018年5月

Analysis of Remaining Uncertainties and Exponents Under Various Conditional Renyi Entropies 査読有り国際共著

Tan Vincent Y. F., Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 64 巻 ( 5 ) 頁： 3734-3755 2018年5月

Quantum stopwatch: how to store time in a quantum memory. 国際共著

Yang Y, Chiribella G, Hayashi M

Proceedings. Mathematical, physical, and engineering sciences 474 巻 ( 2213 ) 頁： 20170773 2018年5月

担当区分：最終著者記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：The Royal Society

<jats:p>Quantum mechanics imposes a fundamental trade-off between the accuracy of time measurements and the size of the systems used as clocks. When the measurements of different time intervals are combined, the errors due to the finite clock size accumulate, resulting in an overall inaccuracy that grows with the complexity of the set-up. Here, we introduce a method that, in principle, eludes the accumulation of errors by coherently transferring information from a quantum clock to a quantum memory of the smallest possible size. Our method could be used to measure the total duration of a sequence of events with enhanced accuracy, and to reduce the amount of quantum communication needed to stabilize clocks in a quantum network.</jats:p>

DOI： 10.1098/rspa.2017.0773

Axiomatic and operational connections between the l1 -norm of coherence and negativity 査読有り国際共著

Zhu H.

Physical Review A 97 巻 ( 2 ) 2018年2月

Minimum Rates of Approximate Sufficient Statistics 査読有り国際共著

Hayashi Masahito, Tan Vincent Y. F.

IEEE TRANSACTIONS ON INFORMATION THEORY 64 巻 ( 2 ) 頁： 875-888 2018年2月

Operational Interpretation of Renyi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions 査読有り国際共著

Tomamichel Marco, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 64 巻 ( 2 ) 頁： 1064-1082 2018年2月

Universally Fisher-Symmetric Informationally Complete Measurements. 査読有り国際共著

Zhu H, Hayashi M

Physical review letters 120 巻 ( 3 ) 頁： 030404 2018年1月

Secure uniform random-number extraction via incoherent strategies 査読有り国際共著

Hayashi Masahito, Zhu Huangjun

PHYSICAL REVIEW A 97 巻 ( 1 ) 2018年1月

Single-shot secure quantum network coding on butterfly network with free public communication 査読有り国際共著

Owari M., Kato G., Hayashi M.

Quantum Science and Technology 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. 査読有り国際共著

Ito K, Hayashi M

Physical review. E 97 巻 ( 1-1 ) 頁： 012129 2018年1月

Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels 査読有り国際共著

Takabe Satoshi, Ishimatsu Yuta, Wadayama Tadashi, Hayashi Masahito

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

Verification of hypergraph states 査読有り国際共著

Morimae Tomoyuki, Takeuchi Yuki, Hayashi Masahito

PHYSICAL REVIEW A 96 巻 ( 6 ) 2017年12月

Coherence and entanglement measures based on Rnyi relative entropies 国際共著

Zhu Huangjun, Hayashi Masahito, Chen Lin

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL 50 巻 ( 47 ) 2017年11月

Verifiable fault tolerance in measurement-based quantum computation 査読有り国際共著

Fujii Keisuke, Hayashi Masahito

PHYSICAL REVIEW A 96 巻 ( 3 ) 2017年9月

Minimum rates of approximate sufficient statistics 査読有り国際共著

Hayashi M., Tan V.

IEEE International Symposium on Information Theory - Proceedings 頁： 3035-3039 2017年8月

Compression for quantum population coding 査読有り国際共著

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

IEEE International Symposium on Information Theory - Proceedings 頁： 1973-1977 2017年8月

Secure wireless communication under spatial and local Gaussian noise assumptions 査読有り国際共著

Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 頁： 1698-1702 2017年8月

Secrecy and robustness for active attack in secure network coding 査読有り国際共著

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

IEEE International Symposium on Information Theory - Proceedings 頁： 1172-1176 2017年8月

Second order analysis for joint source-channel coding with Markovian source 査読有り国際共著

Yaguchi R., Hayashi M.

IEEE International Symposium on Information Theory - Proceedings 頁： 918-922 2017年8月

Finite-size effect on optimal efficiency of heat engines 査読有り国際共著

Hayashi M., Tajima H.

PHYSICAL REVIEW E 96 巻 ( 1 ) 2017年7月

Tight Asymptotic Bounds on Local Hypothesis Testing Between a Pure Bipartite State and the White Noise State 査読有り国際共著

Hayashi Masahito, Owari Masaki

IEEE TRANSACTIONS ON INFORMATION THEORY 63 巻 ( 6 ) 頁： 4008-4036 2017年6月

Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages 査読有り国際共著

Matsumoto Ryutaroh, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 63 巻 ( 6 ) 頁： 3773-3782 2017年6月

Discrimination Power of a Quantum Detector. 査読有り国際共著

Hirche C, Hayashi M, Bagan E, Calsamiglia J

Physical review letters 118 巻 ( 16 ) 頁： 160502 2017年4月

FINITE-LENGTH ANALYSIS ON TAIL PROBABILITY FOR MARKOV CHAIN AND APPLICATION TO SIMPLE HYPOTHESIS TESTING 査読有り国際共著

Watanabe Shun, Hayashi Masahito

ANNALS OF APPLIED PROBABILITY 27 巻 ( 2 ) 頁： 811-845 2017年4月

Random Number Conversion and LOCC Conversion via Restricted Storage 査読有り国際共著

Kumagai Wataru, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 63 巻 ( 4 ) 頁： 2504-2532 2017年4月

Measurement-based formulation of quantum heat engines 査読有り国際共著

Hayashi Masahito, Tajima Hiroyasu

PHYSICAL REVIEW A 95 巻 ( 3 ) 2017年3月

Second-Order Asymptotics of Conversions of Distributions and Entangled States Based on Rayleigh-Normal Probability Distributions 査読有り国際共著

Kumagai Wataru, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 63 巻 ( 3 ) 頁： 1829-1857 2017年3月

Equivocations, Exponents, and Second-Order Coding Rates Under Various Renyi Information Measures 査読有り国際共著

Hayashi Masahito, Tan Vincent Y. F.

IEEE TRANSACTIONS ON INFORMATION THEORY 63 巻 ( 2 ) 頁： 975-1005 2017年2月

Mathematical Formulation of Quantum Systems 国際共著

Hayashi Masahito

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

Limits and Linear Algebra 国際共著

Hayashi Masahito

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

Finite-block-length analysis in classical and quantum information theory. 国際共著

Hayashi M

Proceedings of the Japan Academy. Series B, Physical and biological sciences 93 巻 ( 3 ) 頁： 99 - 124 2017年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：日本学士院

<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 査読有り国際共著

Vazquez-Castro Angeles, Hayashi Masahito

2017 IEEE AEROSPACE CONFERENCE 頁： . 2017年

Asymptotic Analysis for Hidden Markovian Process with Quantum Hidden System 査読有り国際共著

Hayashi Masahito

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

Source Coding in Quantum Systems 国際共著

Hayashi Masahito

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

Information Quantities and Parameter Estimation in Classical Systems 国際共著

Hayashi Masahito

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

Entanglement and Locality Restrictions 国際共著

Hayashi Masahito

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

Classical-Quantum Channel Coding (Message Transmission) 国際共著

Hayashi Masahito

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

Analysis of Quantum Communication Protocols 国際共著

Hayashi Masahito

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

State Evolution and Trace-Preserving Completely Positive Maps 査読有り国際共著

Hayashi Masahito

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

Quantum Measurements and State Reduction 国際共著

Hayashi Masahito

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

Quantum Information Theory Mathematical Foundation Second Edition Prologue 国際共著

Hayashi Masahito

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

Quantum Information Theory Mathematical Foundation Second Edition Preface to the Japanese Edition 国際共著

Hayashi Masahito

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

Quantum Information Theory Mathematical Foundation Second Edition Preface 国際共著

Hayashi Masahito

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

Quantum Information Geometry and Quantum Estimation 国際共著

Hayashi Masahito

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

Quantum Hypothesis Testing and Discrimination of Quantum States 国際共著

Hayashi Masahito

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

Postface to Japanese version 国際共著

Hayashi Masahito

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

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free Public Communication 査読有り国際共著

Kato Go, Owari Masaki, Hayashi Masahito

INFORMATION THEORETIC SECURITY, ICITS 2017 10681 巻頁： 166-187 2017年

Correlation detection and an operational interpretation of the Rényi mutual information 国際共著

Masahito Hayashi, Marco Tomamichel

Journal of Mathematical Physics 57 巻 ( 10 ) 頁： 102201 2016年10月

Fourier Analytic Approach to Quantum Estimation of Group Action 査読有り国際共著

Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS 347 巻 ( 1 ) 頁： 3-82 2016年10月

Optimal Compression for Identically Prepared Qubit States. 査読有り国際共著

Yang Y, Chiribella G, Hayashi M

Physical review letters 117 巻 ( 9 ) 頁： 090502 2016年8月

INFORMATION GEOMETRY APPROACH TO PARAMETER ESTIMATION IN MARKOV CHAINS 査読有り国際共著

Hayashi Masahito, Watanabe Shun

ANNALS OF STATISTICS 44 巻 ( 4 ) 頁： 1495-1535 2016年8月

Secret Key Agreement: General Capacity and Second-Order Asymptotics 査読有り国際共著

Hayashi Masahito, Tyagi Himanshu, Watanabe Shun

IEEE TRANSACTIONS ON INFORMATION THEORY 62 巻 ( 7 ) 頁： 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 査読有り国際共著

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 62 巻 ( 6 ) 頁： 3451-3476 2016年6月

Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages 査読有り国際共著

Hayashi Masahito, Matsumoto Ryutaroh

IEEE TRANSACTIONS ON INFORMATION THEORY 62 巻 ( 5 ) 頁： 2355-2409 2016年5月

Optimal decoy intensity for decoy quantum key distribution 査読有り国際共著

Hayashi Masahito

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL 49 巻 ( 16 ) 2016年4月

More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function 査読有り国際共著

Hayashi Masahito, Tsurumaru Toyohiro

IEEE TRANSACTIONS ON INFORMATION THEORY 62 巻 ( 4 ) 頁： 2213-2232 2016年4月

Uniform Random Number Generation From Markov Chains: Non-Asymptotic and Asymptotic Analyses 査読有り国際共著

Hayashi Masahito, Watanabe Shun

IEEE TRANSACTIONS ON INFORMATION THEORY 62 巻 ( 4 ) 頁： 1795-1822 2016年4月

Universal Steering Criteria. 査読有り国際共著

Zhu H, Hayashi M, Chen L

Physical review letters 116 巻 ( 7 ) 頁： 070403 2016年2月

情報理論における量子情報理論の役割国際共著

林正人

電子情報通信学会基礎・境界ソサイエティ Fundamentals Review 10 巻 ( 1 ) 頁： 4 - 13 2016年

記述言語：日本語掲載種別：研究論文（学術雑誌）出版者・発行元：一般社団法人電子情報通信学会

近年の情報理論の発展の背景には，量子情報理論の成果がある．本稿ではそのような情報理論に対する量子情報理論の影響に注目し，これまで情報理論の発展に対して量子情報理論が果たしてきた役割について解説する．これにより，近年の量子情報理論の成果がその分野内に閉じたものでないことを説明する．

DOI： 10.1587/essfr.10.1_4

Operational Interpretation of Renyi Conditional Mutual Information via Composite Hypothesis Testing Against Markov Distributions 査読有り国際共著

Tomamichel Marco, Hayashi Masahito

2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY 頁： 585-589 2016年

Remaining Uncertainties and Exponents under Renyi Information Measures 査読有り国際共著

Hayashi Masahito, Tan Vincent Y. F.

2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY 頁： 1536-1540 2016年

Asymmetric Evaluations of Erasure and Undetected Error Probabilities 査読有り国際共著

Hayashi Masahito, Tan Vincent Y. F.

IEEE TRANSACTIONS ON INFORMATION THEORY 61 巻 ( 12 ) 頁： 6560-6577 2015年12月

Local Hypothesis Testing Between a Pure Bipartite State and the White Noise State 査読有り国際共著

Owari Masaki, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 61 巻 ( 12 ) 頁： 6995-7011 2015年12月

Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing. 査読有り国際共著

Hayashi M, Morimae T

Physical review letters 115 巻 ( 22 ) 頁： 220502 2015年11月

Asymptotic compatibility between local-operations-and-classical-communication conversion and recovery 査読有り国際共著

Ito Kosuke, Kumagai Wataru, Hayashi Masahito

PHYSICAL REVIEW A 92 巻 ( 5 ) 2015年11月

QUANTUM MERLIN-ARTHUR WITH CLIFFORD ARTHUR 査読有り国際共著

Morimae Tomoyuki, Hayashi Masahito, Nishimura Harumichi, Fujii Keisuke

QUANTUM INFORMATION & COMPUTATION 15 巻 ( 15-16 ) 頁： 1420-1430 2015年11月

Error-Control Coding for Physical-Layer Secrecy 査読有り国際共著

Bloch Matthieu, Hayashi Masahito, Thangaraj Andrew

PROCEEDINGS OF THE IEEE 103 巻 ( 10 ) 頁： 1725-1746 2015年10月

Quantum Wiretap Channel With Non-Uniform Random Number and Its Exponent and Equivocation Rate of Leaked Information 査読有り国際共著

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 61 巻 ( 10 ) 頁： 5595-5622 2015年10月

Precise Evaluation of Leaked Information with Secure Randomness Extraction in the Presence of Quantum Attacker 査読有り国際共著

Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS 333 巻 ( 1 ) 頁： 335-350 2015年1月

21aAJ-7 熱力学的操作の観測プロセスとしての再定式化査読有り国際共著

Tajima H., Hayashi M.

日本物理学会講演概要集 70.1 巻 ( 0 ) 頁： 2811 2015年

17aCX-8 強い大偏差理論に基づく量子熱機関の最適効率の導出査読有り国際共著

Tajima H., Hayashi M.

日本物理学会講演概要集 70.2 巻 ( 0 ) 頁： 2648 2015年

Correlation Detection and an Operational Interpretation of the Renyi Mutual Information 査読有り国際共著

Hayashi Masahito, Tomamichel Marco

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

Erasure and Undetected Error Probabilities in the Moderate Deviations Regime 査読有り国際共著

Hayashi Masahito, Tan Vincent Y. F.

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

Equivocations and Exponents under Various Renyi Information Measures 査読有り国際共著

Hayashi Masahito, Tan Vincent Y. F.

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

More Efficient Privacy Amplification with Less Random Seeds 査読有り国際共著

Hayashi Masahito, Tsurumaru Toyohiro

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

Tight asymptotic bounds on local hypothesis testing between a pure bipartite state and the white noise state 査読有り国際共著

Hayashi Masahito, Owari Masaki

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

Large Deviation Analysis for Quantum Security via Smoothing of Renyi Entropy of Order 2 査読有り国際共著

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 60 巻 ( 10 ) 頁： 6702-6732 2014年10月

Asymptotic local hypothesis testing between a pure bipartite state and the completely mixed state 査読有り国際共著

Owari Masaki, Hayashi Masahito

PHYSICAL REVIEW A 90 巻 ( 3 ) 2014年9月

AT-2-1 秘密一様乱数生成,情報源圧縮における有限長理論(AT-2.有限長解析(情報理論から暗号,通信,量子への展開),チュートリアルセッション,ソサイエティ企画) 招待有り国際共著

林正人

電子情報通信学会ソサイエティ大会講演論文集 2014 巻頁： "SS-21"-"SS-24" 2014年9月

Relating different quantum generalizations of the conditional Renyi entropy 査読有り国際共著

Tomamichel Marco, Berta Mario, Hayashi Masahito

JOURNAL OF MATHEMATICAL PHYSICS 55 巻 ( 8 ) 2014年8月

Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths 査読有り国際共著

Hayashi Masahito, Nakayama Ryota

NEW JOURNAL OF PHYSICS 16 巻 2014年6月

Random Number Conversion via Restricted Storage 査読有り国際共著

Kumagai Wataru, Hayashi Masahito

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

Secret Key Agreement: General Capacity and Second-Order Asymptotics 査読有り国際共著

Hayashi Masahito, Tyagi Himanshu, Watanabe Shun

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

Information Geometry Approach to Parameter Estimation in Markov Chains 査読有り国際共著

Hayashi Masahito, Watanabe Shun

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

Asymptotic Reversibility of LOCC Conversions 査読有り国際共著

Ito Kosuke, Kumagai Wataru, Hayashi Masahito

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

A duality relation connecting different quantum generalizations of the conditional Renyi entropy 査読有り国際共著

Tomamichel Marco, Berta Mario, Hayashi Masahito

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

Moderate deviations for joint source-channel coding of systems with Markovian memory 査読有り国際共著

Tan V.

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

Finite-length Analysis on Tail probability and Simple Hypothesis Testing for Markov Chain 査読有り国際共著

Watanabe Shun, Hayashi Masahito

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

Finite-length analysis for secret random number generation and coding theorems 査読有り国際共著

Hayashi Masahito

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

Non-Asymptotic and Asymptotic Analyses on Markov Chains in Several Problems 査読有り国際共著

Hayashi Masahito, Watanabe Shun

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

Universal channel coding with continuous output system 査読有り国際共著

Hayashi Masahito

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

Strong Converse for a Degraded Wiretap Channel via Active Hypothesis Testing 査読有り国際共著

Hayashi Masahito, Tyagi Himanshu, Watanabe Shun

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

Strong converse and second-order asymptotics of channel resolvability 査読有り国際共著

Watanabe S.

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

Tight Exponential Analysis of Universally Composable Privacy Amplification and Its Applications 査読有り国際共著

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 59 巻 ( 11 ) 頁： 7728-7746 2013年11月

A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks 査読有り国際共著

Tomamichel Marco, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 59 巻 ( 11 ) 頁： 7693-7710 2013年11月

Entanglement concentration is irreversible. 査読有り国際共著

Kumagai W, Hayashi M

Physical review letters 111 巻 ( 13 ) 頁： 130407 2013年9月

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

坂口文則, 林正人

数理解析研究所講究録 ( 1848 ) 頁： 132 - 146 2013年8月

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

坂口文則, 林正人

数理解析研究所講究録 1848 巻頁： 132 - 146 2013年8月

Dual Universality of Hash Functions and Its Applications to Quantum Cryptography 査読有り国際共著

Tsurumaru Toyohiro, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 59 巻 ( 7 ) 頁： 4700-4717 2013年7月

Quantum Hypothesis Testing for Gaussian States: Quantum Analogues of chi(2), t-, and F-Tests 査読有り国際共著

Kumagai Wataru, Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS 318 巻 ( 2 ) 頁： 535-574 2013年3月

Second Order Asymptotics for Random Number Generation 査読有り国際共著

Kumagai Wataru, Hayashi Masahito

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

Non-Asymptotic Bounds on Fixed Length Source Coding for Markov Chains 査読有り国際共著

Hayashi Masahito, Watanabe Shun

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

NONDISTILLABLE ENTANGLEMENT GUARANTEES DISTILLABLE ENTANGLEMENT 国際共著

LIN CHEN, MASAHITO HAYASHI

International Journal of Modern Physics B 26 巻 ( 27n28 ) 頁： 1243008 2012年9月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：World Scientific Pub Co Pte Lt

<jats:p> The monogamy of entanglement is one of the basic quantum mechanical features, which says that when two partners Alice and Bob are more entangled then either of them has to be less entangled with the third party. Here we qualitatively present the converse monogamy of entanglement: given a tripartite pure system and when Alice and Bob are entangled and nondistillable, then either of them is distillable with the third party. Our result leads to the classification of tripartite pure states based on bipartite reduced density operators, which is a novel and effective way to this long-standing problem compared to the means by stochastic local operations and classical communications. Furthermore we systematically indicate the structure of the classified states and generate them. We also extend our results to multipartite states. </jats:p>

DOI： 10.1142/s0217979212430084

Concise and tight security analysis of the Bennett-Brassard 1984 protocol with finite key lengths 査読有り国際共著

Hayashi Masahito, Tsurumaru Toyohiro

NEW JOURNAL OF PHYSICS 14 巻 2012年9月

Precise evaluation of leaked information with universal(2) privacy amplification in the presence of quantum attacker 国際共著

Hayashi Masahito

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

Quantum wiretap channel with non-uniform random number and its exponent of leaked information 査読有り国際共著

Hayashi Masahito

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

情報スペクトルによる二次オーダーの情報理論国際共著

林正人

電子情報通信学会基礎・境界ソサイエティ Fundamentals Review 6 巻 ( 1 ) 頁： 12 - 25 2012年

記述言語：日本語掲載種別：研究論文（学術雑誌）出版者・発行元：一般社団法人電子情報通信学会

情報理論における二次の漸近論を，情報スペクトルの手法を通じて解説する．情報スペクトルの手法の持つ普遍性により，固定長情報源圧縮，一様乱数生成，通信路符号化の三つのテーマの二次の漸近論を統一的視点で扱う．更に，量子暗号や情報源符号化伝承，情報理論的セキュリティへの応用についても触れる．

DOI： 10.1587/essfr.6.12

Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages 査読有り国際共著

Hayashi Masahito, Matsumoto Ryutaroh

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

Large deviation theory for non-regular location shift family 査読有り国際共著

Hayashi Masahito

ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS 63 巻 ( 4 ) 頁： 689-716 2011年8月

Weaker entanglement between two parties guarantees stronger entanglement with a third party 査読有り国際共著

Hayashi Masahito, Chen Lin

PHYSICAL REVIEW A 84 巻 ( 1 ) 頁： 012325 2011年7月

Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification 査読有り国際共著

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 57 巻 ( 6 ) 頁： 3989-4001 2011年6月

Comparison Between the Cramer-Rao and the Mini-max Approaches in Quantum Channel Estimation 査読有り国際共著

Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS 304 巻 ( 3 ) 頁： 689-709 2011年6月

Discrimination of the change point in a quantum setting 査読有り国際共著

Akimoto Daiki, Hayashi Masahito

PHYSICAL REVIEW A 83 巻 ( 5 ) 頁： 052328 2011年5月

光子個数制約の下での位相推定査読有り国際共著

林正人

Progress in informatics ( 8 ) 頁： 81 - 87 2011年3月

掲載種別：研究論文（学術雑誌）出版者・発行元：国立情報学研究所

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

Multicopy and stochastic transformation of multipartite pure states 査読有り国際共著

Chen Lin, Hayashi Masahito

PHYSICAL REVIEW A 83 巻 ( 2 ) 頁： 022331 2011年2月

Dual universality of hash functions and its applications to quantum cryptography (ワイドバンドシステム・情報通信基礎サブソサイエティ合同研究会) 査読有り国際共著

鶴丸豊広, 林正人

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

掲載種別：研究論文（学術雑誌）出版者・発行元：一般社団法人電子情報通信学会

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 (情報理論・情報通信基礎サブソサイエティ合同研究会) 査読有り国際共著

鶴丸豊広, 林正人

電子情報通信学会技術研究報告. IT, 情報理論 110 巻 ( 442 ) 頁： 295 - 302 2011年2月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：一般社団法人電子情報通信学会

Universally Attainable Error and Information Exponents, and Equivocation Rate for the Broadcast Channels with Confidential Messages 査読有り国際共著

Forty-Ninth Annual Allerton Conference 頁： . 2011年

GENERAL THEORY FOR INTEGER-TYPE ALGORITHM FOR HIGHER ORDER DIFFERENTIAL EQUATIONS 査読有り国際共著

Sakaguchi Fuminori, Hayashi Masahito

NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION 32 巻 ( 5 ) 頁： 541-582 2011年

Phase estimation with photon number constraint 査読有り国際共著

Masahito HAYASHI

Progress of Informatics ( 8 ) 頁： 81-87 2011年

Secure Multiplex Network Coding 査読有り国際共著

Matsumoto, Ryutaroh, Hayashi, Masahito,

2011 International Symposium on Network Coding (NetCod) 2011年

Secure Multiplex Coding with a Common Message 査読有り国際共著

Matsumoto Ryutaroh, Hayashi Masahito

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

PRACTICAL IMPLEMENTATION AND ERROR BOUND OF INTEGER-TYPE ALGORITHM FOR HIGHER-ORDER DIFFERENTIAL EQUATIONS 査読有り国際共著

Sakaguchi Fuminori, Hayashi Masahito

NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION 32 巻 ( 12 ) 頁： 1316-1364 2011年

Weaker entanglement between two parties guarantees stronger entanglement with a third party 査読有り国際共著

林正人

Physical Beview A 84 巻頁： 12325 2011年

Weaker entanglement between two parties guarantees stronger entanglement with a third party 査読有り国際共著

林正人

Physical Review A Vol, 84 巻頁： 12325 2011年

Comparison between the Cramer-Rao and the mini-max approaches in quantum channel estimation 査読有り国際共著

林正人

Communications in Mathematical Physics 304 巻頁： 689 - 709 2011年

Practical Implementation and Error Bound of Integer-Type Algorithm for Higher-Order Differential Equations 査読有り国際共著

林正人

Numerical Functional Analysis and Optimization 32 巻頁： 1316 - 1364 2011年

Phase estimation with photon number constraint," Progress of Informatics 査読有り国際共著

林正人

Progress of Informatics 8 巻頁： 81 - 87 2011年

Multi-copy and stochastic transformation of multipartite pure states 査読有り国際共著

林正人

Physical Review A Vol.83 巻頁： 22331 2011年

General theory for integer-type algorithm for higher order differential equations 査読有り国際共著

林正人

Numerical Functional Analysis and Optimization 32 巻頁： 541 - 582 2011年

Exponential decreasing rate of leaked information in universal random privacy amplification 査読有り国際共著

林正人

IEEE Transactions on Information Theory 57 巻頁： 3989 - 4001 2011年

Discrimination of the change point in a quantum setting 査読有り国際共著

林正人

Physical Review A 83 巻頁： 52328 2011年

Additivity and non-additivity of multipartite entanglement measures 査読有り国際共著

Zhu Huangjun, Chen Lin, Hayashi Masahito

NEW JOURNAL OF PHYSICS 12 巻頁： 083002- 2010年8月

Capacity With Energy Constraint in Coherent State Channel 査読有り国際共著

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 57 巻 ( 8 ) 頁： 4071-4079 2010年8月

Unitary-process discrimination with error margin 査読有り国際共著

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

PHYSICAL REVIEW A 81 巻 ( 6 ) 頁： 062327 2010年6月

Limiting behavior of relative R,nyi entropy in a non-regular location shift family 査読有り国際共著

Hayashi Masahito

ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS 62 巻 ( 3 ) 頁： 547-569 2010年6月

Universal Approximation of Multi-copy States and Universal Quantum Lossless Data Compression 査読有り国際共著

Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS 293 巻 ( 1 ) 頁： 171-183 2010年1月

Two Non-Regular Extensions of Large Deviation Bound 査読有り国際共著

Hayashi Masahito

COMMUNICATIONS IN STATISTICS-THEORY AND METHODS 39 巻 ( 8-9 ) 頁： 1404-1423 2010年

Construction of wiretap codes from ordinary channel codes 査読有り国際共著

M. Hayashi and R. Matsumoto

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

Universal approximation of multi-copy states and universal quantum lossless data compression 査読有り国際共著

林正人

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

Two non-regular extensions of large deviation bound 査読有り国際共著

林正人

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

The geometric measure of entanglement for a symmetric pure state with non-negative amplitudes 査読有り

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

JOURNAL OF MATHEMATICAL PHYSICS 50 巻 ( 12 ) 頁： 122104 2009年12月

Information Spectrum Approach to Second-Order Coding Rate in Channel Coding 査読有り

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 55 巻 ( 11 ) 頁： 4947-4966 2009年11月

Quantum hypothesis testing with group symmetry 査読有り

Hiai Fumio, Mosonyi Milan, Hayashi Masahito

JOURNAL OF MATHEMATICAL PHYSICS 50 巻 ( 10 ) 頁： 103304 2009年10月

Universal Coding for Classical-Quantum Channel 査読有り

Hayashi Masahito

COMMUNICATIONS IN MATHEMATICAL PHYSICS 289 巻 ( 3 ) 頁： 1087-1098 2009年8月

Discrimination of Two Channels by Adaptive Methods and Its Application to Quantum System 査読有り

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 55 巻 ( 8 ) 頁： 3807-3820 2009年8月

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

林正人

電子情報通信学会技術研究報告. IT, 情報理論 109 巻 ( 143 ) 頁： 115 - 120 2009年7月

掲載種別：研究論文（学術雑誌）出版者・発行元：一般社団法人電子情報通信学会

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 査読有り

Hayashi Masahito

NEW JOURNAL OF PHYSICS 11 巻 2009年4月

Fourier analytic approach to phase estimation in quantum systems 査読有り

Imai Hiroshi, Hayashi Masahito

NEW JOURNAL OF PHYSICS 11 巻 ( 4 ) 頁： 043034- 2009年4月

Optimal ratio between phase basis and bit basis in quantum key distributions 査読有り

Hayashi Masahito

PHYSICAL REVIEW A 79 巻 ( 2 ) 2009年2月

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

Hayashi Masahito

PHYSICAL REVIEW A 79 巻 ( 1 ) 2009年1月

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

林正人

電子情報通信学会基礎・境界ソサイエティ Fundamentals Review 3 巻 ( 1 ) 頁： 44 - 56 2009年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：一般社団法人電子情報通信学会

近年の電子情報通信に関するデバイス技術の進化にしたがって，物理層の奥深くまで踏み込んだ情報処理が可能になりつつある．このような事情から，究極の情報処理理論として量子情報理論が定式化され，様々なバックグラウンドを持った研究者の努力により急激に進展した．しかしながら，量子情報理論では，これまでブラックボックスとして扱っていた部分に踏み込んで情報処理理論を展開するので，基本的概念の理解のレベルでさえ様々な参入障壁がある．本稿では，これらの障壁を取り除くため，初学者が誤解しやすい点や概念に重点を絞って解説する．例えば，波動関数と密度行列の違い，物理量とPOVM，状態複製と状態準備の違いなどについて丁寧に触れる．同時に，量子情報理論の最近の研究動向を解説する．具体的には状態識別，量子通信路符号化，量子鍵配送などの最新に成果にも触れる．

DOI： 10.1587/essfr.3.1_44

29pTB-1 「情報」を通して見る量子力学(29pTB 領域11,領域1合同シンポジウム:「情報」を通して見る量子力学,領域11(統計力学,物性基礎論,応用数学,力学,流体物理)) 査読有り

林正人

日本物理学会講演概要集 64.1.2 巻 ( 0 ) 頁： 306 2009年

Universal coding for classical-quantum channel 査読有り

林正人

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

量子情報理論とその難しさ査読有り

林正人

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

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

林正人

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

Optimal ratio between phase basis and bit basis in quantum key distribution 査読有り

林正人

Physical Review A 79 頁： 20303 2009年

Large deviation theory for non-regular location shift family 査読有り

林正人

Annals of the Institute of Statistical Mathematics 2009年

Information Spectrum Approach to Second-Order Coding Rate in Channel Coding 査読有り

林正人

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

Group theoretical study of LOCC-detection of maximally entangled state using hypothesis testing 査読有り

林正人

New Journal of Physics 11 No.4 頁： 43028 2009年

Discrimination of two channels by adaptive methods and its application to quantum system 査読有り

林正人

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

Capacity with energy constraint in coherent state channel 査読有り

林正人

IEEE Transactions on Information Theory 2009年

Asymptotic performance of optimal state estimation in qubit system 査読有り

Hayashi Masahito, Matsumoto Keiji

JOURNAL OF MATHEMATICAL PHYSICS 49 巻 ( 10 ) 2008年10月

Second-order asymptotics in fixed-length source coding and intrinsic randomness 査読有り

Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 54 巻 ( 10 ) 頁： 4619-4637 2008年10月

AK-1-3 量子情報スペクトルの考え方とその応用(AK-1.情報スペクトル理論とその周辺,ソサイエティ特別企画,ソサイエティ企画) 査読有り

林正人

電子情報通信学会ソサイエティ大会講演論文集 2008 巻頁： "SS - 4"-"SS-6" 2008年9月

Information extraction versus irreversibility in quantum measurement processes 査読有り

Buscemi Francesco, Hayashi Masahito, Horodecki Michal

INTERNATIONAL JOURNAL OF QUANTUM INFORMATION 6 巻頁： 613-619 2008年7月

Global information balance in quantum measurements. 査読有り

Buscemi F, Hayashi M, Horodecki M

Physical review letters 100 巻 ( 21 ) 頁： 210504 2008年5月

Statistical analysis of testing of an entangled state based on the Poisson distribution framework 査読有り

Hayashi Masahito, Tomita Akihisa, Matsumoto Keiji

NEW JOURNAL OF PHYSICS 10 巻頁： 043029- 2008年4月

Quantum measurements for hidden subgroup problems with optimal sample complexity 査読有り

Hayashi M.

Quantum Information and Computation 8 巻 ( 3-4 ) 頁： 345-358 2008年3月

Two-way classical communication remarkably improves local distinguishability 査読有り

Owari Masaki, Hayashi Masahito

NEW JOURNAL OF PHYSICS 10 巻頁： 013006- 2008年1月

Entanglement of multiparty stabilizer, symmetric, and antisymmetric states 査読有り

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

Physical Review A 77 巻 ( 1,Pt.A ) 頁： 012104 2008年

Statistical analysis of testing of an entangled state based on the Poisson distribution framework 査読有り

林正人

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

Quantum measurements for hidden subgroup problems with optimal sample complexity 査読有り

林正人

Quantum Information and Computation 8 頁： 345 - 358 2008年

Asymptotic performance of optimal state estimation in qubit system 査読有り

林正人

Journal of Mathematical Physics 49 頁： 102101 2008年

Second-order asymptotics in channel capacity 査読有り

林正人

信学技法 IT2008-5 頁： 23 - 28 2008年

Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness 査読有り

林正人

IEEE Transaction on Information Theory 54 頁： 4619 - 4637 2008年

Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding 査読有り

Hayashi Masahito

PHYSICAL REVIEW A 76 巻 ( 6 ) 頁： 062301 2007年12月

General theory for decoy-state quantum key distribution with an arbitrary number of intensities 査読有り

Hayashi Masahito

NEW JOURNAL OF PHYSICS 9 巻頁： 284- 2007年8月

Universal distortion-free entanglement concentration 査読有り

Matsumoto Keiji, Hayashi Masahito

PHYSICAL REVIEW A 75 巻 ( 6 ) 頁： 062338 2007年6月

An information-spectrum approach to classical and quantum hypothesis testing for simple hypotheses 査読有り

Nagaoka Hiroshi, Hayashi Masahito

IEEE TRANSACTIONS ON INFORMATION THEORY 53 巻 ( 2 ) 頁： 534-549 2007年2月

Upper bounds of eavesdropper's performances in finite-length code with the decoy method 査読有り

M Hayashi

Physical Review A 76 巻 ( 1,Pt.A ) 頁： 012329 2007年

19pXG-2 デコイ法を用いた量子鍵配送の改良とその安全性解析(量子エレクトロニクス(量子情報),領域1,原子・分子,量子エレクトロニクス,放射線物理) 査読有り

林正人, 富田章久, 廣嶋透也, 長谷川淳

日本物理学会講演概要集 62.1.2 巻 ( 0 ) 頁： 144 2007年

A general entropic approach to the information-disturbance tradeoff problem in quantum measurements 査読有り

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

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

General theory for decoy-state QKD with arbitrary number of intensities 査読有り

M. Hayashi

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

Prior entanglement between senders enables perfect quantum network coding 査読有り

M. Hayashi

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

Security analysis and experiment of decoy state quantum key distribution incorporating finite statistics 査読有り

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

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

Quantum network coding 査読有り

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

STACS 2007, PROCEEDINGS 4393 巻頁： 610-+ 2007年

Quantum information with Gaussian states 査読有り

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

Physics Reports 448 巻 ( 1-4 ) 頁： 1-111 2007年

Prior entanglement between senders enables perfect quantum network coding with modification 査読有り

M Hayashi

Phys. Rev. A 76 巻 ( 4,Pt.A ) 頁： 040301 2007年

21pWA-2 情報符号化における量子・古典対応(シンポジウム量子系におけるコトの物理学,領域11,統計力学,物性基礎論,応用数学,力学,流体物理) 査読有り

林正人

日本物理学会講演概要集 62.1.2 巻 ( 0 ) 頁： 316 2007年

Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding 査読有り

林正人

Physical Review A 76 頁： 62301 2007年

Parallel treatment of estimation of SU(2) and phase estimation 査読有り

Hayashi Masahito

PHYSICS LETTERS A 354 巻 ( 3 ) 頁： 183-189 2006年5月

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

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

電子情報通信学会技術研究報告. COMP, コンピュテーション 106 巻 ( 63 ) 頁： 33-38 2006年5月

記述言語：英語

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)-量子ランダムアクセス符号の存在は未解決であった.この論文ではこの未解決問題に対する否定的回答を与える.

量子ネットワーク上での効率的な情報の伝送(計算理論とアルゴリズムの新展開) 査読有り

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

数理解析研究所講究録 1489 巻 ( 1489 ) 頁： 128 - 134 2006年5月

General formulas for fixed-length quantum entanglement concentration 査読有り

Hayashi M

IEEE TRANSACTIONS ON INFORMATION THEORY 52 巻 ( 5 ) 頁： 1904 - 1921 2006年5月

(4,1)-Quantum Random Access Coding Does Not Exist 査読有り

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

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

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

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

New J. Phys. 8 巻 ( 129 ) 頁： 1-11 2006年

A study of LOCC-detection of a maximally entangled state using hypothesis testing 査読有り

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

Journal of Physics A: Mathematical and General 39 巻頁： 14427-14446 2006年

Local copying and local discrimination as a study for non-locality of a set 査読有り

M. Owari, and M. Hayashi

Physical Review A 74 巻 ( 3,Pt.A ) 頁： 032108 2006年

Hypothesis testing for an entangled state produced by spontaneous parametric down conversion 査読有り

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

Physical Review A 74 巻 ( 6,Pt.A ) 頁： 062321 2006年

General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and its application to wire-tap channel 査読有り

M Hayashi

IEEE Transactions on Information Theory 52 巻 ( 4 ) 頁： 1562-1575 2006年

Characterization of several kinds of quantum analogues of relative entropy 査読有り

M Hayashi

Quantum Information and Computation 6 巻 ( 7 ) 頁： 583-596 2006年

Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication 査読有り

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

Phys. Rev. Lett 96 巻頁： 040501- 2006年

Optimal Visible Compression Rate For Mixed States Is Determined By Entanglement Purification 査読有り

M Hayashi

Physical Review A 73 巻 ( 6,Pt.A ) 頁： 060301 2006年

Practical Evaluation of Security for Quantum Key Distribution 査読有り

M Hayashi

Physical Review A 74 巻 ( 2,Pt.A ) 頁： 022307 2006年

Practical Evaluation of Security for Quantum Key Distribution 査読有り

M. Hayashi

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

量子2準位系での固有値推定での量子効果査読有り

林正人

情報処理学会論文誌 46 巻 ( 10 ) 頁： 2447 - 2464 2005年10月

掲載種別：研究論文（学術雑誌）出版者・発行元：一般社団法人情報処理学会

量子2準位系での状態の密度行列の固有値を推定する問題を，まったくエンタングルメントを用いない測定による推定と，2つの系間の相関を用いた測定による推定とを比較する．その結果，純粋状態に近い場合については，Hendrychら(2003)が行った量子相関を用いた実験による推定が，ある種のまったく相関を用いない場合での最適な実験による推定よりもより高い精度を与えることを示した．Hendrychらの実験では推定精度について十分に検討していなかったが，改めて，推定精度に注意して同種の実験を行えば，量子相関による推定精度の向上を，実験的に実証できることと思われる．Concerning the estimation problem of the eigen-value of the density in the quantum twolevel 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.

純粋状態推定についての二次の漸近論について(<小特集>量子情報工学論文) 査読有り

林正人

電子情報通信学会論文誌. A, 基礎・境界 88 巻 ( 8 ) 頁： 903 - 916 2005年8月

掲載種別：研究論文（学術雑誌）出版者・発行元：一般社団法人電子情報通信学会

スピンコヒーレント状態族, ボゾンコヒーレント状態族, su(1, 1)コヒーレント状態族の三つの純粋状態族に注目し, 二次の漸近理論を展開する. その結果, 二次の推定効率とスカラ曲率との間に一定の関係があることが分かった.

Hypotheses testing for maximally entangled state (Statistical Inference of Records and Related Statistics) 査読有り

林正人

数理解析研究所講究録 ( 1439 ) 頁： 225 - 240 2005年7月

Local Discrimination and multipartite entanglement measures 査読有り

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

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

Qubit channels which require four inputs to achieve capacity: Implications for additivity conjectures 査読有り

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

Quantum information and computation 5 巻 ( 1 ) 頁： 13-31 2005年

The relationship between local copying and local discrimination 査読有り

M. Owari and M. Hayashi

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

Intrinsic randomness based on KL-divergence criterion

HAYASHI Masahito

27 巻 ( 1 ) 頁： 69-72 2004年12月

情報源固定長符号化と一様乱数生成における2次の漸近論

林正人

情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications 27 巻 ( 1 ) 頁： 65-68 2004年12月

Estimation of SU(2) action by using entanglement 査読有り

M. Hayashi

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

Hypothesis testing for entanglement 査読有り

Y. Tsuda, M. Hayashi and K. Matsumoto

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

General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity 査読有り

M. Hayashi

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

Finding a maximally correlated state -- Simultaneous Schmidt decomposition of bipartite pure states 査読有り

T. Hiroshima and M. Hayashi

Physical Review A 70 巻 ( 3 ) 頁： 030302 2004年

Finding a maximally correlated state -- Simultaneous Schmidt decomposition of bipartite pure states 査読有り

T. Hiroshima and M. Hayashi

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

Exponents of channel resolvability and wire-tapped channel 査読有り

M. Hayashi

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

Estimation of SU(2) action by using entanglement 査読有り

M. Hayashi

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

On error exponents in quantum hypothesis testing 査読有り

T. Ogawa and M. Hayashi

IEEE Transactions on Information Theory 50 巻 ( 6 ) 頁： 1368-1372 2004年

Universal distortion-free entanglement concentration 査読有り

K. Matsumoto and M. Hayashi

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

Qubit channels which require four inputs to achieve capacity: Implications for additivity conjectures 査読有り

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

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

15aTF-1 Finding a Maximally Correlated State 査読有り

廣嶋透也, 林正人

日本物理学会講演概要集 59.2.2 巻 ( 0 ) 頁： 130 2004年

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

林正人

物性研究 80 巻 ( 5 ) 頁： 662 - 699 2003年8月

記述言語：日本語掲載種別：研究論文（学術雑誌）出版者・発行元：物性研究刊行会

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

9pXE-11 エンタングルメント凝縮における誤り指数(量子エレクトロニクス(量子情報),領域1) 査読有り

General formulas for capacity of classical-quantum channels 査読有り

Hayashi M, Nagaoka H

IEEE TRANSACTIONS ON INFORMATION THEORY 49 巻 ( 7 ) 頁： 1753-1768 2003年7月

Error exponents for entanglement concentration 査読有り

M. Hayashi, M. Koashi, K. Matsumoto, F. Morikoshi, and A. Winter

Journal of Physics A: Mathematical and General 36 巻 ( 2 ) 頁： 527-553 2003年

General asymptotic formulas for fixed-length quantum entanglement concentration 査読有り

M. Hayashi

Proceedings of the International Symposium on Information Theory 2003 (ISIT2003) 頁： 431- 2003年

On error exponents in quantum hypothesis testing 査読有り

T. Ogawa and M. Hayashi

Proceedings of the International Symposium on Information Theory 2003 (ISIT2003) 頁： 479- 2003年

Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing 査読有り

Hayashi M

JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL 35 巻 ( 50 ) 頁： 10759-10773 2002年12月

Simple construction of quantum universal variable-length source coding 査読有り

Hayashi M, Matsumoto K

QUANTUM INFORMATION & COMPUTATION 2 巻頁： 519-529 2002年12月

Two quantum analogues of Fisher information from a large deviation viewpoint of quantum estimation 査読有り

Hayashi M

JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL 35 巻 ( 36 ) 頁： 7689-7727 2002年9月

Exponents of quantum fixed-length pure-state source coding 査読有り

Hayashi M

PHYSICAL REVIEW A 66 巻 ( 3 ) 頁： 032321 2002年9月

量子系の統計的推測 : 理論と応用招待有り査読有り

林正人

電子情報通信学会誌 85 巻 ( 8 ) 頁： 600-605 2002年8月

記述言語：日本語

量子系での統計的推測の適用し得る可能性について述べ,その定式化,及び,最も簡単なモデルである量子ガウス状態の推定を例にとって,推定精度の限界についても考察する.更に,実際の量子系での実験にこの理論を適用した場合の問題についても考察する.この枠組みでなされた宇佐見らの二光子偏光状態を用いた実験を紹介する.

A general formula for the classical capacity of a general quantum channel 査読有り

M. Hayashi and H. Nagaoka

Proceedings of the International Symposium on Information Theory 2002 (ISIT2002) 頁： 71- 2002年

Error exponents for entanglement concentration 査読有り

F. Morikoshi, M. Hayashi, M. Koashi, K. Matsumoto, and A. Winter

ERATO Workshop on Quantum Information Science 2002 (EQIS2002) 頁： 46-47 2002年

Coherent states and anihilation-creation operators associated with the irreducible unitary representations of su(1,1) 査読有り

F. Sakaguchi and M. Hayashi

Journal of Mathematical Physics 43 巻 ( 5 ) 頁： 2241-2248 2002年

Quantum universal variable-length source coding 査読有り

M. Hayashi and K. Matsumoto

ERATO Workshop on Quantum Information Science 2002 (EQIS2002) 頁： 31-32 2002年

Simple construction of quantum universal variable-length coding 査読有り

M. Hayashi and K. Matsumoto

Quantum Information and Computation 2 巻頁： 519-529 2002年

Quantum universal variable-length source coding 査読有り

M. Hayashi and K. Matsumoto

Physical Review A 66 巻 ( 2 ) 頁： 022311 2002年

森越文明, 林正人, 小芦雅斗, 松本啓史

日本物理学会講演概要集 57.2.2 巻 ( 0 ) 頁： 143 2002年

一般情報源の仮説検定及び情報源固定長符号化での正しい確率の指数

林正人, 長岡浩司

情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications 24 巻 ( 2 ) 頁： 493-496 2001年12月

一般量子情報源における量子仮説検定

林正人

情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications 24 巻 ( 2 ) 頁： 591-594 2001年12月

Asymptotics of quantum relative entropy from a representation theoretical viewpoint 査読有り

Hayashi M

JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL 34 巻 ( 16 ) 頁： 3413-3419 2001年4月

su(1,1)-コヒーレント状態としてのコーシー・ウェーブレット : それに関連した生成消滅関係とInteracting Fock Spaceの関係(第8回「非平衡系の統計物理」シンポジウム,研究会報告) 査読有り

坂口文則, 林正人

物性研究 75 巻 ( 5 ) 頁： 964 - 972 2001年2月

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：物性研究刊行会

アフィン群のコビーレント状態に関係があるある種の生成消滅関係は、アフィン群の既約ユニタリ表現の2つの生成子にさらにもう一つ生成子を追加することにより、代数su(1,1)の既約ユニタリ表現の生成消滅関係として解釈できる。この関係により、信号処理の分野で用いられるコーシー・ウェーブレットは、代数su(1,1)のコヒーレント状態であると解釈できる。