Detecting quantum speedup of random walks with machine learning
- URL: http://arxiv.org/abs/2309.02212v1
- Date: Tue, 5 Sep 2023 13:19:47 GMT
- Title: Detecting quantum speedup of random walks with machine learning
- Authors: Hanna Linn, Yu Zheng, Anton Frisk Kockum
- Abstract summary: We use machine-learning techniques to detect quantum speedup in random walks on graphs.
Our results indicate that carefully building the data set for training can improve the performance of the neural networks.
If classification accuracy can be improved further, valuable insights about quantum advantage may be gleaned from these neural networks.
- Score: 8.151729519194182
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We explore the use of machine-learning techniques to detect quantum speedup
in random walks on graphs. Specifically, we investigate the performance of
three different neural-network architectures (variations on fully connected and
convolutional neural networks) for identifying linear, cyclic, and random
graphs that yield quantum speedups in terms of the hitting time for reaching a
target node after starting in another node of the graph. Our results indicate
that carefully building the data set for training can improve the performance
of the neural networks, but all architectures we test struggle to classify
large random graphs and generalize from training on one graph size to testing
on another. If classification accuracy can be improved further, valuable
insights about quantum advantage may be gleaned from these neural networks, not
only for random walks, but more generally for quantum computing and quantum
transport.
Related papers
- Echo-evolution data generation for quantum error mitigation via neural
networks [0.0]
We propose a physics-motivated method to generate training data for quantum error mitigation via neural networks.
Under this method, the initial state evolves forward and backward in time, returning to the initial state at the end of evolution.
We demonstrate that a feed-forward fully connected neural network trained on echo-evolution-generated data can correct results of forward-in-time evolution.
arXiv Detail & Related papers (2023-11-01T12:40:10Z) - 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) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - New quantum neural network designs [0.0]
We investigate the performance of new quantum neural network designs.
We develop a new technique, where we merge feature map and variational circuit into a single parameterized circuit.
We achieve lower loss, better accuracy, and faster convergence.
arXiv Detail & Related papers (2022-03-12T10:20:14Z) - Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity
on Pruned Neural Networks [79.74580058178594]
We analyze the performance of training a pruned neural network by analyzing the geometric structure of the objective function.
We show that the convex region near a desirable model with guaranteed generalization enlarges as the neural network model is pruned.
arXiv Detail & Related papers (2021-10-12T01:11:07Z) - 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) - Variational learning for quantum artificial neural networks [0.0]
We first review a series of recent works describing the implementation of artificial neurons and feed-forward neural networks on quantum processors.
We then present an original realization of efficient individual quantum nodes based on variational unsampling protocols.
While keeping full compatibility with the overall memory-efficient feed-forward architecture, our constructions effectively reduce the quantum circuit depth required to determine the activation probability of single neurons.
arXiv Detail & Related papers (2021-03-03T16:10:15Z) - Binary Graph Neural Networks [69.51765073772226]
Graph Neural Networks (GNNs) have emerged as a powerful and flexible framework for representation learning on irregular data.
In this paper, we present and evaluate different strategies for the binarization of graph neural networks.
We show that through careful design of the models, and control of the training process, binary graph neural networks can be trained at only a moderate cost in accuracy on challenging benchmarks.
arXiv Detail & Related papers (2020-12-31T18:48:58Z) - Recurrent Quantum Neural Networks [7.6146285961466]
Recurrent neural networks are the foundation of many sequence-to-sequence models in machine learning.
We construct a quantum recurrent neural network (QRNN) with demonstrable performance on non-trivial tasks.
We evaluate the QRNN on MNIST classification, both by feeding the QRNN each image pixel-by-pixel; and by utilising modern data augmentation as preprocessing step.
arXiv Detail & Related papers (2020-06-25T17:59:44Z) - Machine learning transfer efficiencies for noisy quantum walks [62.997667081978825]
We show that the process of finding requirements on both a graph type and a quantum system coherence can be automated.
The automation is done by using a convolutional neural network of a particular type that learns to understand with which network and under which coherence requirements quantum advantage is possible.
Our results are of importance for demonstration of advantage in quantum experiments and pave the way towards automating scientific research and discoveries.
arXiv Detail & Related papers (2020-01-15T18:36:53Z)
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.