Kamil Korzekwa

dblp:227/2554 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-0683-5469ORCID · corroborated

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

Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.612022
Encoding Classical Information Into Quantum Resources · IEEE Trans. Inf. Theory 2022
Quantum computing and quantum information
quantum information theory
0.612022
Encoding Classical Information Into Quantum Resources · IEEE Trans. Inf. Theory 2022
Quantum computing and quantum information
resource theory
0.612022
Encoding Classical Information Into Quantum Resources · IEEE Trans. Inf. Theory 2022
YearPublicationVenuePosition
2022 Encoding Classical Information Into Quantum Resources
abstract
We 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. Theory1
2019 Moderate deviation analysis of majorisation-based resource interconversion
abstract
We consider the problem of interconverting a finite amount of resources within all theories whose single-shot transformation rules are based on a majorisation relation, e.g. the resource theories of entanglement and coherence (for pure state transformations), as well as thermodynamics (for energy-incoherent transformations). When only finite resources are available we expect to see a non-trivial trade-off between the rate rnat which n copies of a resource state ρ can be transformed into nrncopies of another resource state σ, and the error level εnof the interconversion process, as a function of n. In this work we derive the optimal trade-off in the so-called moderate deviation regime, where the rate of interconversion rnapproaches its optimum in the asymptotic limit of unbounded resources (n → ∞), while the error εnvanishes in the same limit. We find that the moderate deviation analysis exhibits a resonance behaviour which implies that certain pairs of resource states can be interconverted at the asymptotically optimal rate with negligible error, even in the finite n regime.
Christopher T. Chubb, Kamil Korzekwa, Marco Tomamichel
ISIT2