Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Motohisa Fukuda

dblp:160/1908 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
1since 2021 · last 2025
0000-0002-6757-1700ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 4 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
4 papers
Quantum computing and quantum information · 83% Information theory · 17%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum channel
1.742025
Concentration of Quantum Channels With Random Kraus Operators via Matrix Bernstein Inequality · IEEE Trans. Inf. Theory 2025
On the Minimum Output Entropy of Random Orthogonal Quantum Channels · IEEE Trans. Inf. Theory 2018
Additive Bounds of Minimum Output Entropies for Unital Channels and an Exact Qubit Formula · IEEE Trans. Inf. Theory 2017
Information theory › probability theory › measure concentration
concentration inequalities
0.912025
Concentration of Quantum Channels With Random Kraus Operators via Matrix Bernstein Inequality · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum information theory
quantum expanders
0.912025
Concentration of Quantum Channels With Random Kraus Operators via Matrix Bernstein Inequality · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum information theory
minimum output entropy
0.832018
On the Minimum Output Entropy of Random Orthogonal Quantum Channels · IEEE Trans. Inf. Theory 2018
Additive Bounds of Minimum Output Entropies for Unital Channels and an Exact Qubit Formula · IEEE Trans. Inf. Theory 2017
Quantum Channels With Polytopic Images and Image Additivity · IEEE Trans. Inf. Theory 2015
Quantum computing and quantum information › quantum channel capacity
additivity
0.522017
Additive Bounds of Minimum Output Entropies for Unital Channels and an Exact Qubit Formula · IEEE Trans. Inf. Theory 2017
Quantum Channels With Polytopic Images and Image Additivity · IEEE Trans. Inf. Theory 2015
Quantum computing and quantum information › quantum channel capacity
classical capacity
0.312017
Additive Bounds of Minimum Output Entropies for Unital Channels and an Exact Qubit Formula · IEEE Trans. Inf. Theory 2017

Methods — techniques the papers use, named apart from their topics

unitary t-design · 0.9matrix bernstein inequality · 0.9stinespring dilation · 0.3haar measure · 0.3eigenvalue distribution · 0.3rényi entropy · 0.3operator norm · 0.3convex hull · 0.2
YearPublicationVenuePosition
2025 Concentration of Quantum Channels With Random Kraus Operators via Matrix Bernstein Inequality
abstract
Abstract. In this study, we generate quantum channels with random Kraus operators to typically obtain almost twirling quantum channels and quantum expanders. To prove the concentration phenomena, we use matrix Bernstein’s inequality. In this way, our random models do not utilize Haar-distributed unitary matrices or Gaussian matrices. Rather, as in the preceding research, we use unitary t-designs to generate mixed tensor-product unitary channels acting on Cdt. Although our bounds in Schatten p-norm are valid only for 1 ≤p≤ 2, we show that they are typically quantum ϵ-twirling channels with the tail bound proportional to 1/poly(dt), while such bounds were previously constants. The number of required Kraus operators was also improved by powers of logdandt, to be proportional todtlogd/ϵ2. Such random quantum channels are also typically quantum expanders, but the number of Kraus operators must grow proportionally totlogdin our case. Finally, a new non-unital model of super-operators generated by bounded and isotropic random Kraus operators was introduced, which can be typically rectified to yield almost randomizing quantum channels and quantum expanders.
Motohisa Fukuda
IEEE Trans. Inf. Theory1
2018 On the Minimum Output Entropy of Random Orthogonal Quantum Channels
abstract
We consider the sequences of random quantum channels defined by using the Stinespring formula with Haar-distributed random orthogonal matrices. For any fixed sequence of input states, we study the asymptotic eigenvalue distribution of the outputs through the tensor powers of random channels. We show that the input states achieving minimum output entropy are tensor products of maximally entangled states (Bell states) when the tensor power is even. This phenomenon is completely different from the one for random quantum channels constructed from Haar-distributed random unitary matrices, which leads us to formulate some conjectures about the regularized minimum output entropy.
Motohisa Fukuda, Ion Nechita
IEEE Trans. Inf. Theory1
2017 Additive Bounds of Minimum Output Entropies for Unital Channels and an Exact Qubit Formula
abstract
We find an upper bound for the minimum output entropy of a unital quantum channel, and obtain an exact formula for general qubit channels. Our techniques incorporate the Rényi entropies, particularly, with Rényi parameter α = 2. Moreover, since our upper bound is additive under tensor product, we get as a corollary an upper bound for the classical capacity of unital quantum channels. Interestingly, our upper bound for the classical capacity depends only on the operator norm of matrix representations of channels on the space of traceless Hermitian operators, and is tight in the sense that it gives the precise quantity of classical capacity of the Werner-Holevo channel. As an example, we study quantum channels with operator sum representation that is made of the discrete Weyl operators (generalized Pauli operators), and explain how our formula works in this case. Finally, we find new examples for which the minimum output Rényi 2-entropy is additive.
Motohisa Fukuda, Gilad Gour
IEEE Trans. Inf. Theory1
2015 Quantum Channels With Polytopic Images and Image Additivity
abstract
We study quantum channels with respect to their image, i.e., the image of the set of density operators under the action of the channel. We first characterize the set of quantum channels having polytopic images and show that additivity of the minimal output entropy can be violated in this class. We then provide a complete characterization of quantum channels T that are universally image additive in the sense that for any quantum channel S, the image of T ⊗ S is the convex hull of the tensor product of the images of T and S. These channels turn out to form a strict subset of entanglement breaking channels with polytopic images and a strict superset of classical-quantum channels.
Motohisa Fukuda, Ion Nechita, Michael M. Wolf
IEEE Trans. Inf. Theory1