LiDMaS: Architecture-Level Modeling of Fault-Tolerant Magic-State Injection in GKP Photonic Qubits

• URL: http://arxiv.org/abs/2601.16244v1
• Date: Thu, 22 Jan 2026 12:31:50 GMT
• Title: LiDMaS: Architecture-Level Modeling of Fault-Tolerant Magic-State Injection in GKP Photonic Qubits
• Authors: Dennis Delali Kwesi Wayo,
• Abstract summary: Fault-tolerant quantum computation in photonic architectures relies on the efficient preparation of high-fidelity logical magic states.<n>We study logical T-gate magic-state preparation in GKP-encoded photonic qubits using a repeat-until-success injection protocol.<n>We find that success probabilities exceed 0.94 across all studied parameters, with an average overhead close to unity.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fault-tolerant quantum computation in photonic architectures relies on the efficient preparation of high-fidelity logical magic states under realistic constraints imposed by finite squeezing and photon loss. In this work, we study logical T-gate magic-state preparation in GKP-encoded photonic qubits using a repeat-until-success injection protocol combined with outer surface-code protection. We develop an architecture-level modeling framework based on a lightweight density-matrix simulator implemented with standard numerical linear algebra. Finite squeezing is mapped to effective logical dephasing, depolarizing noise is included at the logical level, and photon loss is treated as a heralded erasure process. This approach avoids explicit continuous-variable wavefunction simulation, hardware-specific photonic models, and quantum software frameworks, enabling transparent and computationally efficient exploration of architectural trade-offs. We perform systematic parameter sweeps over squeezing values from 8 to 16 dB, baseline loss probabilities between 0.01 and 0.03, and surface-code distances d = 1, 3, 5, and 7. Across this regime, we evaluate repeat-until-success probability, average injection overhead, and logical magic-state fidelity. We find that success probabilities exceed 0.94 across all studied parameters, with an average overhead close to unity. After outer-code protection, logical fidelities reach approximately 0.77 to 0.80 and show weak sensitivity to moderate photon loss but a strong dependence on squeezing. Phase-boundary analysis identifies minimum squeezing requirements needed to simultaneously achieve high success probability and logical fidelity. These results provide quantitative design guidance for scalable photonic fault-tolerant quantum architectures.

Related papers

• 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)
• HAD: Hierarchical Asymmetric Distillation to Bridge Spatio-Temporal Gaps in Event-Based Object Tracking [80.07224739976911]
  Event cameras offer exceptional temporal resolution and a range (modal)<n> RGB cameras excel at capturing rich texture with high resolution, whereas event cameras offer exceptional temporal resolution and a range (modal)
  arXiv  Detail & Related papers  (2025-10-22T13:15:13Z)
• To Compress or Not? Pushing the Frontier of Lossless GenAI Model Weights Compression with Exponent Concentration [46.63567524455431]
  Low-precision floating-point formats provide stability, memory savings, and hardware efficiency without dequantization overhead.<n>We propose Exponent-Concentrated FP8 (ECF8), a compression framework with entropy-aware encoding and GPU-optimized decoding.<n>Experiments on LLMs and DiTs up to 671B parameters demonstrate up to 26.9% memory savings and 177.1% throughput acceleration.
  arXiv  Detail & Related papers  (2025-10-03T02:22:13Z)
• Practical blueprint for low-depth photonic quantum computing with quantum dots [0.0]
  Fusion-based quantum computing is an attractive model for fault-tolerant computation based on photonics.<n>We propose a complete blueprint for a photonic quantum computer using quantum dots and linear optics.<n>It features time-bin qubit encoding, reconfigurable entangled-photon sources, and a fusion-based architecture with low optical connectivity.
  arXiv  Detail & Related papers  (2025-07-22T01:59:25Z)
• Distributed Quantum Neural Networks on Distributed Photonic Quantum Computing [3.299179876684316]
  Photonic quantum neural networks (QNNs) with $M(M+1)/2$ trainable parameters produce high-dimensional probability distributions.<n>Photonic QT achieves an accuracy of $95.50% pm 0.84%$ using 3,292 parameters.<n>Photonic QT outperforms classical compression techniques by 6--12% absolute accuracy.
  arXiv  Detail & Related papers  (2025-05-13T11:58:45Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• Tailoring fusion-based photonic quantum computing schemes to quantum emitters [0.0]
  Fusion-based quantum computation is a promising quantum computing model where small-sized photonic resource states are simultaneously entangled and measured by fusion gates.<n>Here, we propose fusion-based architectures tailored to the capabilities and noise models in quantum emitters.<n>We show that high tolerance to dominant physical error mechanisms can be achieved, with fault-tolerance thresholds of 8% for photon loss, 4% for photon distinguishability between emitters, and spin noise thresholds well above memory-induced errors.
  arXiv  Detail & Related papers  (2024-10-09T11:31:49Z)
• Protecting the quantum interference of cat states by phase-space compression [45.82374977939355]
  Cat states with their unique phase-space interference properties are ideal candidates for understanding quantum mechanics. They are highly susceptible to photon loss, which inevitably diminishes their quantum non-Gaussian features. Here, we protect these non-Gaussian features by compressing the phase-space distribution of a cat state.
  arXiv  Detail & Related papers  (2022-12-02T16:06:40Z)
• Parity-encoding-based quantum computing with Bayesian error tracking [0.0]
  Measurement-based quantum computing (MBQC) in linear optical systems is promising for near-future quantum computing architecture. We propose a linear optical topological MBQC protocol employing multiphoton qubits based on the parity encoding. We show that our protocol is advantageous over several other existing approaches in terms of fault-tolerance, resource overhead, or feasibility of basic elements.
  arXiv  Detail & Related papers  (2022-07-14T10:32:05Z)
• Fault-tolerant quantum computation with static linear optics [0.0]
  In this work we propose a topologically error-corrected architecture that does away with these elements at no cost. Our computer consists of three modules: a 2D array of probabilistic sources of GKP states; a depth-four circuit of static beamsplitters, phase shifters, and single-time-step delay lines. The symmetry of our proposed circuit allows us to combine the effects of finite squeezing and uniform photon loss within the noise model, resulting in more comprehensive threshold estimates.
  arXiv  Detail & Related papers  (2021-04-07T16:43:34Z)
• Fusion-based quantum computation [43.642915252379815]
  Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
  arXiv  Detail & Related papers  (2021-01-22T20:00:22Z)

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.