Papers › Exploring the quantum capacity of a Gaussian random displacement channel using...
Exploring the quantum capacity of a Gaussian random displacement channel using Gottesman-Kitaev-Preskill codes and maximum likelihood decoding
Mao Lin, Kyungjoo Noh
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Determining the quantum capacity of a noisy quantum channel is an important problem in the field of quantum communication theory. In this work, we consider the Gaussian random displacement channel N_σ, a type of bosonic Gaussian channels relevant in various bosonic quantum information processing systems. In particular, we attempt to make progress on the problem of determining the quantum capacity of a Gaussian random displacement channel by analyzing the error-correction performance of several families of multi-mode Gottesman-Kitaev-Preskill (GKP) codes. In doing so we analyze the surface-square GKP codes using an efficient and exact maximum likelihood decoder (MLD) up to a large code distance of d=39. We find that the error threshold of the surface-square GKP code is remarkably close to σ=1/√(e)≃0.6065 at which the best-known lower bound of the quantum capacity of N_σ vanishes. We also analyze the performance of color-hexagonal GKP codes up to a code distance of d=13 using a tensor-network decoder serving as an approximate MLD. By focusing on multi-mode GKP codes that encode just one logical qubit over multiple bosonic modes, we show that GKP codes can achieve non-zero quantum state transmission rates for a Gaussian random displacement channel N_σ at larger values of σ than previously demonstrated. Thus our work reduces the gap between the quantum communication theoretic bounds and the performance of explicit bosonic quantum error-correcting codes in regards to the quantum capacity of a Gaussian random displacement channel.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections