Demo Data from EDBT 2026 / reviewers in the wild / expert
Ivan Savov
dblp:44/5512
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 2 first-authorTheory of computation · 2 · 1 first-author
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
2 papers |
Coding theory · 39% Quantum computing and quantum information · 32% Information theory · 29% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › multiuser coding
broadcast channel coding |
0.2 | 1 | 2015 | Classical Codes for Quantum Broadcast Channels · IEEE Trans. Inf. Theory 2015 |
Information theory › network information theory › broadcast channel
marton coding |
0.2 | 1 | 2015 | Classical Codes for Quantum Broadcast Channels · IEEE Trans. Inf. Theory 2015 |
Quantum computing and quantum information
quantum channel |
0.2 | 1 | 2015 | Classical Codes for Quantum Broadcast Channels · IEEE Trans. Inf. Theory 2015 |
Coding theory › channel coding
superposition coding |
0.2 | 1 | 2015 | Classical Codes for Quantum Broadcast Channels · IEEE Trans. Inf. Theory 2015 |
Quantum computing and quantum information
quantum channel capacity |
0.1 | 1 | 2012 | Classical Communication Over a Quantum Interference Channel · IEEE Trans. Inf. Theory 2012 |
Information theory
joint decoding |
0.1 | 1 | 2015 | Classical Codes for Quantum Broadcast Channels · IEEE Trans. Inf. Theory 2015 |
Information theory › network information theory
interference channel |
0.0 | 1 | 2012 | Classical Communication Over a Quantum Interference Channel · IEEE Trans. Inf. Theory 2012 |
Methods — techniques the papers use, named apart from their topics
quantum simultaneous nonunique decoding · 0.2successive decoding · 0.1simultaneous decoder · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Classical Codes for Quantum Broadcast ChannelsabstractWe present two approaches for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum simultaneous nonunique decoder and obtain a proof of the rate region stated in Yard et al., IEEE Trans. Inf. Theory 57 (10), 2011. Our second result is a quantum generalization of the Marton coding scheme. The error analysis for the quantum Marton region makes use of ideas in our earlier work and an idea recently presented by Radhakrishnan et al. in arXiv:1410.3248. Both results exploit recent advances in quantum simultaneous decoding developed in the context of quantum interference channels. Ivan Savov, Mark M. Wilde |
IEEE Trans. Inf. Theory | 1 |
| 2012 | Classical codes for quantum broadcast channelsabstractWe discuss two techniques for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum simultaneous nonunique decoder and obtain a simpler proof of the rate region recently published by Yard et al. in independent work. Our second result is a quantum Marton coding scheme, which gives the best known achievable rate region for quantum broadcast channels. Both results exploit recent advances in quantum simultaneous decoding developed in the context of quantum interference channels. Ivan Savov, Mark M. Wilde |
ISIT | 1 |
| 2012 | Partial decode-forward for quantum relay channelsabstractA relay channel is one in which a Source and Destination use an intermediate Relay station in order to improve communication rates. We propose the study of relay channels with classical inputs and quantum outputs and prove that a “partial decode and forward” strategy is achievable. We divide the channel uses into many blocks and build codes in a randomized, block-Markov manner within each block. The Relay performs a standard Holevo-Schumacher-Westmoreland quantum measurement on each block in order to decode part of the Source's message and then forwards this partial message in the next block. The Destination performs a novel “sliding-window” quantum measurement on two adjacent blocks in order to decode the Source's message. This strategy achieves non-trivial rates for classical communication over a quantum relay channel. Ivan Savov, Mark M. Wilde, Mai Vu |
ISIT | 1 |
| 2012 | Classical Communication Over a Quantum Interference ChannelabstractCalculating the capacity of interference channels is a notorious open problem in classical information theory. Such channels have two senders and two receivers, and each sender would like to communicate with a partner receiver. The capacity of such channels is known exactly in the settings of “very strong” and “strong” interference, while the Han-Kobayashi coding strategy gives the best known achievable rate region in the general case. Here, we introduce and study the quantum interference channel, a natural generalization of the interference channel to the setting of quantum information theory. We restrict ourselves for the most part to channels with two classical inputs and two quantum outputs in order to simplify the presentation of our results (though generalizations of our results to channels with quantum inputs are straightforward). We are able to determine the exact classical capacity of this channel in the settings of “very strong” and “strong” interference, by exploiting Winter's successive decoding strategy and a novel two-sender quantum simultaneous decoder, respectively. We provide a proof that a Han-Kobayashi strategy is achievable with Holevo information rates, up to a conjecture regarding the existence of a three-sender quantum simultaneous decoder. This conjecture holds for a special class of quantum multiple-access channels with average output states that commute, and we discuss some other variations of the conjecture that hold. Finally, we detail a connection between the quantum interference channel and prior work on the capacity of bipartite unitary gates. Omar Fawzi, Patrick M. Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde |
IEEE Trans. Inf. Theory | 3 |
| 2011 | The free space optical interference channelabstractSemiclassical models for multiple-user optical communication cannot assess the ultimate limits on reliable communication as permitted by the laws of physics. In all optical communications settings that have been analyzed within a quantum framework so far, the gaps between the quantum limit to the capacity and the Shannon limit for structured receivers become most significant in the low photon-number regime. Here, we present a quantum treatment of a multiple-transmitter multiple-receiver multi-spatial-mode free-space interference channel with diffraction-limited loss and a thermal background. We consider the performance of a laser-light (coherent state) encoding in conjunction with various detection strategies such as homodyne, heterodyne, and joint detection. Joint detection outperforms both homodyne and heterodyne detection whenever the channel exhibits “very strong” interference. We determine the capacity region for homodyne or heterodyne detection when the channel has “strong” interference, and we conjecture the existence of a joint detection strategy that outperforms the former two strategies in this case. Finally, we determine the Han-Kobayashi achievable rate regions for both homodyne and heterodyne detection and compare them to a region achievable by a conjectured joint detection strategy. In these latter cases, we determine achievable rate regions if the receivers employ a recently discovered minentropy quantum simultaneous decoder. Saikat Guha 0001, Ivan Savov, Mark M. Wilde |
ISIT | 2 |