Ryutaroh Matsumoto

Prof. Ryutaroh Matsumoto

Nagoya University
+1
orcid

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 March 2019 in Quantum Information Processing
Verified
Journal Article
Open access
PDF file
CGCarlos Galindo
Carlos Galindo
FHFernando Hernando
Fernando Hernando
Ryutaroh MatsumotoRyutaroh Matsumoto
Ryutaroh Matsumoto
DRDiego Ruano
Diego Ruano
We prove that the known formulae for computing the optimal number of maximally entangled pairs required for entanglement-assisted quantum error-correcting codes (EAQECCs) over the binary field hold for codes over arbitrary finite fields as well. We also give a Gilbert–Varshamov bound for EAQECCs and constructions of EAQECCs coming from punctured self-orthogonal linear codes which are valid for any finite field.

15 February 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MHMasahito Hayashi
Masahito Hayashi
Ryutaroh MatsumotoRyutaroh Matsumoto
Ryutaroh Matsumoto
The secure multiplex coding (SMC) is a technique to remove rate loss in the coding for wire-tap channels and broadcast channels with confidential messages caused by the inclusion of random bits into transmitted signals. SMC replaces the random bits by other meaningful secret messages, and a collection of secret messages serves as the random bits to hide the rest of messages. In the previous studies, multiple secret messages were assumed to have independent and uniform distributions, which is difficult to be ensured in practice. We remove this restrictive assumption by a generalization of the channel resolvability technique. We also give practical construction techniques for SMC by using an arbitrary given error-correcting code as an ingredient, and channel-universal coding of SMC. By using the same principle as the channel-universal SMC, we give coding for the broadcast channel with confidential messages universal to both channel and source distributions.

5 May 2015 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JKJun Kurihara
Jun Kurihara
Ryutaroh MatsumotoRyutaroh Matsumoto
Ryutaroh Matsumoto
TUTomohiko Uyematsu
Tomohiko Uyematsu
By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C 1 of length n over a field extension F q m and its subcode C 2 ⊆ C 1 . One is called the relative dimension/intersection profile (RDIP), and the other is called the relative generalized rank weight (RGRW). We clarify their basic properties and the relation between the RGRW and the minimum rank distance. As applications of the RDIP and the RGRW, the security performance and the error correction capability of secure network coding, guaranteed independently of the underlying network code, are analyzed and clarified. We propose a construction of secure network coding scheme, and analyze its security performance and error correction capability as an example of applications of the RDIP and the RGRW. Silva and Kschischang showed the existence of a secure network coding in which no part of the secret message is revealed to the adversary even if any dim C 1 -1 links are wiretapped, which is guaranteed over any underlying network code. However, the explicit construction of such a scheme remained an open problem. Our new construction is just one instance of secure network coding that solves this open problem.

1 June 2017 in Quantum Science and Technology
Verified
Journal Article
Open access
PDF file
THTakuya Hirano
Takuya Hirano
TITsubasa Ichikawa
Tsubasa Ichikawa
TMTakuto Matsubara
Takuto Matsubara
MOMotoharu Ono
Motoharu Ono
YOYusuke Oguri
Yusuke Oguri
TTToyohiro Tsurumaru
Toyohiro Tsurumaru

17 October 2008 in Physical Review A
Verified
Journal Article
Open access
PDF file
SWShun Watanabe
Shun Watanabe
Ryutaroh MatsumotoRyutaroh Matsumoto
Ryutaroh Matsumoto
TUTomohiko Uyematsu
Tomohiko Uyematsu
We construct a practically implementable classical processing for the Bennett-Brassard 1984 (BB84) protocol and the six-state protocol that fully utilizes the accurate channel estimation method, which is also known as the quantum tomography. Our proposed processing yields at least as high a key rate as the standard processing by Shor and Preskill. We show two examples of quantum channels over which the key rate of our proposed processing is strictly higher than the standard processing. In the second example, the BB84 protocol with our proposed processing yields a positive key rate even though the so-called error rate is higher than the 25% limit.

1 January 2012 in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Verified
Journal Article
Closed access
JKJun Kurihara
Jun Kurihara
TUTomohiko Uyematsu
Tomohiko Uyematsu
Ryutaroh MatsumotoRyutaroh Matsumoto
Ryutaroh Matsumoto