Demo Data from VLDB 2026 / reviewers in the wild / expert
A. Abeyesinghe
dblp:89/408
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 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
1 paper |
Quantum computing and quantum information · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information
quantum communication |
0.1 | 1 | 2006 | Optimal Superdense Coding of Entangled States · IEEE Trans. Inf. Theory 2006 |
Quantum computing and quantum information
quantum entanglement |
0.1 | 1 | 2006 | Optimal Superdense Coding of Entangled States · IEEE Trans. Inf. Theory 2006 |
Quantum computing and quantum information › quantum communication
superdense coding |
0.1 | 1 | 2006 | Optimal Superdense Coding of Entangled States · IEEE Trans. Inf. Theory 2006 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Optimal Superdense Coding of Entangled StatesabstractIn this paper, we present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a$2l$-qubit quantum state could be communicated to a receiver by physically transmitting only$l+o(l)$qubits in addition to consuming$l$ebits of entanglement and some shared randomness. When the states to be prepared are entangled, we find that there is a reduction in the number of qubits that need to be transmitted, interpolating between no communication at all for maximally entangled states and the earlier two-for-one result of the unentangled case, all without the use of any shared randomness. We also present two applications of our result: a direct proof of the achievability of the optimal superdense coding protocol for entangled states produced by a memoryless source, and a demonstration that the quantum identification capacity of an ebit is two qubits. A. Abeyesinghe, Patrick M. Hayden, Graeme Smith 0002, Andreas J. Winter 0002 |
IEEE Trans. Inf. Theory | 1 |