Pulse-Level Compilation of Measurement-Free Recovery in Transmon Circuits

• URL: http://arxiv.org/abs/2609.16133v1
• Date: Mon, 14 Sep 2026 18:00:03 GMT
• Title: Pulse-Level Compilation of Measurement-Free Recovery in Transmon Circuits
• Abstract summary: We numerically show that the conditional spectrum of an interacting transmon circuit can compile a local recovery rule into a fixed open-loop control cycle.<n>Its local, bounded-degree architecture provides a hardware-native framework for extending compiled recovery control to larger quantum networks.
• Score: 16.85262980151604
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction commonly relies on syndrome measurement, decoding, and conditional feedback. We numerically show that the conditional spectrum of an interacting transmon circuit can compile a local recovery rule into a fixed open-loop control cycle. In a four-bit repetition-code ring, the resulting input-independent control slows the decay of logical coherence under Pauli-\(X\) noise and stabilizes logical-one population under data relaxation relative to uncorrected references. Its local, bounded-degree architecture provides a hardware-native framework for extending compiled recovery control to larger quantum networks.

Related papers

• Characterizing Large Scale Quantum Systems with Error Per Circuit Layer [0.23398054718043335]
  We introduce Error Per Circuit Layer (EPCL), an overlap-based circuit-level benchmark that estimates an effective layer polarization.<n>We derive the expected overlap decay under an ensemble-averaged depolarizing model and identify the assumptions under which the fitted decay parameter represents an effective layer polarization.<n>Experiments on IBM quantum hardware demonstrate clear EPCL decay in 8- and 16-qubit implementations.
  arXiv  Detail & Related papers  (2026-09-03T17:28:40Z)
• An Entanglement-Assisted Stabilizer Framework for Distributed Sensing of Local Phases [0.15293427903448018]
  Distributed quantum sensing requires spatially separated probes to acquire local parameters.<n>We develop an entanglement-assisted stabilizer framework based on the extended structure of entanglement-assisted quantum error-correcting codes.
  arXiv  Detail & Related papers  (2026-09-02T04:38:00Z)
• Measurement-Based Loss Tolerance in Graph-GKP Codes through Syndrome-Resolved Pauli-Frame Decoding [46.2474896050764]
  We develop a causal framework that unifies these mechanisms for measurement-based loss tolerance under pure loss.<n>We derive decoder-conditioned branch restriction, signed-outcome reconstruction, Pauli-frame updating, and syndrome-resolved logical fusion.<n>The resulting graph-GKP interface provides a unified causal control layer for fault-tolerant MBQC, fusion-based computation, and all-photonic repeaters.
  arXiv  Detail & Related papers  (2026-08-01T19:14:42Z)
• JSCGC: Joint Source-Channel-Generation Coding for Wireless Generative Communications [58.67925548779465]
  Joint Source-Channel-Generation Coding (JSCGC) is a generative communication paradigm that replaces the conventional decoder with a generative model at the receiver.<n>JSCGC consistently improves feature-based, semantic-level, and inferenceal quality across diverse channel conditions.
  arXiv  Detail & Related papers  (2026-06-11T03:42:03Z)
• Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder [11.81591184245689]
  We report a hardware-integrated control architecture featuring an FPGA-based neural-network (NN) decoder.<n>We experimentally demonstrate real-time surface-code (distance-3) QEC on a superconducting quantum processor.<n>We show that real-time decoding and feedback correction achieve logical performance comparable to offline decoding.
  arXiv  Detail & Related papers  (2026-05-06T13:24:10Z)
• 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)
• Verifying Closed-Loop Contractivity of Learning-Based Controllers via Partitioning [52.23804865017831]
  We address the problem of verifying closed-loop contraction in nonlinear control systems whose controller and contraction metric are both parameterized by neural networks.<n>We derive a tractable and scalable sufficient condition for closed-loop contractivity that reduces to checking that the dominant eigenvalue of a symmetric Metzler matrix is nonpositive.
  arXiv  Detail & Related papers  (2025-12-01T23:06:56Z)
• Measurement-Based Entanglement Distillation and Constant-Rate Quantum Repeaters over Arbitrary Distances [3.965287302235051]
  Measurement-based quantum repeaters employ entanglement distillation and swapping across links.<n>We introduce a systematic protocol for measurement-based entanglement distillation and its application to repeaters.<n>We propose a measurement-based repeater protocol based on quantum low-density parity-check codes.
  arXiv  Detail & Related papers  (2025-02-16T15:53:09Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)

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.