Sumeet Khatri

dblp:250/9671 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-9858-0511ORCID · corroborated

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

Theory of computation · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum channel capacity
classical capacity
0.712023
Bounding the Forward Classical Capacity of Bipartite Quantum Channels · IEEE Trans. Inf. Theory 2023
Quantum computing and quantum information
quantum channel capacity
0.712023
Bounding the Forward Classical Capacity of Bipartite Quantum Channels · IEEE Trans. Inf. Theory 2023

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

semidefinite programming · 0.7
YearPublicationVenuePosition
2023 Bounding the Forward Classical Capacity of Bipartite Quantum Channels
abstract
We introduce various measures of forward classical communication for bipartite quantum channels. Since a point-to-point channel is a special case of a bipartite channel, the measures reduce to measures of classical communication for point-to-point channels. As it turns out, these reduced measures have been reported in prior work of Wang et al. on bounding the classical capacity of a quantum channel. As applications, we show that the measures are upper bounds on the forward classical capacity of a bipartite channel. The reduced measures are upper bounds on the classical capacity of a point-to-point quantum channel assisted by a classical feedback channel. Some of the various measures can be computed by semi-definite programming.
Dawei Ding 0002, Sumeet Khatri, Yihui Quek, Peter W. Shor, Xin Wang 0022, Mark M. Wilde
IEEE Trans. Inf. Theory2
2021 Upper bound on the classical capacity of a quantum channel assisted by classical feedback
abstract
We introduce various measures of forward classical communication for bipartite quantum channels. Since a point-to-point channel is a special case of a bipartite channel, the measures reduce to measures of classical communication for point-to-point channels. As it turns out, these reduced measures have been reported in prior work of Wang et al. on bounding the classical capacity of a quantum channel. As an application, we show that the reduced measures are upper bounds on the classical capacity of a point-to-point quantum channel assisted by a classical feedback channel. Some of the various measures can be computed by semi-definite programming.
Dawei Ding 0002, Sumeet Khatri, Yihui Quek, Peter W. Shor, Xin Wang 0022, Mark M. Wilde
ISIT2