arXiv subjects

Hiroyuki Endo

Publications and source records attributed to Hiroyuki Endo.

4 recordsLinked to original sources

arXiv2018

From Linear to Nonlinear Responses of Thermal Pure Quantum States

We propose a self-validating scheme to calculate the unbiased responses of quantum many-body systems to external fields of arbibraty strength at any temperature. By switching on a specified field to a thermal pure quantum state of an isolated system, and tracking its time evolution, one can observe an intrinsic thermalization process driven solely by many-body effects. The transient behavior before thermalization contains rich information on excited states, giving the linear and nonlinear response functions at all frequencies. We uncover the necessary conditions to clarify the applicability of this formalism, supported by a proper definition of the nonlinear response function. The accuracy of the protocol is guaranteed by a rigorous upper bound of error exponentially decreasing with system size, and is well implemented in the simple ferromagnetic Heisenberg chain, whose response at high fields exhibits a nonlinear band deformation. We further extract the characteristic features of excitation of the spin-1/2 kagome antiferromagnet; the wavenumber-insensitive linear responses from the possible spin liquid ground state, and the significantly broad nonlinear peaks which should be generated from numerous collisions of quasi-particles, that are beyond the perturbative description.

cond-mat.stat-mech↗

arXiv2016

Free-space optical channel estimation for physical layer security

We present experimental data on message transmission in a free-space optical (FSO) link at an eye-safe wavelength, using a testbed consisting of one sender and two receiver terminals, where the latter two are a legitimate receiver and an eavesdropper. The testbed allows us to emulate a typical scenario of physical-layer (PHY) security such as satellite-to-ground laser communications. We estimate information-theoretic metrics including secrecy rate, secrecy outage probability, and expected code lengths for given secrecy criteria based on observed channel statistics. We then discuss operation principles of secure message transmission under realistic fading conditions, and provide a guideline on a multi-layer security architecture by combining PHY security and upper-layer (algorithmic) security.

cs.IT↗

arXiv2015

Numerical Study on Secrecy Capacity and Code Length Dependence of the Performances in Optical Wiretap Channels

Secrecy issues of free-space optical links realizing information theoretically secure communications as well as high transmission rates are discussed. We numerically study secrecy communication rates of optical wiretap channel based on on-off keying modulation under typical conditions met in satellite-ground links. It is shown that under reasonable degraded conditions on a wiretapper, information theoretically secure communications should be possible in a much wider distance range than a range limit of quantum key distribution, enabling secure optical links between geostationary earth orbit satellites and ground stations with currently available technologies. We also provide the upper bounds on the decoding error probability and the leaked information to estimate a necessary code length for given required levels of performances. This result ensures that a reasonable length wiretap channel code for our proposed scheme must exist.

cs.IT↗

arXiv2014

Reliability and Secrecy Functions of the Wiretap Channel under Cost Constraint

The wiretap channel has been devised and studied first by Wyner, and subsequently extended to the case with non-degraded general wiretap channels by Csiszar and Korner. Focusing mainly on the Poisson wiretap channel with cost constraint, we newly introduce the notion of reliability and security functions as a fundamental tool to analyze and/or design the performance of an efficient wiretap channel system. Compact formulae for those functions are explicitly given for stationary memoryless wiretap channels. It is also demonstrated that, based on such a pair of reliability and security functions, we can control the tradeoff between reliability and security (usually conflicting), both with exponentially decreasing rates as block length n becomes large. Two ways to do so are given on the basis of concatenation and rate exchange. In this framework, the notion of the δ secrecy capacity is defined and shown to attain the strongest security standard among others. The maximized vs. averaged security measures is also discussed.

cs.IT↗