David Elkouss

Orcid: 0000-0003-2023-2768

Affiliations:
  • TU Delft, The Netherlands


According to our database1, David Elkouss authored at least 31 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Near-Term n to k Distillation Protocols Using Graph Codes.
IEEE J. Sel. Areas Commun., July, 2024

Pseudo-Entanglement is Necessary for EFI Pairs.
CoRR, 2024

Simultaneous Basis and Information Reconciliation in Quantum Key Distribution.
IEEE Access, 2024

2023
Noise estimation in an entanglement distillation protocol.
SIGMETRICS Perform. Evaluation Rev., September, 2023

The First Workshop on Quantum Systems and Computations (2023).
SIGMETRICS Perform. Evaluation Rev., September, 2023

GHZ distillation protocols in the presence of decoherence.
SIGMETRICS Perform. Evaluation Rev., September, 2023

LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States.
Quantum, September, 2023

Noise is resource-contextual in quantum communication.
CoRR, 2023

Micro-architecture and Control Electronics Simulation of Modular Color Center-Based Quantum Computers.
Proceedings of the Embedded Computer Systems: Architectures, Modeling, and Simulation, 2023

Low-Depth Flag-Style Syndrome Extraction for Small Quantum Error-Correction Codes.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

2022
Enumerating all bilocal Clifford distillation protocols through symmetry reduction.
Quantum, 2022

2020
Efficient Computation of the Waiting Time and Fidelity in Quantum Repeater Chains.
IEEE J. Sel. Areas Commun., 2020

Tools for quantum network design.
CoRR, 2020

Efficient Optimization of Cut-offs in Quantum Repeater Chains.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020

2017
Fundamental finite key limits for one-way information reconciliation in quantum key distribution.
Quantum Inf. Process., 2017

2016
Forgetting boosts the classical environment-assisted and private capacity.
CoRR, 2016

Uncomputability of the generalized capacity.
CoRR, 2016

2015
Superadditivity of private information for any number of uses of the channel.
CoRR, 2015

Quantum Capacity Can Be Greater Than Private Information for Arbitrarily Many Uses.
Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015

2014
Fundamental finite key limits for information reconciliation in quantum key distribution.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Secure Optical Networks Based on Quantum Key Distribution and Weakly Trusted Repeaters.
JOCN, 2013

Analysis of a rate-adaptive reconciliation protocol and the effect of the leakage on the secret key rate
CoRR, 2013

2012
Untainted Puncturing for Irregular Low-Density Parity-Check Codes.
IEEE Wirel. Commun. Lett., 2012

Blind reconciliation.
Quantum Inf. Comput., 2012

2011
Information reconciliation for QKD.
Quantum Inf. Comput., 2011

2010
Improved Construction of Irregular Progressive Edge-Growth Tanner Graphs.
IEEE Commun. Lett., 2010

Interactive Reconciliation with Low-Density Parity-Check Codes
CoRR, 2010

Rate Compatible Protocol for Information Reconciliation: An application to QKD
CoRR, 2010

Secure rate-adaptive reconciliation.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009
QKD in Standard Optical Telecommunications Networks.
Proceedings of the Quantum Communication and Quantum Networking, 2009

Efficient reconciliation protocol for discrete-variable quantum key distribution.
Proceedings of the IEEE International Symposium on Information Theory, 2009


  Loading...