Predicting quantum learnability from landscape fluctuation

• URL: http://arxiv.org/abs/2406.11805v2
• Date: Thu, 14 Nov 2024 16:16:13 GMT
• Title: Predicting quantum learnability from landscape fluctuation
• Authors: Hao-Kai Zhang, Chenghong Zhu, Xin Wang,
• Abstract summary: Conflict between trainability and expressibility is a key challenge in variational quantum computing and quantum machine learning. We demonstrate a simple and efficient metric for learnability by comparing the fluctuations of the given training landscape with standard learnable landscapes. It can be estimated efficiently on classical computers via Clifford sampling without actual training on quantum devices.
• Score: 4.852613028421959
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The conflict between trainability and expressibility is a key challenge in variational quantum computing and quantum machine learning. Resolving this conflict necessitates designing specific quantum neural networks (QNN) tailored for specific problems, which urgently needs a general and efficient method to predict the learnability of QNNs without costly training. In this work, we demonstrate a simple and efficient metric for learnability by comparing the fluctuations of the given training landscape with standard learnable landscapes. This metric shows surprising effectiveness in predicting learnability as it unifies the effects of insufficient expressibility, barren plateaus, bad local minima, and overparametrization. Importantly, it can be estimated efficiently on classical computers via Clifford sampling without actual training on quantum devices. We conduct extensive numerical experiments to validate its effectiveness regarding physical and random Hamiltonians. We also prove a compact lower bound for the metric in locally scrambled circuits as analytical guidance. Our findings enable efficient predictions of learnability, allowing fast selection of suitable QNN architectures for a given problem without training, which can greatly improve the efficiency especially when access to quantum devices is limited.

Related papers

• Scalable Quantum Error Mitigation with Neighbor-Informed Learning [16.56662295818668]
  We introduce neighbor-informed learning (NIL), a versatile and scalable quantum error mitigation framework.<n>NIL learns to predict the ideal output of a target quantum circuit from the noisy outputs of its structurally related neighbor'' circuits.<n>A key innovation is our 2-design training method, which generates training data for our machine learning model.
  arXiv  Detail & Related papers  (2025-12-14T07:07:48Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Scalable Quantum Architecture Search via Landscape Analysis [28.48505903998775]
  quantum architecture search (QAS) plays a pivotal role in variational quantum computing.<n>We introduce a scalable, training-free QAS framework that efficiently explores and evaluates quantum circuits.<n>Our framework attains robust performance on a challenging 50-qubit quantum many-body simulation.
  arXiv  Detail & Related papers  (2025-05-08T16:13:23Z)
• Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
  We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC) This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions. Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
  arXiv  Detail & Related papers  (2024-11-13T12:03:39Z)
• Entanglement-induced provable and robust quantum learning advantages [0.0]
  We rigorously establish a noise-robust, unconditional quantum learning advantage in terms of expressivity, inference speed, and training efficiency. Our proof is information-theoretic and pinpoints the origin of this advantage.
  arXiv  Detail & Related papers  (2024-10-04T02:39:07Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Training-efficient density quantum machine learning [2.918930150557355]
  Quantum machine learning requires powerful, flexible and efficiently trainable models. We present density quantum neural networks, a learning model incorporating randomisation over a set of trainable unitaries.
  arXiv  Detail & Related papers  (2024-05-30T16:40:28Z)
• Neural auto-designer for enhanced quantum kernels [59.616404192966016]
  We present a data-driven approach that automates the design of problem-specific quantum feature maps. Our work highlights the substantial role of deep learning in advancing quantum machine learning.
  arXiv  Detail & Related papers  (2024-01-20T03:11:59Z)
• Statistical Analysis of Quantum State Learning Process in Quantum Neural Networks [4.852613028421959]
  Quantum neural networks (QNNs) have been a promising framework in pursuing near-term quantum advantage. We develop a no-go theorem for learning an unknown quantum state with QNNs even starting from a high-fidelity initial state.
  arXiv  Detail & Related papers  (2023-09-26T14:54:50Z)
• Splitting and Parallelizing of Quantum Convolutional Neural Networks for Learning Translationally Symmetric Data [0.0]
  We propose a novel architecture called split-parallelizing QCNN (sp-QCNN) By splitting the quantum circuit based on translational symmetry, the sp-QCNN can substantially parallelize the conventional QCNN without increasing the number of qubits. We show that the sp-QCNN can achieve comparable classification accuracy to the conventional QCNN while considerably reducing the measurement resources required.
  arXiv  Detail & Related papers  (2023-06-12T18:00:08Z)
• Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification [83.20479832949069]
  Quantum neural networks (QNNs) have become an important tool for understanding the physical world, but their advantages and limitations are not fully understood. Here we investigate the problem-dependent power of QCs on multi-class classification tasks. Our work sheds light on the problem-dependent power of QNNs and offers a practical tool for evaluating their potential merit.
  arXiv  Detail & Related papers  (2022-12-29T10:46:40Z)
• The dilemma of quantum neural networks [63.82713636522488]
  We show that quantum neural networks (QNNs) fail to provide any benefit over classical learning models. QNNs suffer from the severely limited effective model capacity, which incurs poor generalization on real-world datasets. These results force us to rethink the role of current QNNs and to design novel protocols for solving real-world problems with quantum advantages.
  arXiv  Detail & Related papers  (2021-06-09T10:41:47Z)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)

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.