Distributed Quantum Machine Learning
- URL: http://arxiv.org/abs/2208.10316v1
- Date: Mon, 22 Aug 2022 13:52:21 GMT
- Title: Distributed Quantum Machine Learning
- Authors: Niels M. P. Neumann, Robert S. Wezeman
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computers can solve specific complex tasks for which no
reasonable-time classical algorithm is known. Quantum computers do however also
offer inherent security of data, as measurements destroy quantum states. Using
shared entangled states, multiple parties can collaborate and securely compute
quantum algorithms. In this paper we propose an approach for distributed
quantum machine learning, which allows multiple parties to securely perform
computations, without having to reveal their data. We will consider a
distributed adder and a distributed distance-based classifier.
Related papers
- Blind quantum machine learning with quantum bipartite correlator [13.533591812956018]
We introduce novel blind quantum machine learning protocols based on the quantum bipartite correlator algorithm.
Our protocols have reduced communication overhead while preserving the privacy of data from untrusted parties.
arXiv Detail & Related papers (2023-10-19T16:42:32Z) - Tensor-Network Simulations of Noisy Quantum Computers [0.0]
We simulate the execution of three quantum algorithms on noisy quantum computers.
We find that they can be executed with high fidelity even at a moderate loss of entanglement.
arXiv Detail & Related papers (2023-04-04T12:42:18Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
We design, implement, and evaluate three hybrid quantum k-Means algorithms.
We exploit quantum phenomena to speed up the computation of distances.
We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
arXiv Detail & Related papers (2022-12-13T16:04:16Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Machine learning applications for noisy intermediate-scale quantum
computers [0.0]
We develop and study three quantum machine learning applications suitable for NISQ computers.
These algorithms are variational in nature and use parameterised quantum circuits (PQCs) as the underlying quantum machine learning model.
We propose a variational algorithm in the area of approximate quantum cloning, where the data becomes quantum in nature.
arXiv Detail & Related papers (2022-05-19T09:26:57Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - Quantum Algorithms and Simulation for Parallel and Distributed Quantum
Computing [0.0]
A viable approach for building large-scale quantum computers is to interlink small-scale quantum computers with a quantum network.
We present our software framework called Interlin-q, a simulation platform that aims to simplify designing and verifying parallel and distributed quantum algorithms.
arXiv Detail & Related papers (2021-06-12T19:41:48Z) - 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) - A rigorous and robust quantum speed-up in supervised machine learning [6.402634424631123]
In this paper, we establish a rigorous quantum speed-up for supervised classification using a general-purpose quantum learning algorithm.
Our quantum classifier is a conventional support vector machine that uses a fault-tolerant quantum computer to estimate a kernel function.
arXiv Detail & Related papers (2020-10-05T17:22:22Z) - Statistical Limits of Supervised Quantum Learning [90.0289160657379]
We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension.
We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
arXiv Detail & Related papers (2020-01-28T17:35:32Z)
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.