Correlation Geometry of Quantum Sensor Networks: Local-Global Information Flow and Local Privacy

• URL: http://arxiv.org/abs/2608.06888v2
• Date: Thu, 13 Aug 2026 07:59:02 GMT
• Title: Correlation Geometry of Quantum Sensor Networks: Local-Global Information Flow and Local Privacy
• Abstract summary: Quantum sensor networks (QSN) typically encode N unknown parameters while targeting a single linear combination.<n>We use the effective quantum Fisher information (EQFI) and establish a barrel-effect'' bottleneck.<n>We derive an exact local--global phase map that delineates how the trade-off between local and global EQFI depends dynamically on quantum correlations.
• Score: 10.284788058281043
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum sensor networks (QSN) typically encode N unknown parameters while targeting a single linear combination, rendering the N-1 remaining parameters as nuisance directions. To rigorously quantify estimation precision under such nuisances, we use the effective quantum Fisher information (EQFI) and establish a ``barrel-effect'' bottleneck: the global EQFI cannot exceed the weakest weighted local sensing capacity. To elucidate the information allocation mechanism underlying this bottleneck, we derive an exact local--global phase map that delineates how the trade-off between local and global EQFI depends dynamically on quantum correlations, and accordingly we identify concrete conditions for saturating the bottleneck bound. Notably, this geometric map uncovers a counterintuitive ``overcorrelated'' regime where excessive correlations actively degrade both local and global performance. Finally, we apply the phase map to intrinsic local privacy and identify the condition under which every local parameter is inaccessible while the desired global combination remains estimable. Overall, our work provides a principled methodology for engineering optimal network states in quantum sensing architectures.

Related papers

• Constant-depth global shadow estimation [5.469643093167644]
  We show that substantially less randomness suffices when the readout is meaningfully adapted to the quantities being estimated.<n>We introduce shallow phase shadows, based on a sparse Clifford-IQP ensemble, and prove efficient global estimation of stabilizer-state fidelities.<n>Our results show that scalable quantum readout need not reproduce generic randomness: task-adapted randomization can enable substantially shallower global characterization protocols.
  arXiv  Detail & Related papers  (2026-09-09T16:29:43Z)
• Global quantum phase estimation via hybrid quantum--classical learning [0.0]
  Variational quantum interferometers enhance precision but are generally limited to narrow operating regimes.<n>We introduce a hybrid variational quantum--classical neural network interferometer (VQ-CNNI)<n>We show that this performance requires co-optimization of quantum encoding and classical decoding.
  arXiv  Detail & Related papers  (2026-05-24T12:48:04Z)
• S$^3$GNN: Efficient Global Mixing and Local Message Passing for Long-Range Graph Learning [56.04227780048336]
  Message-passing neural networks (MPNNs) often suffer from an information bottleneck when capturing long-range dependencies.<n>We propose S$3$GNN, which mitigates oversquashing (OSQ) by lightweightly reintroducing omitted components.<n>Our experiments show that S$3$GNN achieves up to an order-of-magnitude error reduction with up to 50% fewer parameters.
  arXiv  Detail & Related papers  (2026-05-22T10:26:41Z)
• Efficiently Learning Global Quantum Channels with Local Tomography [0.0]
  We introduce a local-to-global reconstruction framework for one-dimensional multi-qubit states and channels.<n>By employing a tensor networ representation, we reconstruct channels acting on up to 50 qubits and accurately recover global diagnostics.<n>Our work thus extends the powerful toolbox local shadow tomography to scalable channel characterization with access to global properties.
  arXiv  Detail & Related papers  (2026-03-07T04:54:48Z)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• CoCo-Fed: A Unified Framework for Memory- and Communication-Efficient Federated Learning at the Wireless Edge [50.42067935605982]
  We propose a novel Compression and Combination-based Federated learning framework that unifies local memory efficiency and global communication reduction.<n>CoCo-Fed significantly outperforms state-of-the-art baselines in both memory and communication efficiency while maintaining robust convergence under non-IID settings.
  arXiv  Detail & Related papers  (2026-01-02T03:39:50Z)
• Federated Quantum Kernel Learning for Anomaly Detection in Multivariate IoT Time-Series [27.38765909731335]
  We propose a Federated Quantum Kernel Learning (FQKL) framework that integrates quantum feature maps with federated aggregation.<n>FQKL achieves superior generalization in capturing complex temporal correlations compared to classical federated baselines.<n>This work highlights the promise of quantum kernels in federated settings, advancing the path toward scalable, robust, and quantum-enhanced intelligence for next-generation IoT infrastructures.
  arXiv  Detail & Related papers  (2025-11-04T06:35:53Z)
• FL-QDSNNs: Federated Learning with Quantum Dynamic Spiking Neural Networks [2.5435687567731926]
  We present Federated Learning-Quantum Dynamic Spiking Neural Networks (FL-QDSNNs)<n>FL-QDSNNs are a privacy-preserving framework that maintains high predictive accuracy on non-IID client data.<n>Its key innovation is a dynamic-threshold spiking mechanism that triggers quantum gates only when local data drift requires added expressiveness.
  arXiv  Detail & Related papers  (2024-12-03T09:08:33Z)
• OCMG-Net: Neural Oriented Normal Refinement for Unstructured Point Clouds [18.234146052486054]
  We present a robust refinement method for estimating oriented normals from unstructured point clouds. Our framework incorporates sign orientation and data augmentation in the feature space to refine the initial oriented normals. To address the issue of noise-caused direction inconsistency existing in previous approaches, we introduce a new metric called the Chamfer Normal Distance.
  arXiv  Detail & Related papers  (2024-09-02T09:30:02Z)
• Inferring Dynamic Networks from Marginals with Iterative Proportional Fitting [57.487936697747024]
  A common network inference problem, arising from real-world data constraints, is how to infer a dynamic network from its time-aggregated adjacency matrix. We introduce a principled algorithm that guarantees IPF converges under minimal changes to the network structure.
  arXiv  Detail & Related papers  (2024-02-28T20:24:56Z)
• FedNAR: Federated Optimization with Normalized Annealing Regularization [54.42032094044368]
  We explore the choices of weight decay and identify that weight decay value appreciably influences the convergence of existing FL algorithms. We develop Federated optimization with Normalized Annealing Regularization (FedNAR), a plug-in that can be seamlessly integrated into any existing FL algorithms.
  arXiv  Detail & Related papers  (2023-10-04T21:11:40Z)
• Benign Overfitting in Deep Neural Networks under Lazy Training [72.28294823115502]
  We show that when the data distribution is well-separated, DNNs can achieve Bayes-optimal test error for classification. Our results indicate that interpolating with smoother functions leads to better generalization.
  arXiv  Detail & Related papers  (2023-05-30T19:37:44Z)
• Learning Signed Hyper Surfaces for Oriented Point Cloud Normal Estimation [53.19926259132379]
  We propose a novel method called SHS-Net for oriented normal estimation of point clouds by learning signed hyper surfaces. The signed hyper surfaces are implicitly learned in a high-dimensional feature space where the local and global information is aggregated. An attention-weighted normal prediction module is proposed as a decoder, which takes the local and global latent codes as input to predict oriented normals.
  arXiv  Detail & Related papers  (2023-05-10T03:40:25Z)
• Green, Quantized Federated Learning over Wireless Networks: An Energy-Efficient Design [68.86220939532373]
  The finite precision level is captured through the use of quantized neural networks (QNNs) that quantize weights and activations in fixed-precision format. The proposed FL framework can reduce energy consumption until convergence by up to 70% compared to a baseline FL algorithm.
  arXiv  Detail & Related papers  (2022-07-19T16:37:24Z)

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.