Tomohiro Ogawa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tomohiro Ogawa has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Akinori Kawachi
Tokyo Institute of Technology
9 shared publications - Gen Kimura
College of Systems Engineering and Science, Shibaura Institute of Technology, Saitama 330-8570, Japan
9 shared publications - Masahito Hayashi
School of Data Science, The Chinese University of Hong Kong, Shenzhen, Longgang District, Shenzhen 518172, People’s Republic of China
9 shared publications - Satoshi Ishizaka
Graduate School of Integrated Arts and Sciences, Hiroshima University, 1-7-1 Kagamiyama, Higashi-hiroshima, 739-8521, Japan
9 shared publications - Milán Mosonyi
MTA-BME Lendület Quantum Information Theory Research Group Budapest University of Technology and Economics Műegyetem rkp. 3. H-1111 Budapest Hungary
7 shared publications - Eyuri Wakakuwa
Graduate School of Frontier Sciences, The University of Tokyo 2 , 5-1-5, Kashiwanoha, Kashiwa-shi, Chiba 277-8561, Japan
1 shared publication
Latest Publications
- 2 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (3) , 1668-1698
Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding With Constant Compositions
There are different inequivalent ways to define the Rényi capacity of a channel for a fixed input distribution. In [IEEE Transactions on Information Theory, 41(1):26-34, 1995], Csiszár has shown that for classical discrete memoryless channels there is a distinguished such quantity that has an operational interpretation as a generalized cutoff rate for constant composition channel coding. We show that the analogous notion of Rényi capacity, defined in terms of the sandwiched quantum Rényi divergences, has the same operational interpretation in the strong converse problem of constant composition classicalquantum channel coding.
- 2 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (3) , 1668-1698
Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding With Constant Compositions
There are different inequivalent ways to define the Rényi capacity of a channel for a fixed input distribution. In [IEEE Transactions on Information Theory, 41(1):26-34, 1995], Csiszár has shown that for classical discrete memoryless channels there is a distinguished such quantity that has an operational interpretation as a generalized cutoff rate for constant composition channel coding. We show that the analogous notion of Rényi capacity, defined in terms of the sandwiched quantum Rényi divergences, has the same operational interpretation in the strong converse problem of constant composition classicalquantum channel coding.
- Open Access
Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions
There are different inequivalent ways to define the R\'enyi capacity of a channel for a fixed input distribution $P$. In a 1995 paper Csisz\'ar has shown that for classical discrete memoryless channels there is a distinguished such quantity that has an operational interpretation as a generalized cutoff rate for constant composition channel coding. We show that the analogous notion of R\'enyi capacity, defined in terms of the sandwiched quantum R\'enyi divergences, has the same operational interpretation in the strong converse problem of classical-quantum channel coding. Denoting the constant composition strong converse exponent for a memoryless classical-quantum channel $W$ with composition $P$ and rate $R$ as $sc(W,R,P)$, our main result is that \[ sc(W,R,P)=\sup_{\alpha>1}\frac{\alpha-1}{\alpha}\left[R-\chi_{\alpha}^*(W,P)\right], \] where $\chi_{\alpha}^*(W,P)$ is the $P$-weighted sandwiched R\'enyi divergence radius of the image of the channel.Open AccessDivergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions
There are different inequivalent ways to define the R\'enyi capacity of a channel for a fixed input distribution $P$. In a 1995 paper Csisz\'ar has shown that for classical discrete memoryless channels there is a distinguished such quantity that has an operational interpretation as a generalized cutoff rate for constant composition channel coding. We show that the analogous notion of R\'enyi capacity, defined in terms of the sandwiched quantum R\'enyi divergences, has the same operational interpretation in the strong converse problem of classical-quantum channel coding. Denoting the constant composition strong converse exponent for a memoryless classical-quantum channel $W$ with composition $P$ and rate $R$ as $sc(W,R,P)$, our main result is that \[ sc(W,R,P)=\sup_{\alpha>1}\frac{\alpha-1}{\alpha}\left[R-\chi_{\alpha}^*(W,P)\right], \] where $\chi_{\alpha}^*(W,P)$ is the $P$-weighted sandwiched R\'enyi divergence radius of the image of the channel. - Open Access
Strong converse exponent for classical-quantum channel coding
We determine the exact strong converse exponent of classical-quantum channel coding, for every rate above the Holevo capacity. Our form of the exponent is an exact analogue of Arimoto's, given as a transform of the Renyi capacities with parameters alpha>1. It is important to note that, unlike in the classical case, there are many inequivalent ways to define the Renyi divergence of states, and hence the R\'enyi capacities of channels. Our exponent is in terms of the Renyi capacities corresponding to a version of the Renyi divergences that has been introduced recently in [M\"uller-Lennert, Dupuis, Szehr, Fehr and Tomamichel, J. Math. Phys. 54, 122203, (2013)], and [Wilde, Winter, Yang, Commun. Math. Phys. 331, (2014)]. Our result adds to the growing body of evidence that this new version is the natural definition for the purposes of strong converse problems.
Open AccessStrong converse exponent for classical-quantum channel coding
We determine the exact strong converse exponent of classical-quantum channel coding, for every rate above the Holevo capacity. Our form of the exponent is an exact analogue of Arimoto's, given as a transform of the Renyi capacities with parameters alpha>1. It is important to note that, unlike in the classical case, there are many inequivalent ways to define the Renyi divergence of states, and hence the R\'enyi capacities of channels. Our exponent is in terms of the Renyi capacities corresponding to a version of the Renyi divergences that has been introduced recently in [M\"uller-Lennert, Dupuis, Szehr, Fehr and Tomamichel, J. Math. Phys. 54, 122203, (2013)], and [Wilde, Winter, Yang, Commun. Math. Phys. 331, (2014)]. Our result adds to the growing body of evidence that this new version is the natural definition for the purposes of strong converse problems.
- 1 February 2018
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 59 (2) , 022201
Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution
We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily a tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of bipartite pure states.
- 1 February 2018
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 59 (2) , 022201
Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution
We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily a tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of bipartite pure states.
- 29 June 2017
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 355 (1) , 373-426
Strong Converse Exponent for Classical-Quantum Channel Coding
- 29 June 2017
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 355 (1) , 373-426
Strong Converse Exponent for Classical-Quantum Channel Coding
- Open Access
Asymptotic Convertibility of Entanglement: A General Approach to Entanglement Concentration and Dilution
We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily in tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of pure states.
Open AccessAsymptotic Convertibility of Entanglement: A General Approach to Entanglement Concentration and Dilution
We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily in tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of pure states.
- 14 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 61 (12) , 6975-6994
Two Approaches to Obtain the Strong Converse Exponent of Quantum Hypothesis Testing for General Sequences of Quantum States
We present two general approaches to obtain the strong converse exponent of simple quantum hypothesis testing for correlated quantum states. One approach requires that the states satisfy a certain factorization property; typical examples of such states are the temperature states of translation-invariant finite-range interactions on a spin chain. The other approach requires the differentiability of a regularized Rényi α-divergence in the parameter α; typical examples of such states include temperature states of non-interacting fermionic lattice systems, and classical irreducible Markov chains. In all cases, we get that the strong converse exponent is equal to the Hoeffding antidivergence, which in turn is obtained from the regularized Rényi divergences of the two states.
- 14 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 61 (12) , 6975-6994
Two Approaches to Obtain the Strong Converse Exponent of Quantum Hypothesis Testing for General Sequences of Quantum States
We present two general approaches to obtain the strong converse exponent of simple quantum hypothesis testing for correlated quantum states. One approach requires that the states satisfy a certain factorization property; typical examples of such states are the temperature states of translation-invariant finite-range interactions on a spin chain. The other approach requires the differentiability of a regularized Rényi α-divergence in the parameter α; typical examples of such states include temperature states of non-interacting fermionic lattice systems, and classical irreducible Markov chains. In all cases, we get that the strong converse exponent is equal to the Hoeffding antidivergence, which in turn is obtained from the regularized Rényi divergences of the two states.
- 4 December 2014
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 334 (3) , 1617-1648
Quantum Hypothesis Testing and the Operational Interpretation of the Quantum Rényi Relative Entropies
- 4 December 2014
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 334 (3) , 1617-1648
Quantum Hypothesis Testing and the Operational Interpretation of the Quantum Rényi Relative Entropies
- Open Access
Quantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
We show that the new quantum extension of Renyi's \alpha-relative entropies, introduced recently by Muller-Lennert, Dupuis, Szehr, Fehr and Tomamichel, J. Math. Phys. 54, 122203, (2013), and Wilde, Winter, Yang, Commun. Math. Phys. 331, (2014), have an operational interpretation in the strong converse problem of quantum hypothesis testing. Together with related results for the direct part of quantum hypothesis testing, known as the quantum Hoeffding bound, our result suggests that the operationally relevant definition of the quantum Renyi relative entropies depends on the parameter \alpha: for \alpha1 the right choice is the newly introduced version. As a sideresult, we show that the new Renyi \alpha-relative entropies are asymptotically attainable by measurements for \alpha>1, and give a new simple proof for their monotonicity under completely positive trace-preserving maps.
Open AccessQuantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
We show that the new quantum extension of Renyi's \alpha-relative entropies, introduced recently by Muller-Lennert, Dupuis, Szehr, Fehr and Tomamichel, J. Math. Phys. 54, 122203, (2013), and Wilde, Winter, Yang, Commun. Math. Phys. 331, (2014), have an operational interpretation in the strong converse problem of quantum hypothesis testing. Together with related results for the direct part of quantum hypothesis testing, known as the quantum Hoeffding bound, our result suggests that the operationally relevant definition of the quantum Renyi relative entropies depends on the parameter \alpha: for \alpha1 the right choice is the newly introduced version. As a sideresult, we show that the new Renyi \alpha-relative entropies are asymptotically attainable by measurements for \alpha>1, and give a new simple proof for their monotonicity under completely positive trace-preserving maps.
- 23 August 2014
- Published by Springer Nature
- p. 231-268
Quantum Error Correction and Quantum Cryptography
- 23 August 2014
- Published by Springer Nature
- p. 231-268
Quantum Error Correction and Quantum Cryptography