Machine learning transfer efficiencies for noisy quantum walks

Abstract

Quantum effects are known to provide an advantage in particle transfer across networks. In order to achieve this advantage, requirements on both a graph type and a quantum system coherence must be found. Here we show that the process of finding these requirements can be automated by learning from simulated examples. 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 machine learning approach is applied to study noisy quantum walks on cycle graphs of different sizes. We found that it is possible to predict the existence of quantum advantage for the entire decoherence parameter range, even for graphs outside of the training set. Our results are of importance for demonstration of advantage in quantum experiments and pave the way towards automating scientific research and discoveries.

6 pages, 4 figures

References in corpus (19)

• Quantum random walks - an introductory overview
• Quantum Computation and Decision Trees
• Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
• Long-lived quantum coherence in photosynthetic complexes at physiological temperature
• Universal computation by quantum walk
• Quantum walks: a comprehensive review
• Spatial search by quantum walk
• Random walks and diffusion on networks
• Universal computation by multi-particle quantum walk
• Active learning machine learns to create new quantum experiments
• Decoherence can be useful in quantum walks
• Spatial search by quantum walk is optimal for almost all graphs
• Hitting time for quantum walks on the hypercube
• Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
• Continuous-time Quantum Walks on a Cycle Graph
• Predicting quantum advantage by quantum walk with convolutional neural networks
• Quantum walks of interacting fermions on a cycle graph
• Environment-assisted analog quantum search
• Decoherence enhances performance of quantum walks applied to graph isomorphism testing

Cited by in corpus (7)

• Machine learning for long-distance quantum communication
• Quantum Machine Learning: from physics to software engineering
• Quantum machine learning and quantum biomimetics: A perspective
• Setting up experimental Bell test with reinforcement learning
• Continuous-time quantum walks in the presence of a quadratic perturbation
• Quantum reinforcement learning in the presence of thermal dissipation
• Exploring fixed points and eigenstates of quantum systems with reinforcement learning