analiza aiqbench
FedQML-Edge demonstrates how quantum feature sketching can significantly reduce communication overhead in bandwidth-constrained federated learning environments for autonomous vehicles. By replacing raw sensor data with compact Pauli expectation sketches, the approach maintains high recall rates while preserving privacy and cutting transmission costs by up to 28 times compared to classical methods. This research validates a practical pathway for integrating quantum computing into edge-based traffic management systems where bandwidth is scarce.
FedQML-Edge: Compact Quantum Feature Sketches for Communication-Constrained Roadside Federated Learning
arXiv:2607.28799v1 Announce Type: new 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.
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.
Quantum Physics (quant-ph); Emerging Technologies (cs.ET)
arXiv:2607.28799 [quant-ph]
(or arXiv:2607.28799v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2607.28799 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 249 cuvinte
Subiecte conexe
Domain-Aware Hybrid Quantum Learning via Correlation-Guided Circuit Design for Crime Pattern Analytics
arXiv · 9 sept. 2026
News Archive 2026
Quantum Computing Report · 25 iul. 2026

Game Design Creativity evals
LessWrong · 12 oct. 2026
Communication-Efficient Personalized Federated Learning via Layer-Wise Multi-Threshold Random Sketching
arXiv · 7 sept. 2026