Compare Papers

Paper 1

High-throughput GPU layered decoder of quasi-cyclic multi-edge type low density parity check codes in continuous-variable quantum key distribution systems

Yang Li, Xiaofang Zhang, Yong Li, Bingjie Xu, Li Ma, Jie Yang, Wei Huang

Year

2020

Journal

Scientific Reports

DOI

10.1038/s41598-020-71534-5

arXiv

-

Abstract The decoding throughput during post-processing is one of the major bottlenecks that occur in a continuous-variable quantum key distribution (CV-QKD) system. In this paper, we propose a layered decoder to decode quasi-cyclic multi-edge type LDPC (QC-MET-LDPC) codes using a graphics processing unit (GPU) in continuous-variable quantum key distribution (CV-QKD) systems. As described herein, we optimize the storage methods related to the parity check matrix, merge the sub-matrices which are unrelated, and decode multiple codewords in parallel on the GPU. Simulation results demonstrate that the average decoding speed of LDPC codes with three typical code rates, i.e., 0.1, 0.05 and 0.02, is up to 64.11 Mbits/s, 48.65 Mbits/s and 39.51 Mbits/s, respectively, when decoding 128 codewords of length $${10}^{{6}}$$ 10 6 simultaneously without early termination.

Open paper

Paper 2

Critical properties of the Anderson transition in random graphs: two-parameter scaling theory, Kosterlitz-Thouless type flow and many-body localization

Ignacio García-Mata, John Martin, Olivier Giraud, Bertrand Georgeot, Rémy Dubertrand, Gabriel Lemarié

Year

2022

Journal

arXiv preprint

DOI

arXiv:2209.04337

arXiv

2209.04337

The Anderson transition in random graphs has raised great interest, partly because of its analogy with the many-body localization (MBL) transition. Unlike the latter, many results for random graphs are now well established, in particular the existence and precise value of a critical disorder separating a localized from an ergodic delocalized phase. However, the renormalization group flow and the nature of the transition are not well understood. In turn, recent works on the MBL transition have made the remarkable prediction that the flow is of Kosterlitz-Thouless type. Here we show that the Anderson transition on graphs displays the same type of flow. Our work attests to the importance of rare branches along which wave functions have a much larger localization length $ξ_\parallel$ than the one in the transverse direction, $ξ_\perp$. Importantly, these two lengths have different critical behaviors: $ξ_\parallel$ diverges with a critical exponent $ν_\parallel=1$, while $ξ_\perp$ reaches a finite universal value ${ξ_\perp^c}$ at the transition point $W_c$. Indeed, $ξ_\perp^{-1} \approx {ξ_\perp^c}^{-1} + ξ^{-1}$, with $ξ\sim (W-W_c)^{-ν_\perp}$ associated with a new critical exponent $ν_\perp = 1/2$, where $\exp( ξ)$ controls finite-size effects. The delocalized phase inherits the strongly non-ergodic properties of the critical regime at short scales, but is ergodic at large scales, with a unique critical exponent $ν=1/2$. This shows a very strong analogy with the MBL transition: the behavior of $ξ_\perp$ is identical to that recently predicted for the typical localization length of MBL in a phenomenological renormalization group flow. We demonstrate these important properties for a smallworld complex network model and show the universality of our results by considering different network parameters and different key observables of Anderson localization.

Open paper