EDBT 2026 Demo / reviewers in the wild / expert
Xinan Chen 0003
dblp:224/5013-3
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0004-5500-0849ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information › quantum entanglement
entanglement distillation |
1.0 | 1 | 2026 | Capacities of Entanglement Distribution From a Central Source · IEEE Trans. Inf. Theory 2026 |
Quantum computing and quantum information › quantum network
entanglement distribution |
1.0 | 1 | 2026 | Capacities of Entanglement Distribution From a Central Source · IEEE Trans. Inf. Theory 2026 |
Quantum computing and quantum information
quantum channel |
1.0 | 1 | 2026 | Capacities of Entanglement Distribution From a Central Source · IEEE Trans. Inf. Theory 2026 |
Quantum computing and quantum information
quantum communication |
1.0 | 1 | 2026 | Capacities of Entanglement Distribution From a Central Source · IEEE Trans. Inf. Theory 2026 |
Quantum computing and quantum information
quantum network |
0.3 | 1 | 2026 | Capacities of Entanglement Distribution From a Central Source · IEEE Trans. Inf. Theory 2026 |
Methods — techniques the papers use, named apart from their topics
quantum communication code · 1.0local operations and classical communication · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Capacities of Entanglement Distribution From a Central SourceabstractDistribution of entanglement is an essential task in quantum information processing and the realization of quantum networks. In our work, we theoretically investigate the scenario where a central source prepares anN-partite entangled state and transmits each entangled subsystem to one ofNreceivers through noisy quantum channels. The receivers are then able to perform local operations assisted by unlimited classical communication to distill target entangled states from the noisy channel output. In this operational context, we define the EPR distribution capacity and the GHZ distribution capacity of a quantum channel as the largest rates at which Einstein-Podolsky-Rosen (EPR) states and Greenberger-Horne-Zeilinger (GHZ) states can be faithfully distributed through the channel, respectively. We establish lower and upper bounds on the EPR distribution capacity by connecting it with the task of assisted entanglement distillation. We also construct an explicit protocol consisting of a combination of a quantum communication code and a classical-post-processing-assisted entanglement generation code, which yields a simple achievable lower bound for generic channels. As applications of these results, we give an exact expression for the EPR distribution capacity over two erasure channels and bounds on the EPR distribution capacity over two generalized amplitude damping channels. We also bound the GHZ distribution capacity, which results in an exact characterization of the GHZ distribution capacity when the most noisy channel is a dephasing channel. Xinan Chen 0003, Stefano Chessa, Ian George, Felix Leditzky, Eric Chitambar |
IEEE Trans. Inf. Theory | 1 |
| 2025 | Capacities of Entanglement Distribution from a Central SourceabstractDistribution of entanglement is an essential task in quantum information processing and the realization of quantum networks. In our work, we theoretically investigate the scenario where a central source prepares an N-partite entangled state and transmits each entangled subsystem to one of$N$receivers through noisy quantum channels. The receivers are then able to perform local operations assisted by unlimited classical communication to distill target entangled states from the noisy channel output. In this operational context, we define the EPR distribution capacity and the GHZ distribution capacity of a quantum channel as the largest rates at which Einstein-Podolsky-Rosen (EPR) states and Greenberger-Horne-Zeilinger (GHZ) states can be faithfully distributed through the channel, respectively. We establish lower and upper bounds on the EPR distribution capacity by connecting it with the task of assisted entanglement distillation. We also construct an explicit protocol consisting of a combination of a quantum communication code and a classical-post-processing-assisted entanglement generation code, which yields a simple achievable lower bound for generic channels. As applications of these results, we give an exact expression for the EPR distribution capacity over two erasure channels and bounds on the EPR distribution capacity over two generalized amplitude damping channels. We also bound the GHZ distribution capacity, which results in an exact characterization of the GHZ distribution capacity when the most noisy channel is a dephasing channel. Xinan Chen 0003, Stefano Chessa, Ian George, Felix Leditzky, Eric Chitambar |
ISIT | 1 |
| 2021 | The Twelvefold Way of Non-Sequential Lossless CompressionabstractMany information sources are not just sequences of distinguishable symbols but rather have invariances governed by alternative counting paradigms such as permutations, combinations, and partitions. We consider an entire classification of these invariances called the twelvefold way in enumerative combinatorics and develop a method to characterize lossless compression limits. Explicit computations for all twelve settings are carried out for i.i.d. uniform and Bernoulli distributions. Comparisons among settings provide quantitative insight. Taha Ameen ur Rahman, Alton S. Barbehenn, Xinan Chen 0003, Hassan Dbouk, James A. Douglas, Yuncong Geng, Ian George, John B. Harvill, Sung Woo Jeon, Kartik K. Kansal, Kiwook Lee, Kelly A. Levick, Bochao Li, Yashaswini Murthy, Adarsh Muthuveeru-Subramaniam, S. Yagiz Olmez, Matthew J. Tomei, Tanya Veeravalli, Xuechao Wang, Eric A. Wayman, Fan Wu 0011, Heling Zhang, Sourya Basu, Lav R. Varshney |
DCC | 3 |