FedQML-Edge: Compact Quantum Feature Sketches for Communication-Constrained Roadside Federated Learning

• URL: http://arxiv.org/abs/2607.28799v1
• Date: Thu, 30 Jul 2026 19:46:44 GMT
• Title: FedQML-Edge: Compact Quantum Feature Sketches for Communication-Constrained Roadside Federated Learning
• Abstract summary: Roadside units (RSUs) supporting connected and autonomous vehicle corridors need compact models to decide when cooperative maneuvers should be rewarded, deferred, or disabled.<n>Raw sensor streams and neural network weight checkpoints are poorly suited to bandwidth-limited, privacy-sensitive roadside learning.<n>This paper presents $textttFedQML-Edge$, a quantum feature-sketching pipeline for traffic-stability gating.
• Score: 1.856334276134661
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Roadside units (RSUs) supporting connected and autonomous vehicle corridors need compact models to decide when cooperative maneuvers should be rewarded, deferred, or disabled. Raw sensor streams and neural network weight checkpoints are poorly suited to bandwidth-limited, privacy-sensitive roadside learning. This paper presents $\texttt{FedQML-Edge}$, a federated quantum feature-sketching pipeline for traffic-stability gating. Each RSU constructs a traffic-state summary and sends circuit inputs to a quantum computer; Pauli expectations form a nonlinear sketch processed by a logistic classifier. Only classifier updates are shared with an aggregator, whose head supports reward gating. Raw observations, vehicle records, event traces, and quantum sketches remain private. We evaluate the method using NGSIM trajectories, SUMO predictive gating with sensing noise, and IBM Quantum hardware. On NGSIM, the Pauli sketch reduces test log loss by $14.4\%$ relative to the strongest matched classical sketch. On SUMO, it approaches larger MLPs in stable-window recall while using $7-28$ times less communication per round.

Related papers

• Quantum Incremental Learning with Mixed State Prototypes [53.319426778720434]
  We introduce a novel quantum incremental learning framework based on trainable mixed-state prototypes.<n>Our model achieves high-dimensional feature concentration using a minimal number of qubits.
  arXiv  Detail & Related papers  (2026-08-11T04:22:42Z)
• Feasibility-Preserving Quantum Search for Constrained Transportation Routing [2.358614023689616]
  Transportation routing problems involve strict feasibility requirements involving customer assignment and visit rules, route sequencing, and depot-return logic.<n>Most quantum routing formulations adopt Quadratic Unconstrained Binary Optimization encodings, where feasibility is incorporated indirectly via penalty terms in the cost Hamiltonian.<n>This study develops a transportation-grounded constraint-aware Quantum Alternating Operator Ansatz framework that embeds feasibility-preserving logic directly into the search operator.
  arXiv  Detail & Related papers  (2026-08-05T20:24:46Z)
• Cooperative Platoon Routing and Dispatching via Edge-Assisted Hybrid Quantum Optimization [1.856334276134661]
  This paper develops an edge-assisted, closed-loop evaluation pipeline for platooning-aware vehicle routing.<n>Roadside units estimate local traffic kinematics from video, classify segment-level flow stability, and activate platooning rewards only on road segments where close-gap coordination is physically appropriate.<n>We evaluate the framework using a 24-hour microscopic SUMO simulation of Troy, NY, together with localized IBM Quantum hardware benchmarks.
  arXiv  Detail & Related papers  (2026-08-01T08:35:27Z)
• Quantum Sidecar Architectures for Hybrid AI Training and Inference: Stateful Protected Registers, Stateless Reset-and-Reprepare Circuits and Quantum Weight-State Outlook [0.0]
  We propose a quantum sidecar architecture family for future hybrid AI training and inference.<n>We identify two physically distinct operating modes for quantum co-processors attached to classical large-model pipelines.
  arXiv  Detail & Related papers  (2026-05-18T08:21:44Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era [0.0]
  We introduce a fully quantum graph convolutional architecture designed explicitly for unsupervised learning in the noisy intermediate-scale quantum regime.<n>Our model decomposes message passing into pairwise interactions along graph edges using only hardware-native single- and two-qubit gates.
  arXiv  Detail & Related papers  (2026-02-17T21:17:42Z)
• Domain-Aware Quantum Circuit for QML [0.7999703756441755]
  We present a Domain-Aware Quantum Circuit (DAQC) that leverages image priors to guide locality-preserving encoding and entanglement.<n>The design employs interleaved encode--train cycles, where entanglement is applied among qubits hosting neighboring pixels, aligned to device connectivity.<n>We evaluate DAQC on MNIST, FashionMentangle, and PneumoniaMNIST datasets.
  arXiv  Detail & Related papers  (2025-12-19T17:02:58Z)
• Lane-Frame Quantum Multimodal Driving Forecasts for the Trajectory of Autonomous Vehicles [6.137648436139678]
  Tray forecasting for autonomous driving must deliver accurate, multi-modal calibrated forecasts under tight compute and latency constraints.<n>We propose a compact hybrid quantum architecture that aligns quantum inductive bias with road-scene structure by operating in an ego-centric, lane-aligned frame.<n>In the Open Motion dataset, the model achieves minADE of SI1.94m and minFDE of SI3.56m, consistently outperforming a kinematic baseline with reduced miss rates and strong recall.
  arXiv  Detail & Related papers  (2025-11-21T07:00:07Z)
• Network-Optimised Spiking Neural Network for Event-Driven Networking [2.5941336499463383]
  Spiking neural networks offer event-driven computation suited to time-critical networking tasks such as anomaly detection, local routing control, and congestion management at the edge.<n>We introduce Network-Optimised Spiking (NOS), a compact two-variable unit whose state encodes normalised queue occupancy and a recovery resource.<n>We provide guidance for data-driven initialisation, surrogate-gradient training with a homotopy on reset sharpness, and explicit stability checks with topology of bounds for resource constrained deployments.
  arXiv  Detail & Related papers  (2025-09-27T22:31:24Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Q-Newton: Hybrid Quantum-Classical Scheduling for Accelerating Neural Network Training with Newton's Gradient Descent [37.59299233291882]
  We propose Q-Newton, a hybrid quantum-classical scheduler for accelerating neural network training with Newton's GD.<n>Q-Newton utilizes a streamlined scheduling module that coordinates between quantum and classical linear solvers.<n>Our evaluation showcases the potential for Q-Newton to significantly reduce the total training time compared to commonly used quantum machines.
  arXiv  Detail & Related papers  (2024-04-30T23:55:03Z)
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer [41.94295877935867]
  Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
  arXiv  Detail & Related papers  (2023-05-03T18:00:02Z)
• Quantum Federated Learning with Entanglement Controlled Circuits and Superposition Coding [44.89303833148191]
  We develop a depth-controllable architecture of entangled slimmable quantum neural networks (eSQNNs) We propose an entangled slimmable QFL (eSQFL) that communicates the superposition-coded parameters of eS-QNNs. In an image classification task, extensive simulations corroborate the effectiveness of eSQFL.
  arXiv  Detail & Related papers  (2022-12-04T03:18:03Z)
• A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
  We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We numerically demonstrate that the MNIST image dataset satisfies such conditions. We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
  arXiv  Detail & Related papers  (2021-07-19T23:41:03Z)
• Edge Federated Learning Via Unit-Modulus Over-The-Air Computation (Extended Version) [64.76619508293966]
  This paper proposes a unit-modulus over-the-air computation (UM-AirComp) framework to facilitate efficient edge federated learning. It uploads simultaneously local model parameters and updates global model parameters via analog beamforming. We demonstrate the implementation of UM-AirComp in a vehicle-to-everything autonomous driving simulation platform.
  arXiv  Detail & Related papers  (2021-01-28T15:10: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.