研究者詳細 - 林　正人

論文 - 林　正人

分割表示 388 件中 81 - 100 件目／全件表示 >>

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

Scopus

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

Scopus

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

Scopus

PubMed

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

Scopus

PubMed

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

Scopus

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

Scopus

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

Scopus

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

Scopus

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

Scopus

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

Scopus

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

Scopus

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月

　前のページ - 次のページ　

<林 正人>

論文 - 林 正人

<林　正人>

論文 - 林　正人