Efficient information reconciliation for high-dimensional quantum key distribution
From MaRDI portal
Publication:6550823
DOI10.1007/S11128-024-04395-WzbMATH Open1542.81393MaRDI QIDQ6550823FDOQ6550823
Authors: Ronny Mueller, Domenico Ribezzo, Mujtaba Zahidy, Leif Katsuo Oxenløwe, Davide Bacco, Søren Forchhammer
Publication date: 5 June 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
Recommendations
- Improved information reconciliation with systematic polar codes for continuous variable quantum key distribution
- High performance reconciliation for continuous-variable quantum key distribution with LDPC code
- scientific article
- An improved multidimensional reconciliation algorithm for continuous-variable quantum key distribution
- Rate-adaptive reconciliation with polar coding for continuous-variable quantum key distribution
Cites Work
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Quantum cryptography: public key distribution and coin tossing
- Title not available (Why is that?)
- Privacy Amplification by Public Discussion
- The capacity of low-density parity-check codes under message-passing decoding
- Noiseless coding of correlated information sources
- Regular and irregular progressive edge-growth tanner graphs
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
- Reconciliation of a Quantum-Distributed Gaussian Key
- Blind Reconciliation
- Fundamental finite key limits for one-way information reconciliation in quantum key distribution
- Fundamentals of classical and modern error-correcting codes
- Density Evolution for Nonbinary LDPC Codes Under Gaussian Approximation
Cited In (2)
This page was built for publication: Efficient information reconciliation for high-dimensional quantum key distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550823)