The Stabilizer Bootstrap of Quantum Machine Learning with up to 10000 qubits

• URL: http://arxiv.org/abs/2412.11356v1
• Date: Mon, 16 Dec 2024 01:12:00 GMT
• Title: The Stabilizer Bootstrap of Quantum Machine Learning with up to 10000 qubits
• Authors: Yuqing Li, Jinglei Cheng, Xulong Tang, Youtao Zhang, Frederic T. Chong, Junyu Liu,
• Abstract summary: variational quantum circuits could be the leading paradigm in the near-term quantum devices and the early fault-tolerant quantum computers. We use stabilizer bootstrap to optimize quantum neural networks before their quantum execution. We find that, in a general setup of variational ansatze, the possibility of improvements from the stabilizer bootstrap depends on the structure of the observables and the size of the datasets.
• Score: 15.344606386620136
• License:
• Abstract: Quantum machine learning is considered one of the flagship applications of quantum computers, where variational quantum circuits could be the leading paradigm both in the near-term quantum devices and the early fault-tolerant quantum computers. However, it is not clear how to identify the regime of quantum advantages from these circuits, and there is no explicit theory to guide the practical design of variational ansatze to achieve better performance. We address these challenges with the stabilizer bootstrap, a method that uses stabilizer-based techniques to optimize quantum neural networks before their quantum execution, together with theoretical proofs and high-performance computing with 10000 qubits or random datasets up to 1000 data. We find that, in a general setup of variational ansatze, the possibility of improvements from the stabilizer bootstrap depends on the structure of the observables and the size of the datasets. The results reveal that configurations exhibit two distinct behaviors: some maintain a constant probability of circuit improvement, while others show an exponential decay in improvement probability as qubit numbers increase. These patterns are termed strong stabilizer enhancement and weak stabilizer enhancement, respectively, with most situations falling in between. Our work seamlessly bridges techniques from fault-tolerant quantum computing with applications of variational quantum algorithms. Not only does it offer practical insights for designing variational circuits tailored to large-scale machine learning challenges, but it also maps out a clear trajectory for defining the boundaries of feasible and practical quantum advantages.

Related papers

• Quantum learning advantage on a scalable photonic platform [5.788945534225034]
  quantum advantage in learning physical systems remains a largely untapped frontier. We present a photonic implementation of a quantum-enhanced protocol for learning the probability distribution of a bosonic displacement process. Our results demonstrate that even with non-ideal, noisy entanglement, a significant quantum advantage can be realized in continuous-variable quantum systems.
  arXiv  Detail & Related papers  (2025-02-11T18:52:43Z)
• How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits [3.970891204847277]
  Small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits. We show how the road to scaling could be paved by adopting existing semiconductor technology to build much higher-quality qubits. We argue that, to tackle industry-scale classical optimization and machine learning problems, heterogeneous quantum-probabilistic computing with custom-designed accelerators should be considered.
  arXiv  Detail & Related papers  (2024-11-15T18:22:46Z)
• 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)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Large-scale quantum reservoir learning with an analog quantum computer [45.21335836399935]
  We develop a quantum reservoir learning algorithm that harnesses the quantum dynamics of neutral-atom analog quantum computers to process data. We experimentally implement the algorithm, achieving competitive performance across various categories of machine learning tasks. Our findings demonstrate the potential of utilizing classically intractable quantum correlations for effective machine learning.
  arXiv  Detail & Related papers  (2024-07-02T18:00:00Z)
• Avoiding Barren Plateaus with Entanglement [1.6574413179773757]
  We propose incorporating auxiliary control qubits to shift the circuit from a unitary $2$-design to a unitary $1$-design. We then remove these auxiliary qubits to return to the original circuit structure while preserving the unitary $1$-design properties.
  arXiv  Detail & Related papers  (2024-06-06T05:06:05Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)

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.