Neural Network-Based Design of Approximate Gottesman-Kitaev-Preskill Code

• URL: http://arxiv.org/abs/2411.01265v1
• Date: Sat, 02 Nov 2024 14:34:24 GMT
• Title: Neural Network-Based Design of Approximate Gottesman-Kitaev-Preskill Code
• Authors: Yexiong Zeng, Wei Qin, Ye-Hong Chen, Clemens Gneiting, Franco Nori,
• Abstract summary: Gottesman-Kitaev-Preskill (GKP) encoding holds promise for continuous-variable fault-tolerant quantum computing. Conventional approximate GKP codewords are superpositions of multiple large-amplitude squeezed coherent states. We utilize a neural network to generate optimal approximate GKP states, allowing effective error correction with just a few squeezed coherent states.
• Score: 2.209911250765614
• License:
• Abstract: Gottesman-Kitaev-Preskill (GKP) encoding holds promise for continuous-variable fault-tolerant quantum computing. While an ideal GKP encoding is abstract and impractical due to its nonphysical nature, approximate versions provide viable alternatives. Conventional approximate GKP codewords are superpositions of multiple {large-amplitude} squeezed coherent states. This feature ensures correctability against single-photon loss and dephasing {at short times}, but also increases the difficulty of preparing the codewords. To minimize this trade-off, we utilize a neural network to generate optimal approximate GKP states, allowing effective error correction with just a few squeezed coherent states. We find that such optimized GKP codes outperform the best conventional ones, requiring fewer squeezed coherent states, while maintaining simple and generalized stabilizer operators. Specifically, the former outperform the latter with just \textit{one third} of the number of squeezed coherent states at a squeezing level of 9.55 dB. This optimization drastically decreases the complexity of codewords while improving error correctability.

Related papers

• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• The Near-optimal Performance of Quantum Error Correction Codes [2.670972517608388]
  We derive the near-optimal channel fidelity, a concise and optimization-free metric for arbitrary codes and noise. Compared to conventional optimization-based approaches, the reduced computational cost enables us to simulate systems with previously inaccessible sizes. We analytically derive the near-optimal performance for the thermodynamic code and the Gottesman-Kitaev-Preskill (GKP) code.
  arXiv  Detail & Related papers  (2024-01-04T01:44:53Z)
• Correcting biased noise using Gottesman-Kitaev-Preskill repetition code with noisy ancilla [0.6802401545890963]
  Gottesman-Kitaev-Preskill (GKP) code is proposed to correct small displacement error in phase space. If noise in phase space is biased, square-lattice GKP code can be ancillaryd with XZZX surface code or repetition code. We study the performance of GKP repetition codes with physical ancillary GKP qubits in correcting biased noise.
  arXiv  Detail & Related papers  (2023-08-03T06:14:43Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Biased Gottesman-Kitaev-Preskill repetition code [0.0]
  Continuous-variable quantum computing architectures based upon the Gottesmann-Kitaev-Preskill (GKP) encoding have emerged as a promising candidate. We study the code-capacity behaviour of a rectangular-lattice GKP encoding with a repetition code under an isotropic Gaussian displacement channel.
  arXiv  Detail & Related papers  (2022-12-21T22:56:05Z)
• A Stable, Fast, and Fully Automatic Learning Algorithm for Predictive Coding Networks [65.34977803841007]
  Predictive coding networks are neuroscience-inspired models with roots in both Bayesian statistics and neuroscience. We show how by simply changing the temporal scheduling of the update rule for the synaptic weights leads to an algorithm that is much more efficient and stable than the original one.
  arXiv  Detail & Related papers  (2022-11-16T00:11:04Z)
• Denoising Diffusion Error Correction Codes [92.10654749898927]
  Recently, neural decoders have demonstrated their advantage over classical decoding techniques. Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
  arXiv  Detail & Related papers  (2022-09-16T11:00:50Z)
• Enhancing distributed sensing with imperfect error correction [4.812718493682455]
  Entanglement has shown promise in enhancing information processing tasks in a sensor network, via distributed quantum sensing protocols. As noise is ubiquitous in sensor networks, error correction schemes based on Gottesman, Kitaev and Preskill (GKP) states are required to enhance the performance. Here, we extend the analyses of performance enhancement to finite squeezed GKP states in a heterogeneous noise model.
  arXiv  Detail & Related papers  (2022-01-17T16:42:17Z)
• Low overhead fault-tolerant quantum error correction with the surface-GKP code [60.44022726730614]
  We propose a highly effective use of the surface-GKP code, i.e., the surface code consisting of bosonic GKP qubits instead of bare two-dimensional qubits. We show that a low logical failure rate $p_L 10-7$ can be achieved with moderate hardware requirements.
  arXiv  Detail & Related papers  (2021-03-11T23:07:52Z)
• Efficient Concatenated Bosonic Code for Additive Gaussian Noise [0.0]
  Bosonic codes offer noise resilience for quantum information processing. We propose using a Gottesman-Kitaev-Preskill code to detect discard error-prone qubits and a quantum parity code to handle residual errors. Our work may have applications in a wide range of quantum computation and communication scenarios.
  arXiv  Detail & Related papers  (2021-02-02T08:01:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.