sensing

Homomorphic Aggregation of Continuous-Variable GKP States

Curator's Take

AI Commentary

This article tackles a long‑standing obstacle in continuous‑variable quantum networks by showing how to add logical information encoded in Gottesman‑Kitaev‑Preskill states without destroying the non‑Gaussian code space, using measurement‑based GKP Bell pairs and homodyne feed‑forward. By delivering an explicit completely positive trace‑preserving map that acts as an approximate QND sum, it bridges recent advances in fault‑tolerant CV error correction with practical distributed computing and sensing protocols, while quantifying the impact of finite squeezing on fidelity and cryptographic leakage. The result opens a realistic pathway to scalable CV quantum communication, provided high‑quality GKP resources and low‑loss feed‑forward can be realized experimentally.

— Mark Eatherly

Summary

Aggregating logical quantum information encoded in continuous-variable phase space is essential for distributed quantum computing. However, passive linear optics fail for non-Gaussian Gottesman-Kitaev-Preskill (GKP) codes due to symplectic lattice compression and entanglement-induced decoherence. We present an active, measurement-based framework for the homomorphic aggregation of multi-node GKP states. Utilizing GKP Bell states and homodyne feed-forward, we construct a completely positive trace-preserving map that computes the logical sum of distributed states while preserving the logical code space geometry up to correctable finite-squeezing deformations. We prove this protocol operates as an approximate quantum non-demolition measurement, bound its cryptographic leakage for continuous one-time pads, and derive analytical logical fidelity limits under finite-squeezing constraints.