Related Experiment Video
Updated: May 24, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Neural-Network-Based Design of Approximate Gottesman-Kitaev-Preskill Code
Yexiong Zeng1,2, Wei Qin1,3,4, Ye-Hong Chen1,2,5,6
1RIKEN, Theoretical Quantum Physics Laboratory, Cluster for Pioneering Research, Wakoshi, Saitama 351-0198, Japan.
Neural networks optimize Gottesman-Kitaev-Preskill (GKP) encoding for quantum computing. Optimized GKP codes use fewer squeezed states, improving error correction and reducing complexity.
Area of Science:
- Quantum Information Science
- Quantum Computing
- Quantum Error Correction
Background:
- Gottesman-Kitaev-Preskill (GKP) encoding is crucial for continuous-variable fault-tolerant quantum computing.
- Ideal GKP encoding is nonphysical; approximate versions are practical but complex.
- Conventional approximate GKP states require multiple squeezed coherent states, complicating preparation.
Purpose of the Study:
- To minimize the tradeoff between codeword complexity and error correction capability in approximate GKP states.
- To develop a method for generating optimal approximate GKP states using neural networks.
- To enhance the performance of GKP codes for quantum error correction.
Main Methods:
- Utilized a neural network to generate optimal approximate GKP states.
- Compared the performance of optimized GKP codes against conventional ones.
- Analyzed the number of squeezed coherent states required and stabilizer operator complexity.
Main Results:
- Optimized GKP codes outperform conventional codes.
- Achieved effective error correction with significantly fewer squeezed coherent states.
- Demonstrated a reduction to one-third the number of squeezed coherent states at 9.55 dB squeezing.
Conclusions:
- Neural network optimization drastically reduces the complexity of GKP codewords.
- Optimized GKP codes offer improved error correctability compared to conventional methods.
- This approach paves the way for more practical fault-tolerant quantum computing.
Related Concept Videos
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Network Function of a Circuit
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Ampere-Maxwell's Law: Problem-Solving
To solve the problem, we can use the equations from the analysis of an RC circuit and Maxwell's version of Ampère's law.
For the first part of...
Ampere's Law: Problem-Solving
Specific steps need to be considered while calculating the symmetric magnetic field distribution...

