EDBT 2026 Demo / reviewers in the wild / expert
Karol Zyczkowski
dblp:10/8465
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-0653-3639ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 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 · 67% Coding theory · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
channel coding |
0.6 | 1 | 2022 | Encoding Classical Information Into Quantum Resources · IEEE Trans. Inf. Theory 2022 |
Quantum computing and quantum information
quantum information theory |
0.6 | 1 | 2022 | Encoding Classical Information Into Quantum Resources · IEEE Trans. Inf. Theory 2022 |
Quantum computing and quantum information
resource theory |
0.6 | 1 | 2022 | Encoding Classical Information Into Quantum Resources · IEEE Trans. Inf. Theory 2022 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Encoding Classical Information Into Quantum ResourcesabstractWe introduce and analyse the problem of encoding classical information into different resources of a quantum state. More precisely, we consider a general class of communication scenarios characterised by encoding operations that commute with a unique resource destroying map and leave free states invariant. Our motivating example is given by encoding information into coherences of a quantum system with respect to a fixed basis (with unitaries diagonal in that basis as encodings and the decoherence channel as a resource destroying map), but the generality of the framework allows us to explore applications ranging from super-dense coding to thermodynamics. For any state, we find that the number of messages that can be encoded into it using such operations in a one-shot scenario is upper bounded in terms of the information spectrum relative entropy between the given state and its version with erased resources. Furthermore, if the resource destroying map is the twirling channel over some unitary group, we find matching one-shot lower bounds as well. In the asymptotic setting where we encode into many copies of the resource state, our bounds yield an operational interpretation of resource monotones such as the relative entropy of coherence and its corresponding relative entropy variance. Kamil Korzekwa, Zbigniew Puchala, Marco Tomamichel, Karol Zyczkowski |
IEEE Trans. Inf. Theory | 4 |