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

Kyrylo Simonov

dblp:195/6102 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0001-6764-8555ORCID · verified

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

Computer networks · 1 · 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 · 87% Information theory · 13%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum channel capacity
quantum capacity
0.712023
Beyond Shannon Limits: Quantum Communications Through Quantum Paths · IEEE J. Sel. Areas Commun. 2023
Quantum computing and quantum information
quantum communication
0.712023
Beyond Shannon Limits: Quantum Communications Through Quantum Paths · IEEE J. Sel. Areas Commun. 2023
Information theory › channel capacity
capacity bounds
0.212023
Beyond Shannon Limits: Quantum Communications Through Quantum Paths · IEEE J. Sel. Areas Commun. 2023

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

upper and lower bound analysis · 0.7
YearPublicationVenuePosition
2023 Beyond Shannon Limits: Quantum Communications Through Quantum Paths
abstract
A crucial step towards the 6th generation (6G) of networks would be a shift in communication paradigm beyond the limits of Shannon’s theory. In both classical and quantum Shannon’s information theory, communication channels are generally assumed to combine throughclassical trajectories, so that the associated network path traversed by the information carrier is well-defined. Counter-intuitively, quantum mechanics enables a quantum information carrier to propagate through aquantum path, i.e., through a path such that the causal order of the constituting communications channels becomes indefinite. Quantum paths exhibit astonishing features, such as providing non-null capacity even when no information can be sent through any classical path. In this paper, we study the quantum capacity achievable via a quantum path and establish upper and the lower bounds for it. Our findings reveal the substantial advantage achievable with a quantum path over any classical placements of communications channels in terms of ultimate achievable communication rates. Furthermore, we identify the region where a quantum path incontrovertibly outperforms the amount of transmissible information beyond the limits of conventional quantum Shannon’s theory, and we quantify this advantage over classical paths through a conservative estimate.
Marcello Caleffi, Kyrylo Simonov, Angela Sara Cacciapuoti
IEEE J. Sel. Areas Commun.2
2017 Visual Query Combinators for BioMedical Query Mediation
Clark C. Evans, Charles Tirrell, Oleksiy Golovko, Andrey Popp, Jason Simeone, Kyrylo Simonov
AMIA6