Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exploring the quantum capacity of a Gaussian random displacement channel using Gottesman-Kitaev-Preskill codes and maximum likelihood decoding

Published 6 Nov 2024 in quant-ph | (2411.04277v2)

Abstract: 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_{\sigma}$, 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 $\sigma=1/\sqrt{e}\simeq 0.6065$ at which the best-known lower bound of the quantum capacity of $N_{\sigma}$ 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_{\sigma}$ at larger values of $\sigma$ 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.