Satvik Singh

dblp:292/7129 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-2971-4256ORCID · corroborated

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

Theory of computation · 2 · 2 first-author · 2 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
2 papers
Quantum computing and quantum information · 93% Algorithmic game theory and mechanism design · 7%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum channel capacity
0.912025
Simultaneous Superadditivity of the Direct and Complementary Channel Capacities · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum channel capacity
superadditivity
0.912025
Simultaneous Superadditivity of the Direct and Complementary Channel Capacities · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum entanglement
distillable entanglement
0.712023
Fully Undistillable Quantum States Are Separable · IEEE Trans. Inf. Theory 2023
Quantum computing and quantum information
quantum entanglement
0.712023
Fully Undistillable Quantum States Are Separable · IEEE Trans. Inf. Theory 2023
Algorithmic game theory and mechanism design › mechanism design
private information
0.312025
Simultaneous Superadditivity of the Direct and Complementary Channel Capacities · IEEE Trans. Inf. Theory 2025
YearPublicationVenuePosition
2025 Simultaneous Superadditivity of the Direct and Complementary Channel Capacities
abstract
Quantum communication channels differ from their classical counterparts because their capacities can be superadditive. The principle of monogamy of entanglement suggests that superadditive improvements in the transmission capacity of a channel should reduce the amount of information loss to the environment. We challenge this intuition by demonstrating that the coherent and private information of a channel and its complement can be simultaneously superadditive for arbitrarily many channel uses. To quantify the limits of this effect, we consider the notion of max (resp. total) private information of a channel, which represents the maximum (resp. sum) of the private information of the channel itself and its complement, and study its relationship with the coherent information of the individual direct and complementary channels. We show that these quantities can obey different interleaving sequences of inequalities for a varying number of channel uses.
Satvik Singh, Sergii Strelchuk
IEEE Trans. Inf. Theory1
2023 Fully Undistillable Quantum States Are Separable
abstract
Assume that Alice, Bob, and Charlie share a tripartite pure state$ \vert \psi _{ABC}\rangle $. We prove that if Alice cannot distill entanglement with either Bob or Charlie using$ \vert \psi _{ABC}\rangle $and local operations with any one of the following configurations for classical communication:$(A\to B, A\leftrightarrow C), (A\leftrightarrow B, A\to C)$, and$(A\leftrightarrow B, A\leftrightarrow C)$, then the same is also true for the other two configurations. Moreover, this happens precisely when the state is such that both its reductions on systems$AB$and$AC$are separable, which is further equivalent to the reductions being PPT. This, in particular, implies that any NPT bipartite state is such that either the state itself or its complement is 2-way distillable. In proving these results, we first obtain an explicit lower bound on the 2-way distillable entanglement of low rank bipartite states. Furthermore, we show that even though not all low rank states are 1-way distillable, a randomly sampled low rank state will almost surely be 1-way distillable.
Satvik Singh, Nilanjana Datta
IEEE Trans. Inf. Theory1