Koichi Yamagata
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Koichi Yamagata has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Akio Fujiwara
Department of Mathematics Osaka University Toyonaka 560-0043 Osaka Japan
5 shared publications Akio Fujiwara
3 shared publicationsRyo Okamoto
Kyoto University, Kyoto, Japan
3 shared publications- Maki Sakamoto
The University of Electro-Communications
2 shared publications Satoshi Oyama
Research Institute for Electronic Science, Hokkaido University, Sapporo 060-0812, Japan
2 shared publicationsAyako Yamanishi
Department of Genome Biology, Graduate School of Medicine, Osaka University, Osaka, 565-0871, Japan
1 shared publication
Latest Publications
- Open Access
- 2 November 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (44) , 445101
A game-theoretic probability approach to loopholes in CHSH experiments
We study the CHSH inequality from an informational and timing-sensitive viewpoint using game-theoretic probability, without assuming an underlying probability space. The locality loophole and the measurement-dependence (‘freedom-of-choice’) loophole are reformulated as structural constraints in a sequential hidden-variable game between Scientists and Nature. We construct a monitored hidden-variable game with two capital processes: one is directed at the empirical reproduction of the CHSH correlations, while the other monitors empirical dependence between measurement settings and Nature’s complete hidden-variable assignments. We prove that, within this game, Nature cannot simultaneously reproduce the CHSH empirical behavior and satisfy the stated asymptotic factorization condition. This incompatibility is expressed game-theoretically by the existence of a winning strategy for Scientists that forces at least one of the two capital processes to become unbounded.
- 2 November 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (44) , 445101
Open AccessA game-theoretic probability approach to loopholes in CHSH experiments
We study the CHSH inequality from an informational and timing-sensitive viewpoint using game-theoretic probability, without assuming an underlying probability space. The locality loophole and the measurement-dependence (‘freedom-of-choice’) loophole are reformulated as structural constraints in a sequential hidden-variable game between Scientists and Nature. We construct a monitored hidden-variable game with two capital processes: one is directed at the empirical reproduction of the CHSH correlations, while the other monitors empirical dependence between measurement settings and Nature’s complete hidden-variable assignments. We prove that, within this game, Nature cannot simultaneously reproduce the CHSH empirical behavior and satisfy the stated asymptotic factorization condition. This incompatibility is expressed game-theoretically by the existence of a winning strategy for Scientists that forces at least one of the two capital processes to become unbounded.
- 1 November 2026
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 67 (11)
Sufficient support size of measurements for quantum estimation
In quantum estimation for a d-parameter family of density operators on a finite-dimensional Hilbert space H, an estimator is specified by a pair M,θ̂, where M is a positive operator-valued measure (POVM) with a finite outcome set Ω and θ̂:Ω→Rd is a classical estimator map. Since the number of outcomes Ω is a priori unbounded, the space of admissible POVMs is vast, which makes the search for optimal estimators difficult. In this paper, for the minimization of the weighted trace of the mean squared error among locally unbiased estimators, we prove that it suffices to consider POVMs with at most dimH2+d(d+1)/2−1 outcomes, and that the optimization can be restricted to rank-one measurements. For Bayesian estimation with a general loss function, we show that rank-one POVMs with at most (dimH)2 outcomes are sufficient for the infimum value of the Bayes risk. Furthermore, when the model admits a real sufficient subalgebra, we show that the dimH2 term in the above support-size bounds can be reduced in both the locally unbiased and Bayesian settings. These bounds substantially reduce the search space for optimal measurements and justify restricting numerical optimization to rank-one POVMs with finitely many outcomes.
- 1 November 2026
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 67 (11)
Sufficient support size of measurements for quantum estimation
In quantum estimation for a d-parameter family of density operators on a finite-dimensional Hilbert space H, an estimator is specified by a pair M,θ̂, where M is a positive operator-valued measure (POVM) with a finite outcome set Ω and θ̂:Ω→Rd is a classical estimator map. Since the number of outcomes Ω is a priori unbounded, the space of admissible POVMs is vast, which makes the search for optimal estimators difficult. In this paper, for the minimization of the weighted trace of the mean squared error among locally unbiased estimators, we prove that it suffices to consider POVMs with at most dimH2+d(d+1)/2−1 outcomes, and that the optimization can be restricted to rank-one measurements. For Bayesian estimation with a general loss function, we show that rank-one POVMs with at most (dimH)2 outcomes are sufficient for the infimum value of the Bayes risk. Furthermore, when the model admits a real sufficient subalgebra, we show that the dimH2 term in the above support-size bounds can be reduced in both the locally unbiased and Bayesian settings. These bounds substantially reduce the search space for optimal measurements and justify restricting numerical optimization to rank-one POVMs with finitely many outcomes.
- 21 November 2024
- Published by IOP Publishing in Physica Scripta
- Vol. 99 (12) , 125266
Gill and Massar type bound for estimation of SU(2) channel
In the estimation for a parametric family of quantum state on a Hilbert space H , the Gill and Massar bound is known as a lower bound of weighted traces of covariances of unbiased estimators. The Gill and Massar bound is derived by considering the convexity of the set of classical Fisher information matrices, and the bound is locally achievable by using randomized strategies when H = C 2 . In this paper, we show that estimation for a parametric SU(2) unitary channel model has a similar convex structure as qubit state model, and a Gill and Massar type lower bound of weighted traces of covariances of unbiased estimators can be derived for any weight matrix. We show that the Gill and Massar type lower bound is achievable by using randomized strategies when certain conditions are satisfied. To derive a convex structure of the set of classical Fisher information matrices, we introduce a Fisher information matrix J (U) for a SU(2) unitary channel model, and we show a upper bound of inverse J (U) weighted trace of classical Fisher information matrix. The optimal randomized strategy we construct in this paper does not require ancilla systems in many cases.
- 21 November 2024
- Published by IOP Publishing in Physica Scripta
- Vol. 99 (12) , 125266
Gill and Massar type bound for estimation of SU(2) channel
In the estimation for a parametric family of quantum state on a Hilbert space H , the Gill and Massar bound is known as a lower bound of weighted traces of covariances of unbiased estimators. The Gill and Massar bound is derived by considering the convexity of the set of classical Fisher information matrices, and the bound is locally achievable by using randomized strategies when H = C 2 . In this paper, we show that estimation for a parametric SU(2) unitary channel model has a similar convex structure as qubit state model, and a Gill and Massar type lower bound of weighted traces of covariances of unbiased estimators can be derived for any weight matrix. We show that the Gill and Massar type lower bound is achievable by using randomized strategies when certain conditions are satisfied. To derive a convex structure of the set of classical Fisher information matrices, we introduce a Fisher information matrix J (U) for a SU(2) unitary channel model, and we show a upper bound of inverse J (U) weighted trace of classical Fisher information matrix. The optimal randomized strategy we construct in this paper does not require ancilla systems in many cases.
- Open Access
- 7 October 2021
- Published by Frontiers Media SA in Frontiers in Psychology
- Vol. 12
Computer Vision System for Expressing Texture Using Sound-Symbolic Words
The major goals of texture research in computer vision are to understand, model, and process texture and ultimately simulate human visual information processing using computer technologies. The field of computer vision has witnessed remarkable advancements in material recognition using deep convolutional neural networks (DCNNs), which have enabled various computer vision applications, such as self-driving cars, facial and gesture recognition, and automatic number plate recognition. However, for computer vision to “express” texture like human beings is still difficult because texture description has no correct or incorrect answer and is ambiguous. In this paper, we develop a computer vision method using DCNN that expresses texture of materials. To achieve this goal, we focus on Japanese “sound-symbolic” words, which can describe differences in texture sensation at a fine resolution and are known to have strong and systematic sensory-sound associations. Because the phonemes of Japanese sound-symbolic words characterize categories of texture sensations, we develop a computer vision method to generate the phonemes and structure comprising sound-symbolic words that probabilistically correspond to the input images. It was confirmed that the sound-symbolic words output by our system had about 80% accuracy rate in our evaluation.
- 7 October 2021
- Published by Frontiers Media SA in Frontiers in Psychology
- Vol. 12
Open AccessComputer Vision System for Expressing Texture Using Sound-Symbolic Words
The major goals of texture research in computer vision are to understand, model, and process texture and ultimately simulate human visual information processing using computer technologies. The field of computer vision has witnessed remarkable advancements in material recognition using deep convolutional neural networks (DCNNs), which have enabled various computer vision applications, such as self-driving cars, facial and gesture recognition, and automatic number plate recognition. However, for computer vision to “express” texture like human beings is still difficult because texture description has no correct or incorrect answer and is ambiguous. In this paper, we develop a computer vision method using DCNN that expresses texture of materials. To achieve this goal, we focus on Japanese “sound-symbolic” words, which can describe differences in texture sensation at a fine resolution and are known to have strong and systematic sensory-sound associations. Because the phonemes of Japanese sound-symbolic words characterize categories of texture sensations, we develop a computer vision method to generate the phonemes and structure comprising sound-symbolic words that probabilistically correspond to the input images. It was confirmed that the sound-symbolic words output by our system had about 80% accuracy rate in our evaluation.
- 1 June 2021
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 62 (6) , 062203
Maximum logarithmic derivative bound on quantum state estimation as a dual of the Holevo bound
In quantum estimation theory, the Holevo bound is known as a lower bound of weighted traces of covariances of unbiased estimators. The Holevo bound is defined by a solution of a minimization problem, and in general, an explicit solution is not known. When the dimension of Hilbert space is 2 and the number of parameters is 2, an explicit form of the Holevo bound was given by Suzuki. In this paper, we focus on a logarithmic derivative that lies between the symmetric logarithmic derivative (SLD) and the right logarithmic derivative parameterized by β ∈ [0, 1] to obtain lower bounds of the weighted trace of covariance of an unbiased estimator. We introduce the maximum logarithmic derivative bound as the maximum of bounds with respect to β. We show that all monotone metrics induce lower bounds, and the maximum logarithmic derivative bound is the largest bound among them. We show that the maximum logarithmic derivative bound has explicit solution when the d dimensional model has d + 1 dimensional invariant extension of the SLD tangent space. Furthermore, when d = 2, we show that the maximization problem to define the maximum logarithmic derivative bound is the Lagrangian duality of the minimization problem to define the Holevo bound and is the same as the Holevo bound. This explicit solution is a generalization of the solution for a two-dimensional Hilbert space given by Suzuki. We also give examples of families of quantum states to which our theory can be applied not only for two-dimensional Hilbert spaces.- 1 June 2021
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 62 (6) , 062203
Maximum logarithmic derivative bound on quantum state estimation as a dual of the Holevo bound
In quantum estimation theory, the Holevo bound is known as a lower bound of weighted traces of covariances of unbiased estimators. The Holevo bound is defined by a solution of a minimization problem, and in general, an explicit solution is not known. When the dimension of Hilbert space is 2 and the number of parameters is 2, an explicit form of the Holevo bound was given by Suzuki. In this paper, we focus on a logarithmic derivative that lies between the symmetric logarithmic derivative (SLD) and the right logarithmic derivative parameterized by β ∈ [0, 1] to obtain lower bounds of the weighted trace of covariance of an unbiased estimator. We introduce the maximum logarithmic derivative bound as the maximum of bounds with respect to β. We show that all monotone metrics induce lower bounds, and the maximum logarithmic derivative bound is the largest bound among them. We show that the maximum logarithmic derivative bound has explicit solution when the d dimensional model has d + 1 dimensional invariant extension of the SLD tangent space. Furthermore, when d = 2, we show that the maximization problem to define the maximum logarithmic derivative bound is the Lagrangian duality of the minimization problem to define the Holevo bound and is the same as the Holevo bound. This explicit solution is a generalization of the solution for a two-dimensional Hilbert space given by Suzuki. We also give examples of families of quantum states to which our theory can be applied not only for two-dimensional Hilbert spaces.- 11 September 2020
- Published by Springer Nature
- p. 402-411
A New Way of Making Advertising Copies: Image as Input
- 11 September 2020
- Published by Springer Nature
- p. 402-411
A New Way of Making Advertising Copies: Image as Input
- 1 August 2020
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 26 (3) , 2105-2142
Noncommutative Lebesgue decomposition and contiguity with applications in quantum statistics
Project Euclid - mathematics and statistics online
- 1 August 2020
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 26 (3) , 2105-2142
Noncommutative Lebesgue decomposition and contiguity with applications in quantum statistics
Project Euclid - mathematics and statistics online
- Open Access
Quantum monotone metrics induced from trace non-increasing maps and additive noise
Quantum monotone metric was introduced by Petz,and it was proved that quantum monotone metrics on the set of quantum states with trace one were characterized by operator monotone functions. Later, these were extended to monotone metrics on the set of positive operators whose traces are not always one based on completely positive, trace preserving (CPTP) maps. It was shown that these extended monotone metrics were characterized by operator monotone functions continuously parameterized by traces of positive operators,and did not have some ideal properties such as monotonicity and convexity with respect to the positive operators. In this paper, we introduce another extension of quantum monotone metrics which have monotonicity under completely positive, trace non-increasing (CPTNI) maps and additive noise. We prove that our extended monotone metrics can be characterized only by static operator monotone functions from few assumptions without assuming continuities of metrics. We show that our monotone metrics have some natural properties such as additivity of direct sum, convexity and monotonicity with respect to positive operators.
Open AccessQuantum monotone metrics induced from trace non-increasing maps and additive noise
Quantum monotone metric was introduced by Petz,and it was proved that quantum monotone metrics on the set of quantum states with trace one were characterized by operator monotone functions. Later, these were extended to monotone metrics on the set of positive operators whose traces are not always one based on completely positive, trace preserving (CPTP) maps. It was shown that these extended monotone metrics were characterized by operator monotone functions continuously parameterized by traces of positive operators,and did not have some ideal properties such as monotonicity and convexity with respect to the positive operators. In this paper, we introduce another extension of quantum monotone metrics which have monotonicity under completely positive, trace non-increasing (CPTNI) maps and additive noise. We prove that our extended monotone metrics can be characterized only by static operator monotone functions from few assumptions without assuming continuities of metrics. We show that our monotone metrics have some natural properties such as additivity of direct sum, convexity and monotonicity with respect to positive operators.
- Open Access
- 1 May 2020
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 61 (5) , 052202
Quantum monotone metrics induced from trace non-increasing maps and additive noise
Quantum monotone metric was introduced by Petz [Linear Algebra Appl. 244, 81–96 (1996)], and it was proved that quantum monotone metrics on the set of quantum states with trace one were characterized by operator monotone functions. Later, these were extended to monotone metrics on the set of positive operators whose traces are not always the one based on completely positive, trace preserving maps. It was shown that these extended monotone metrics were characterized by operator monotone functions continuously parameterized by traces of positive operators and did not have some ideal properties such as monotonicity and convexity with respect to the positive operators. In this paper, we introduce another extension of quantum monotone metrics that have monotonicity under completely positive, trace non-increasing maps and additive noise. We prove that our extended monotone metrics can be characterized only by static operator monotone functions from few assumptions without assuming continuities of metrics. We show that our monotone metrics have some natural properties such as additivity of direct sum, convexity, and monotonicity with respect to positive operators.
- 1 May 2020
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 61 (5) , 052202
Open AccessQuantum monotone metrics induced from trace non-increasing maps and additive noise
Quantum monotone metric was introduced by Petz [Linear Algebra Appl. 244, 81–96 (1996)], and it was proved that quantum monotone metrics on the set of quantum states with trace one were characterized by operator monotone functions. Later, these were extended to monotone metrics on the set of positive operators whose traces are not always the one based on completely positive, trace preserving maps. It was shown that these extended monotone metrics were characterized by operator monotone functions continuously parameterized by traces of positive operators and did not have some ideal properties such as monotonicity and convexity with respect to the positive operators. In this paper, we introduce another extension of quantum monotone metrics that have monotonicity under completely positive, trace non-increasing maps and additive noise. We prove that our extended monotone metrics can be characterized only by static operator monotone functions from few assumptions without assuming continuities of metrics. We show that our monotone metrics have some natural properties such as additivity of direct sum, convexity, and monotonicity with respect to positive operators.
- Open Access
Noncommutative Lebesgue decomposition and contiguity with applications in quantum statistics
We herein develop a theory of contiguity in the quantum domain based upon a novel quantum analogue of the Lebesgue decomposition. The theory thus formulated is pertinent to the weak quantum local asymptotic normality introduced in the previous paper [Yamagata, Fujiwara, and Gill, \textit{Ann. Statist.}, \textbf{41} (2013) 2197-2217.], yielding substantial enlargement of the scope of quantum statistics.
Open AccessNoncommutative Lebesgue decomposition and contiguity with applications in quantum statistics
We herein develop a theory of contiguity in the quantum domain based upon a novel quantum analogue of the Lebesgue decomposition. The theory thus formulated is pertinent to the weak quantum local asymptotic normality introduced in the previous paper [Yamagata, Fujiwara, and Gill, \textit{Ann. Statist.}, \textbf{41} (2013) 2197-2217.], yielding substantial enlargement of the scope of quantum statistics.