Searcharxiv⌕ Search

arXiv subjects

Hiroshi Nagaoka

Publications and source records attributed to Hiroshi Nagaoka.

17 recordsLinked to original sources

South Pole-Aitken basin sample Return and eXploration (SPARX) Science Definition Team Report

Sample return from South Pole-Aitken Basin (SPA) on the Moon has been recognized as the highest priority lunar science mission for well over two decades, appearing as a recommended New Frontiers class mission in the two previous Planetary Science Decadal Survey documents (2003-2012 New Frontiers, 2013-2022 Visions and Voyages), and as a prioritized mission for the Lunar Discovery and Exploration Program (LDEP) in the 2023-2032 Origins, Worlds, and Life Decadal Survey. The South Pole-Aitken basin presents the ideal target destination to test nearly 60 years of lunar science hypotheses owing to a unique combination of its size, antiquity, and location on the lunar farside. Convened by NASA in response to OWL Decadal Survey recommendations, the SPARX report provides analysis on prioritized science objectives, measurement requirements, implementation architectures, and a design reference mission for a South Pole-Aitken basin sample return mission. The mission profiles presented in this report leverage key advancements in remote surface exploration technology, the U.S. commercial space industry, and the programmatic focus on sustained human presence and exploration at the lunar south polar region. The science objectives and measurements presented in this report outline a mission that would transform lunar science, would address multiple high-level Decadal science questions at the only place in the Solar System where they can be credibly addressed, would pioneer a new paradigm for planetary surface exploration in the 21st century, would leverage the burgeoning space economy to pursue ground-breaking science on a more cost-efficient basis, and would unite robotic exploration with human exploration in a model for a future sustained lunar enterprise.

astro-ph.IM↗

Autoparallelity of Quantum Statistical Manifolds in Light of Quantum Estimation Theory

In this paper we study the autoparallelity w.r.t. the e-connection for an information-geometric structure called the SLD structure, which consists of a Riemannian metric and mutually dual e- and m-connections, induced on the manifold of strictly positive density operators. Unlike the classical information geometry, the e-connection has non-vanishing torsion, which brings various mathematical difficulties. The notion of e-autoparallel submanifolds is regarded as a quantum version of exponential families in classical statistics, which is known to be characterized as statistical models having efficient estimators (unbiased estimators uniformly achieving the equality in the Cramer-Rao inequality). As quantum extensions of this classical result, we present two different forms of estimation-theoretical characterizations of the e-autoparallel submanifolds. We also give several results on the e-autoparallelity, some of which are valid for the autoparallelity w.r.t. an affine connection in a more general geometrical situation.

quant-ph↗

The Fisher metric as a metric on the cotangent bundle

The Fisher metric on a manifold of probability distributions is usually treated as a metric on the tangent bundle. In this paper, we focus on the metric on the cotangent bundle induced from the Fisher metric with calling it the Fisher co-metric. We show that the Fisher co-metric can be defined directly without going through the Fisher metric by establishing a natural correspondence between cotangent vectors and random variables. This definition clarifies a close relation between the Fisher co-metric and the variance/covariance of random variables, whereby the Cramér-Rao inequality is trivialized. We also discuss the monotonicity and the invariance of the Fisher co-metric with respect to Markov maps, and present a theorem characterizing the co-metric by the invariance, which can be regarded as a cotangent version of Čencov's characterization theorem for the Fisher metric. The obtained theorem can also viewed as giving a characterization of the variance/covariance.

cs.IT↗

Neural Tangent Kernels and Fisher Information Matrices for Simple ReLU Networks with Random Hidden Weights

Fisher information matrices and neural tangent kernels (NTK) for 2-layer ReLU networks with random hidden weight are argued. We discuss the relation between both notions as a linear transformation and show that spectral decomposition of NTK with concrete forms of eigenfunctions with major eigenvalues. We also obtain an approximation formula of the functions presented by the 2-layer neural networks.

cs.LG↗

Asymptotic Reversibility of Thermal Operations for Interacting Quantum Spin Systems via Generalized Quantum Stein's Lemma

For quantum spin systems in any spatial dimension with a local, translation-invariant Hamiltonian, we prove that asymptotic state convertibility from a quantum state to another one by a thermodynamically feasible class of quantum dynamics, called thermal operations, is completely characterized by the Kullback-Leibler (KL) divergence rate, if the state is translation-invariant and spatially ergodic. Our proof consists of two parts and is phrased in terms of a branch of the quantum information theory called the resource theory. First, we prove that any states, for which the min and max Rényi divergences collapse approximately to a single value, can be approximately reversibly converted into one another by thermal operations with the aid of a small source of quantum coherence. Second, we prove that these divergences collapse asymptotically to the KL divergence rate for any translation-invariant ergodic state. We show this via a generalization of the quantum Stein's lemma for quantum hypothesis testing beyond independent and identically distributed (i.i.d.) situations. Our result implies that the KL divergence rate serves as a thermodynamic potential that provides a complete characterization of thermodynamic convertibility of ergodic states of quantum many-body systems in the thermodynamic limit, including out-of-equilibrium and fully quantum situations.

quant-ph↗

Coherence-variance uncertainty relation and coherence cost for quantum measurement under conservation laws

Uncertainty relations are one of the fundamental principles in physics. It began as a fundamental limitation in quantum mechanics, and today the word {\it uncertainty relation} is a generic term for various trade-off relations in nature. In this letter, we improve the Kennard-Robertson uncertainty relation, and clarify how much coherence we need to implement quantum measurement under conservation laws. Our approach systematically improves and reproduces the previous various refinements of the Kennard-Robertson inequality. As a direct consequence of our inequalities, we improve a well-known limitation of quantum measurements, the Wigner-Araki-Yanase-Ozawa theorem. This improvement gives an asymptotic equality for the necessary and sufficient amount of coherence to implement a quantum measurement with the desired accuracy under conservation laws.

quant-ph↗

Macroscopic Thermodynamic Reversibility in Quantum Many-Body Systems

The resource theory of thermal operations, an established model for small-scale thermodynamics, provides an extension of equilibrium thermodynamics to nonequilibrium situations. On a lattice of any dimension with any translation-invariant local Hamiltonian, we identify a large set of translation-invariant states that can be reversibly converted to and from the thermal state with thermal operations and a small amount of coherence. These are the spatially ergodic states, i.e., states that have sharp statistics for any translation-invariant observable, and mixtures of such states with the same thermodynamic potential. As an intermediate result, we show for a general state that if the min- and the max-relative entropy to the thermal state coincide approximately, this implies the approximately reversible interconvertibility to and from the thermal state with thermal operations and a small source of coherence. Our results provide a strong link between the abstract resource theory of thermodynamics and more realistic physical systems, as we achieve a robust and operational characterization of the emergence of a thermodynamic potential in translation-invariant lattice systems.

quant-ph↗

Information-geometrical characterization of statistical models which are statistically equivalent to probability simplexes

The probability simplex is the set of all probability distributions on a finite set and is the most fundamental object in the finite probability theory. In this paper we give a characterization of statistical models on finite sets which are statistically equivalent to probability simplexes in terms of $α$-families including exponential families and mixture families. The subject has a close relation to some fundamental aspects of information geometry such as $α$-connections and autoparallelity.

cs.IT↗

The exponential family of Markov chains and its information geometry

We introduce a new definition of exponential family of Markov chains, and show that many characteristic properties of the usual exponential family of probability distributions are properly extended to Markov chains. The method of information geometry is effectively applied to our framework, which enables us to characterize the divergence rate of Markov chain from a differential geometric viewpoint.

cs.IT↗

A Fundamental Inequality for Lower-bounding the Error Probability for Classical and Quantum Multiple Access Channels and Its Applications

In the study of the capacity problem for multiple access channels (MACs), a lower bound on the error probability obtained by Han plays a crucial role in the converse parts of several kinds of channel coding theorems in the information-spectrum framework. Recently, Yagi and Oohama showed a tighter bound than the Han bound by means of Polyanskiy's converse. In this paper, we give a new bound which generalizes and strengthens the Yagi-Oohama bound, and demonstrate that the bound plays a fundamental role in deriving extensions of several known bounds. In particular, the Yagi-Oohama bound is generalized to two different directions; i.e, to general input distributions and to general encoders. In addition we extend these bounds to the quantum MACs and apply them to the converse problems for several information-spectrum settings.

cs.IT↗

The Converse Part of The Theorem for Quantum Hoeffding Bound

We prove the converse part of the theorem for quantum Hoeffding bound on the asymptotics of quantum hypothesis testing, essentially based on an argument developed by Nussbaum and Szkola in proving the converse part of the quantum Chernoff bound. Our result complements Hayashi's proof of the direct (achievability) part of the theorem, so that the quantum Hoeffding bound has now been established.

quant-ph↗

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

The information-spectrum analysis made by Han for classical hypothesis testing for simple hypotheses is extended to a unifying framework including both classical and quantum hypothesis testing as well as fixed-length source coding, whereby general formulas for several quantities concerning the asymptotic optimality of tests/codes are established in terms of classical and quantum information spectrum. Generality of theorems and simplicity of proofs are fully pursued, and as byproducts some improvements on the original classical results are also obtained.

quant-ph↗

General formulas for capacity of classical-quantum channels

The capacity of a classical-quantum channel (or in other words the classical capacity of a quantum channel) is considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. A capacity formula as well as a characterization of the strong converse property is given just in parallel with the corresponding classical results of Verdú-Han which are based on the so-called information-spectrum method. The general results are applied to the stationary memoryless case with or without cost constraint on inputs, whereby a deep relation between the channel coding theory and the hypothesis testing for two quantum states is elucidated. no structural assumptions such as the stationary memoryless property are made on a channel. A capacity formula as well as a characterization of the strong converse property is given just in parallel with the corresponding classical results of Verdu-Han which are based on the so-called information-spectrum method. The general results are applied to the stationary memoryless case with or without cost constraint on inputs, whereby a deep relation between the channel coding theory and the hypothesis testing for two quantum states is elucidated.

quant-ph↗

A New Proof of the Channel Coding Theorem via Hypothesis Testing in Quantum Information Theory

A new proof of the direct part of the quantum channel coding theorem is shown based on a standpoint of quantum hypothesis testing. A packing procedure of mutually noncommutative operators is carried out to derive an upper bound on the error probability, which is similar to Feinstein's lemma in classical channel coding. The upper bound is used to show the proof of the direct part along with a variant of Hiai-Petz's theorem in quantum hypothesis testing.

quant-ph↗

Numerical Experiments on The Capacity of Quantum Channel with Entangled Input States

The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to aspecial case of the more general problem whether the capacity of product quantum channel exhibits additivity. In the present study, we apply one of the quantum Arimoto-Blahut type algorithms to the latter problem. The results suggest that the additivity of product quantum channel capacity always holds and that entangled input states cannot enhance the quantum channel capacity.

quant-ph↗

Strong Converse and Stein's Lemma in the Quantum Hypothesis Testing

The hypothesis testing problem of two quantum states is treated. We show a new inequality between the error of the first kind and the second kind, which complements the result of Hiai and Petz to establish the quantum version of Stein's lemma. The inequality is also used to show a bound on the first kind error when the power exponent for the second kind error exceeds the quantum relative entropy, and the bound yields the strong converse in the quantum hypothesis testing. Finally, we discuss the relation between the bound and the power exponent derived by Han and Kobayashi in the classical hypothesis testing.

quant-ph↗

Strong Converse to the Quantum Channel Coding Theorem

A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept for the difficulty due to non-commutativity.

quant-ph↗