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

Kohtaro Kato

dblp:327/8201 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0003-3317-2004ORCID · reported

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

Theory of computation · 1 · 1 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
1 paper
Quantum computing and quantum information · 100%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum information theory
quantum data compression
0.912025
Exact and Local Compression of Quantum Bipartite States · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information
quantum information theory
0.912025
Exact and Local Compression of Quantum Bipartite States · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information
quantum channel
0.312025
Exact and Local Compression of Quantum Bipartite States · IEEE Trans. Inf. Theory 2025

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

schmidt rank minimization · 0.9
YearPublicationVenuePosition
2025 Exact and Local Compression of Quantum Bipartite States
abstract
We study an exact local compression of a quantum bipartite state; that is, applying local quantum operations to the state to reduce the dimensions of Hilbert spaces while perfectly maintaining the correlation. We provide a closed formula for calculating the minimal achievable dimensions, provided as a minimization of the Schmidt rank of a particular pure state constructed from the given state. Numerically more tractable upper and lower bounds of the rank are also obtained. Subsequently, we consider the exact compression of quantum channels as an application. Using this method, a post-processing step that can reduce the output dimensions while retaining information on the output of the original channel can be analyzed.
Kohtaro Kato
IEEE Trans. Inf. Theory1