QCORE: A Quantum-Control-Oriented Real-Time Execution Architecture with Extensible Closed-Loop Services and Shared AI Acceleration

• URL: http://arxiv.org/abs/2608.06875v1
• Date: Fri, 07 Aug 2026 07:01:14 GMT
• Title: QCORE: A Quantum-Control-Oriented Real-Time Execution Architecture with Extensible Closed-Loop Services and Shared AI Acceleration
• Abstract summary: This article presents QCORE, a digital control reference architecture positioned between the Host and a platform-specific analog/mixed-signal front end.<n>QCORE separates task management, shared resources, hard-real-time execution, and long-timescale services into four hardware partitions.<n>Transaction-level, event-driven, and quantum-behavioral models are used for evaluation.
• Score: 3.1760149320493807
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Scalable quantum processors require control, readout, feedback, calibration, and error correction to coexist under bounded latency and shared-resource constraints, whereas existing platforms typically optimize only a subset of these capabilities. This article presents QCORE (Quantum-Control-Oriented Real-Time Execution), a QPU-side digital control reference architecture positioned between the Host and a platform-specific analog/mixed-signal front end. QCORE separates task management, shared resources, hard-real-time execution, and long-timescale services into four hardware partitions. A fast-result sideband closes same-round feedback, a Measurement Packet provides a traceable measurement and service interface, and a common service-control skeleton, Tile-local QEC, and versioned safe-point commit organize calibration, error correction, and long-term state updates. Transaction-level, event-driven, and quantum-behavioral models are used for evaluation. At a background load of 0.8, the $P_{99}$ latency of the shared Measurement Packet/Event feedback path is $(1.984\pm0.004)L_{\max}$. Closed-loop operation reduces the mean frequency error by $83.2\%\pm0.8\%$ and lowers the state-assignment error at maximum readout drift from $10.39\%\pm0.54\%$ to $5.37\%\pm0.29\%$. No unsafe acceptance or mixed-version observation is observed in 100,000 configuration transactions, and Tile-local QEC reduces modeled global-boundary demand and yields a $2.08\times$ capacity-normalized scaling estimate.

Related papers

• WISER: Systematic Design-Space Exploration of Fault-Tolerant Global Control Trapped-Ions [0.2676349883103403]
  Trapped-ion quantum computers are a leading candidate for scalable fault-tolerant quantum computing.<n>We present WISE, a cross-layer architectural design-space exploration framework for globally controlled trapped-ion systems.
  arXiv  Detail & Related papers  (2026-09-11T21:22:31Z)
• Kinetics of sliding-window quantum error correction [39.34750401159749]
  We study the kinetics of sliding window decoding (SWD), an implementation of real-time decoding.<n>SWD acts on temporally local windows of noisy syndrome information and commits to corrections irreversibly at a nonzero rate.<n>We propose an effective description of SWD in terms of a kinetic process, where $mathbbZ$-charged point particles undergo parity-conserving reaction and diffusion.
  arXiv  Detail & Related papers  (2026-08-10T18:00:26Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Scaling Laws for Agent Harnesses via Effective Feedback Compute [53.68149869349268]
  emphEffective Feedback Compute (EFC) is a trace-level scaling coordinate that credits feedback only when it is informative, valid, non-redundant, and retained for subsequent decisions.<n>EFC-based coordinates consistently predict failure rates better than raw-compute baselines.
  arXiv  Detail & Related papers  (2026-05-28T09:45:47Z)
• Adiabatic Quantum Phase Estimation [47.3103723337301]
  Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $$ in Heisenberg-limited time $T= (1/)$.<n>Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware.<n>We present a simple adiabatic protocol for QPE that achieves the optimal Heisenberg-limited scaling $T = Oleft( frac1 logleft(-1right)right)$ in both the precision $$
  arXiv  Detail & Related papers  (2026-05-21T17:31:36Z)
• ActQuant: Sub-4-bit Action-Guided Quantization for Vision-Language-Action Models [45.62029693245481]
  We introduce ActQuant, an action-guided mixed-precision PTQ framework.<n>ActQuant operates in two stages: (1) an inter-tensor bit allocator that assigns each weight matrix a single bitwidth based on how much it contributes to predicting the agent's actions.<n>We also introduce OmniModel, an agentic conversion pipeline that ports into a native C/C++ with efficient low-bit kernels.
  arXiv  Detail & Related papers  (2026-05-19T19:57:26Z)
• Boundary-Aware Stabilizer Scheduling for Distributed Quantum Error Correction [1.556083770714207]
  In topological quantum error correction, such as color codes, parity checks require remote CNOT operations using heralded Bell pairs.<n>A natural way to reduce this overhead is to skip some seam measurements.<n>We develop a scheduling module that integrates directly into standard syndrome-extraction circuits.
  arXiv  Detail & Related papers  (2026-04-24T11:49:07Z)
• Correction and Corruption: A Two-Rate View of Error Flow in LLM Protocols [51.56484100374058]
  We propose a paired-outcome measurement interface for auditing a single protocol step on exact-match tasks.<n>For each instance, the interface records a baseline correctness bit and a post-step correctness bit.<n>These rates predict accuracy changes and define a reusable empirical interface testable across seeds, mixtures, and pipelines.
  arXiv  Detail & Related papers  (2026-04-20T13:25:40Z)
• LUT-Compiled Kolmogorov-Arnold Networks for Lightweight DoS Detection on IoT Edge Devices [20.271194684947282]
  Kolmogorov-Arnold Networks (KANs) offer a compact alternative to Multi-Layer Perceptrons (MLPs)<n>B-spline evaluation introduces significant computational overhead unsuitable for latency-critical IoT applications.<n>We propose a lookup table (LUT) compilation pipeline that replaces expensive spline computations with precomputed quantized tables.
  arXiv  Detail & Related papers  (2026-01-12T22:32:18Z)
• Practical Quantum Clock Synchronization Using Weak Coherent Pulses [0.0]
  We numerically evaluate a quantum-enhanced clock synchronization protocol based on attenuated weak coherent pulses.<n>We simulate that sub-nanosecond clock-offset accuracy and precision can be achieved under these operating conditions.
  arXiv  Detail & Related papers  (2025-09-30T19:21:59Z)
• Practical quantum advantage on partially fault-tolerant quantum computer [0.6449786007855248]
  We propose an alternative approach to achieve practical quantum advantages on early-FTQC devices. Our framework is based on partially fault-tolerant logical operations to minimize spatial overhead. We present several promising applications that leverage the potential of our framework.
  arXiv  Detail & Related papers  (2024-08-27T07:58:09Z)
• Benchmarking Quantum Processor Performance at Scale [0.10485739694839669]
  As quantum processors grow, new performance benchmarks are required to capture the full quality of the devices at scale. We discuss a scalable benchmark which measures the fidelity of a connecting set of two-qubit gates over $N$ qubits. Our layer fidelity can be easily related to algorithmic run time, via $gamma$ defined in Ref.citeberg2022probabilistic that can be used to estimate the number of circuits required for error mitigation.
  arXiv  Detail & Related papers  (2023-11-10T08:47:31Z)
• Long-range data transmission in a fault-tolerant quantum bus architecture [0.0]
  Scheme generates a maximally entangled state of two qubits using a depth-$6$ circuit consisting of nearest-neighbor Clifford gates and local measurements only. We prove a converse bound $Omega(log R)$ on the number of qubits per repeater among all low-latency schemes for fault-tolerant quantum communication over distance.
  arXiv  Detail & Related papers  (2022-09-20T14:57:27Z)

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.