Finite-energy GKP-QPC architectures for photonic quantum memories and repeaters

• URL: http://arxiv.org/abs/2608.15620v1
• Date: Sun, 16 Aug 2026 08:38:38 GMT
• Title: Finite-energy GKP-QPC architectures for photonic quantum memories and repeaters
• Abstract summary: We study a $4.3d architecture in which each physical rail is a finitely squeezed Gottesman-Kitaev-Preskill (GKP) qubit transmitted through a pure-loss fiber segment.<n>We find a finite-squeezing threshold of $5.06,mathrmdB$ at zero propagation loss.<n>These results provide quantitative design rules for finite-squeezing GKP--QPC quantum memories and repeaters.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Photonic quantum networks require error-correction architectures that remain useful with finite-energy bosonic states, pure-loss fiber transmission, and explicit resource accounting. In this light, we study a concatenated architecture in which each physical rail is a finitely squeezed Gottesman--Kitaev--Preskill (GKP) qubit transmitted through a pure-loss fiber segment, corrected by teleportation-based GKP error correction with finitely squeezed ancillae, and decoded by an outer quantum parity code (QPC). The GKP layer converts continuous homodyne syndromes into effective rail-level Pauli marginals, while the QPC layer suppresses the residual qubit-level errors. For the concatenated code family considered here, we find a finite-squeezing threshold of $5.06\,\mathrm{dB}$ at zero propagation loss. In the memory setting, the QPC layer lowers the squeezing at which repeated error correction becomes beneficial from $6.7\,\mathrm{dB}$ for bare GKP correction to $5.2\,\mathrm{dB}$ for QPC$(3,3)$ and $4.3\,\mathrm{dB}$ for QPC$(5,5)$, and improves the average-fidelity ratio by up to $75$--$90\%$ in the relevant intermediate-noise regime. In the repeater setting, avoiding pre-amplification gives larger secret-key fractions at moderate squeezing, but also produces an optimal squeezing because highly squeezed GKP peaks become sensitive to loss-induced inward displacement. Resource-normalized rates show that QPC concatenation can exceed the repeaterless PLOB benchmark by orders of magnitude and extend the communication reach, at short repeater spacing, to distances of order $10^4$km with $14$dB squeezing. However, QPC concatenation becomes detrimental when each elementary hop is too lossy. These results provide quantitative design rules for finite-squeezing GKP--QPC quantum memories and repeaters.

Related papers

• Predicting Multipartite Entanglement in Quantum Circuits using Transformer [0.11242503819703259]
  Multipartite entanglement is a critical property of parameterized quantum circuits (PQCs)<n>We introduce a graph-based transformer surrogate that predicts both the first-order Meyer-Wallach measure ($Q$) and the second-order Scott measure ($Q$)<n>Our central contribution is the qubit-interconnected graph (QIG) encoding for transformers, where each node represents a qubit and weighted adjacencies record entangling-gate multiplicities.
  arXiv  Detail & Related papers  (2026-08-28T07:00:20Z)
• Investigating Quantum-Embedded Transformers on Classical Datasets for Cross-Modality Classification [1.472161528588343]
  We test whether a parameterized quantum circuit (PQC) improves a hybrid quantum-classical model's performance on classical datasets.<n>Our architecture, Quantum-Embedded Attention (QEA), uses a learnable projector to compress backbone features into an $n_q$-dimensional angle vector.<n>We report all planned canonical runs, distinguish current Pauli-readout results from legacy probability-readout experiments, and analyze bottleneck, simulation, finite-shot, and noise limitations.
  arXiv  Detail & Related papers  (2026-08-07T06:09:28Z)
• KroQuant: Kronecker-Structured Block Transforms for Efficient Post-Training Quantization of Diffusion Transformers [42.11461757540461]
  Post-training quantization of diffusion transformers (DiTs) to W4A4 severely degrades output quality.<n>We propose KroQuant, a PTQ method that applies a learned Kronecker-structured invertible transform to each 32-element block of the activation.
  arXiv  Detail & Related papers  (2026-07-23T15:52:20Z)
• GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation [5.886065213861507]
  A common remedy is to augment the quantized weights with a low-rank correction, leading to approximations of the form $Wapprox Q+LR$.<n>We propose GPTQ-intrinsic LoRA, a training-free algorithm that incorporates the low-rank correction directly into a GPTQ-style quantization pass.<n>Experiments on Qwen3 language models and DeiT vision transformers show that GPTQ-intrinsic LoRA improves over GPTQ and GPTQ followed by low-rank compensation.
  arXiv  Detail & Related papers  (2026-05-31T19:17:39Z)
• Do Quantum Transformers Help? A Systematic VQC Architecture Comparison on Tabular Benchmarks [2.005299372367689]
  Variational quantum circuits (VQCs) are a leading approach to quantum machine learning on near-term devices.<n>We compare four VQC families -- multi-layer fully-connected (FC-VQC), residual (ResNet-VQC), hybrid quantum-classical transformer (QT), and fully quantum transformer (FQT)<n>FC-VQCs achieve 90-96% of the $R2$ of attention-based VQCs while using 40-50% fewer parameters.<n>These findings provide practical architectural guidance for deploying VQCs on near-term quantum hardware.
  arXiv  Detail & Related papers  (2026-04-27T01:13:14Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

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.