Exact Decomposition of Quantum Channels for Non-IID Quantum Federated Learning

• URL: http://arxiv.org/abs/2209.00768v1
• Date: Fri, 2 Sep 2022 00:38:44 GMT
• Title: Exact Decomposition of Quantum Channels for Non-IID Quantum Federated Learning
• Authors: Haimeng Zhao
• Abstract summary: Federated learning refers to the task of performing machine learning with decentralized data from multiple clients while protecting data security and privacy. We show that when the clients' data are not independent and identically distributed (IID), the performance of conventional federated algorithms deteriorates. We prove that a global quantum channel can be exactly decomposed into channels trained by each client with the help of local density estimators.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Federated learning refers to the task of performing machine learning with decentralized data from multiple clients while protecting data security and privacy. Works have been done to incorporate quantum advantage in such scenarios. However, when the clients' data are not independent and identically distributed (IID), the performance of conventional federated algorithms deteriorates. In this work, we explore this phenomenon in the quantum regime with both theoretical and numerical analysis. We further prove that a global quantum channel can be exactly decomposed into channels trained by each client with the help of local density estimators. It leads to a general framework for quantum federated learning on non-IID data with one-shot communication complexity. We demonstrate it on classification tasks with numerical simulations.

Related papers

• Quantum delegated and federated learning via quantum homomorphic encryption [0.5939164722752263]
  We present a general framework that enables quantum delegated and federated learning with atheoretical data privacy guarantee. We show that learning and inference under this framework feature substantially lower communication complexity compared with schemes based on blind quantum computing.
  arXiv  Detail & Related papers  (2024-09-28T14:13:50Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• Quantum Federated Learning With Quantum Networks [7.842152902652214]
  We present a quantum-classical transfer learning scheme for classical data and communication with a hub-spoke topology. While quantum communication is secure from eavesdrop attacks and no measurements from quantum to classical translation, due to no cloning theorem, hub-spoke topology is not ideal for quantum communication without quantum memory. We also demonstrate the first successful use of quantum weights for quantum federated learning, which allows us to perform our training entirely in quantum.
  arXiv  Detail & Related papers  (2023-10-23T16:45:29Z)
• Quantum Federated Learning for Distributed Quantum Networks [9.766446130011706]
  We propose a quantum federated learning for distributed quantum networks by utilizing interesting characteristics of quantum mechanics. A quantum gradient descent algorithm is provided to help clients in the distributed quantum networks to train local models. A quantum secure multi-party computation protocol is designed, which utilizes the Chinese residual theorem.
  arXiv  Detail & Related papers  (2022-12-25T14:37:23Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Distributed Quantum Machine Learning [0.0]
  Quantum computers offer inherent security of data, as measurements destroy quantum states. We propose an approach for distributed quantum machine learning, which allows multiple parties to collaborate and securely compute quantum algorithms.
  arXiv  Detail & Related papers  (2022-08-22T13:52:21Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Nearest Centroid Classification on a Trapped Ion Quantum Computer [57.5195654107363]
  We design a quantum Nearest Centroid classifier, using techniques for efficiently loading classical data into quantum states and performing distance estimations. We experimentally demonstrate it on a 11-qubit trapped-ion quantum machine, matching the accuracy of classical nearest centroid classifiers for the MNIST handwritten digits dataset and achieving up to 100% accuracy for 8-dimensional synthetic data.
  arXiv  Detail & Related papers  (2020-12-08T01:10:30Z)

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.