Federated learning with distributed fixed design quantum chips and quantum channels

• URL: http://arxiv.org/abs/2401.13421v3
• Date: Wed, 09 Oct 2024 10:19:49 GMT
• Title: Federated learning with distributed fixed design quantum chips and quantum channels
• Authors: Ammar Daskin,
• Abstract summary: The privacy in classical federated learning can be breached through the use of local gradient results combined with engineered queries to the clients. We propose a quantum federated learning model in which fixed design quantum chips are operated based on the quantum states sent by a centralized server.
• Score: 0.0
• License:
• Abstract: The privacy in classical federated learning can be breached through the use of local gradient results combined with engineered queries to the clients. However, quantum communication channels are considered more secure because a measurement on the channel causes a loss of information, which can be detected by the sender. Therefore, the quantum version of federated learning can be used to provide better privacy. Additionally, sending an $N$-dimensional data vector through a quantum channel requires sending $\log N$ entangled qubits, which can potentially provide efficiency if the data vector is utilized as quantum states. In this paper, we propose a quantum federated learning model in which fixed design quantum chips are operated based on the quantum states sent by a centralized server. Based on the incoming superposition states, the clients compute and then send their local gradients as quantum states to the server, where they are aggregated to update parameters. Since the server does not send model parameters, but instead sends the operator as a quantum state, the clients are not required to share the model. This allows for the creation of asynchronous learning models. In addition, the model is fed into client-side chips directly as a quantum state; therefore, it does not require measurements on the incoming quantum state to obtain model parameters in order to compute gradients. This can provide efficiency over models where the parameter vector is sent via classical or quantum channels and local gradients are obtained through the obtained values these parameters.

Related papers

• Training quantum machine learning models on cloud without uploading the data [0.0]
  We propose a method that runs the parameterized quantum circuits before encoding the input data. This enables a dataset owner to train machine learning models on quantum cloud platforms. It is also capable of encoding a vast amount of data effectively at a later time using classical computations.
  arXiv  Detail & Related papers  (2024-09-06T20:14:52Z)
• Federated Quantum-Train with Batched Parameter Generation [3.697453416360906]
  We introduce the Federated Quantum-Train (QT) framework, which integrates the QT model into federated learning. Our approach significantly reduces qubit usage from 19 to as low as 8 qubits while reducing generalization error.
  arXiv  Detail & Related papers  (2024-09-04T14:39:11Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• A Quantum Federated Learning Framework for Classical Clients [6.418941009007091]
  Quantum Federated Learning (QFL) enables collaborative training of a Quantum Machine Learning (QML) model among multiple clients. limited availability of quantum computing resources poses a challenge for each client to acquire quantum computing capabilities. We propose a QFL framework specifically designed for classical clients, referred to as CC-QFL, in response to this question.
  arXiv  Detail & Related papers  (2023-12-18T19:29:55Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• 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)
• Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach [47.19265172105025]
  We propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN) egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required. The architecture is based on a novel mapping from real-world data to Hilbert space.
  arXiv  Detail & Related papers  (2022-01-13T16:35:45Z)
• Realizing Quantum Convolutional Neural Networks on a Superconducting Quantum Processor to Recognize Quantum Phases [2.1465372441653354]
  Quantum neural networks tailored to recognize specific features of quantum states by combining unitary operations, measurements and feedforward promise to require fewer measurements and to tolerate errors. We realize a quantum convolutional neural network (QCNN) on a 7-qubit superconducting quantum processor to identify symmetry-protected topological phases of a spin model characterized by a non-zero string order parameter. We find that, despite being composed of finite-fidelity gates itself, the QCNN recognizes the topological phase with higher fidelity than direct measurements of the string order parameter for the prepared states.
  arXiv  Detail & Related papers  (2021-09-13T12:32:57Z)
• 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)
• 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)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

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.