Quantum-Enhanced Processing with Tensor-Network Frontends for Privacy-Aware Federated Medical Diagnosis

• URL: http://arxiv.org/abs/2604.01616v2
• Date: Fri, 03 Apr 2026 14:25:49 GMT
• Title: Quantum-Enhanced Processing with Tensor-Network Frontends for Privacy-Aware Federated Medical Diagnosis
• Abstract summary: The framework is motivated by two practical constraints in privacy-aware federated learning.<n>The MPC benchmark shows that communication cost is governed primarily by the dimension of the protected latent representation.<n>Results support a co-NIST perspective in which representation compression, post-aggregation quantum refinement, and privacy-aware deployment should be optimized jointly.
• Score: 0.13999481573773068
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a privacy-aware hybrid framework for federated medical image classification that combines tensor-network representation learning, MPC-secured aggregation, and post-aggregation quantum refinement. The framework is motivated by two practical constraints in privacy-aware federated learning: MPC can introduce substantial communication overhead, and direct quantum processing of high-dimensional medical images is unrealistic with a small number of qubits. To address both constraints within a single architecture, client-side tensor-network frontends, Matrix Product State (MPS), Tree Tensor Network (TTN), and Multi-scale Entanglement Renormalization Ansatz (MERA), compress local inputs into compact latent representations, after which a Quantum-Enhanced Processor (QEP) refines the aggregated latent feature through quantum-state embedding and observable-based readout. Experiments on PneumoniaMNIST show that the effect of the QEP is frontend-dependent rather than uniform across architectures. In the present setting, the TTN+QEP combination exhibits the most balanced overall profile. The results also suggest that the QEP behaves more stably when the qubit count is sufficiently matched to the latent dimension, while noisy conditions degrade performance relative to the noiseless setting. The MPC benchmark further shows that communication cost is governed primarily by the dimension of the protected latent representation. This indicates that tensor-network compression plays a dual role: it enables small-qubit quantum processing on compressed latent features and reduces the communication overhead associated with secure aggregation. Taken together, these results support a co-design perspective in which representation compression, post-aggregation quantum refinement, and privacy-aware deployment should be optimized jointly.

Related papers

• HQTN-SER: Speech Emotion Recognition with Hybrid Quantum Tensor Networks [2.417944170423441]
  Speech emotion recognition remains fragile in real-world conditions.<n>Quantum machine learning offers an alternative way to introduce nonlinear correlation modeling with compact modules.<n>This paper presents HQTN-SER, a hybrid quantum-classical framework that investigates how quantum tensor network connectivity can support SER under small-qubit settings.
  arXiv  Detail & Related papers  (2026-05-14T08:07:58Z)
• A Resource-Aligned Hybrid Quantum-Classical Framework for Multimodal Face Anti-Spoofing [11.018914804434301]
  In multimodal face anti-spoofing, linear compression methods can reduce dimensionality to accommodate limited quantum budgets.<n>We propose a hybrid Matrix Product State (MPS)-Variational Quantum Circuit (VQC) framework, where the MPS serves as a structured, differentiable pre-quantum compression and fusion module.<n>We show that MPS-VQC achieves accuracy comparable to strong classical neural network baselines with fewer than 0.25M parameters.
  arXiv  Detail & Related papers  (2026-03-29T20:12:47Z)
• Consensus Protocols for Entanglement-Aware Scheduling in Distributed Quantum Neural Networks [18.148407575244942]
  We introduce a Consensus-Entanglement-Aware Scheduling (CEAS) framework that co-designs quantum consensus protocols with adaptive entanglement management.<n>CEAS integrates fidelity-weighted aggregation, in which parameter updates are weighted by quantum Fisher information to suppress noisy contributions.<n>CEAS maintains 10-15 percentage points higher accuracy compared to entanglement-oblivious baselines under coordinated Byzantine attacks.
  arXiv  Detail & Related papers  (2026-02-06T16:36:52Z)
• 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)
• Readout-Side Bypass for Residual Hybrid Quantum-Classical Models [3.609274776085931]
  Quantum machine learning (QML) promises compact and expressive representations, but suffers from measurement bottleneck.<n>We propose a lightweight residual hybrid architecture that confirms quantum features with raw inputs before classification.<n>Our model achieves up to +55% accuracy improvement over quantum baselines, while retaining low communication cost and enhanced privacy robustness.
  arXiv  Detail & Related papers  (2025-11-25T23:27:53Z)
• Task-Oriented Feature Compression for Multimodal Understanding via Device-Edge Co-Inference [54.53508601749513]
  We propose a task-oriented feature compression (TOFC) method for multimodal understanding in a device-edge co-inference framework.<n>To enhance compression efficiency, multiple entropy models are adaptively selected based on the characteristics of the visual features.<n>Results show that TOFC achieves up to 52% reduction in data transmission overhead and 63% reduction in system latency.
  arXiv  Detail & Related papers  (2025-03-17T08:37:22Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Hybrid quantum-classical classifier based on tensor network and variational quantum circuit [0.0]
  We introduce a hybrid model combining the quantum-inspired tensor networks (TN) and the variational quantum circuits (VQC) to perform supervised learning tasks. We show that a matrix product state based TN with low bond dimensions performs better than PCA as a feature extractor to compress data for the input of VQCs in the binary classification of MNIST dataset.
  arXiv  Detail & Related papers  (2020-11-30T09:43:59Z)

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.