Localization of quantum walk with classical randomness: Comparison between manual methods and supervised machine learning

• URL: http://arxiv.org/abs/2304.14348v3
• Date: Thu, 7 Sep 2023 12:35:08 GMT
• Title: Localization of quantum walk with classical randomness: Comparison between manual methods and supervised machine learning
• Authors: Christopher Mastandrea and Chih-Chun Chien
• Abstract summary: A transition of quantum walk induced by classical randomness changes the probability distribution of the walker from a two-peak structure to a single-peak one when the random parameter exceeds a critical value. We first establish the generality of the localization by showing its emergence in the presence of random rotation or translation. The transition point can be located manually by examining the probability distribution, momentum of inertia, and inverse participation ratio.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A transition of quantum walk induced by classical randomness changes the probability distribution of the walker from a two-peak structure to a single-peak one when the random parameter exceeds a critical value. We first establish the generality of the localization by showing its emergence in the presence of random rotation or translation. The transition point can be located manually by examining the probability distribution, momentum of inertia, and inverse participation ratio. As a comparison, we implement three supervised machine learning methods, the support vector machine (SVM), multi-layer perceptron neural network, and convolutional neural network with the same data and show they are able to identify the transition. While the SVM sometimes underestimate the exponents compared to the manual methods, the two neural-network methods show more deviation for the case with random translation due to the fluctuating probability distributions. Our work illustrates potentials and challenges facing machine learning of physical systems with mixed quantum and classical probabilities.

Related papers

• Hierarchical Learning for Quantum ML: Novel Training Technique for Large-Scale Variational Quantum Circuits [0.6906005491572401]
  hierarchical learning is a novel variational architecture for efficient training of large-scale variational quantum circuits. We show that the most significant (qu)bits have a greater effect on the final distribution and can be learned first. This is the first practical demonstration of variational learning on large numbers of qubits.
  arXiv  Detail & Related papers  (2023-11-21T19:00:03Z)
• Machine learning in and out of equilibrium [58.88325379746631]
  Our study uses a Fokker-Planck approach, adapted from statistical physics, to explore these parallels. We focus in particular on the stationary state of the system in the long-time limit, which in conventional SGD is out of equilibrium. We propose a new variation of Langevin dynamics (SGLD) that harnesses without replacement minibatching.
  arXiv  Detail & Related papers  (2023-06-06T09:12:49Z)
• Mapping of attention mechanisms to a generalized Potts model [50.91742043564049]
  We show that training a neural network is exactly equivalent to solving the inverse Potts problem by the so-called pseudo-likelihood method. We also compute the generalization error of self-attention in a model scenario analytically using the replica method.
  arXiv  Detail & Related papers  (2023-04-14T16:32:56Z)
• Deep learning of spatial densities in inhomogeneous correlated quantum systems [0.0]
  We show that we can learn to predict densities using convolutional neural networks trained on random potentials. We show that our approach can handle well the interplay of interference and interactions and the behaviour of models with phase transitions in inhomogeneous situations.
  arXiv  Detail & Related papers  (2022-11-16T17:10:07Z)
• Observation of entanglement negativity transition of pseudo-random mixed states [23.43987389179338]
  Multipartite entanglement is a key resource for quantum computation. Here, we report the observation of entanglement transition quantified by negativity using a fully connected 20-qubit superconducting processor. Our simulator provides a powerful tool to generate random states and understand the entanglement structure for multipartite quantum systems.
  arXiv  Detail & Related papers  (2022-08-29T02:56:05Z)
• Dual Lottery Ticket Hypothesis [71.95937879869334]
  Lottery Ticket Hypothesis (LTH) provides a novel view to investigate sparse network training and maintain its capacity. In this work, we regard the winning ticket from LTH as the subnetwork which is in trainable condition and its performance as our benchmark. We propose a simple sparse network training strategy, Random Sparse Network Transformation (RST), to substantiate our DLTH.
  arXiv  Detail & Related papers  (2022-03-08T18:06:26Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Generative Quantum Learning of Joint Probability Distribution Functions [1.221966660783828]
  We design quantum machine learning algorithms to model copulas. We show that any copula can be naturally mapped to a multipartite maximally entangled state. A variational ansatz we christen as a qopula' creates arbitrary correlations between variables.
  arXiv  Detail & Related papers  (2021-09-13T20:50:15Z)
• 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)
• Neuromorphic quantum computing [0.0]
  We propose that neuromorphic computing can perform quantum operations. We show for a two qubit system that quantum gates can be learned as a change of parameters for neural network dynamics.
  arXiv  Detail & Related papers  (2020-05-04T14:46:48Z)
• 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.