Regularizing quantum loss landscapes by noise injection

• URL: http://arxiv.org/abs/2505.08759v1
• Date: Tue, 13 May 2025 17:28:08 GMT
• Title: Regularizing quantum loss landscapes by noise injection
• Authors: Daniil S. Bagaev, Maxim A. Gavreev, Alena S. Mastiukova, Aleksey K. Fedorov, Nikita A. Nemkov,
• Abstract summary: We propose a protocol to regularize quantum loss using a noise injection.<n>The protocol can be efficiently implemented both in hardware and in simulations.<n>We observe significant improvements of quality across various problem types.
• Score: 0.5991851254194096
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The difficulty of training variational quantum algorithms and quantum machine learning models is well established. In particular, quantum loss landscapes are often highly non-convex and dominated by poor local minima. While this renders their training NP-hard in general, efficient heuristics that work well for typical instances may still exist. Here, we propose a protocol that uses a targeted noise injection to smooth and regularize quantum loss landscapes. It works by exponentially suppressing the high-frequency components in the Fourier expansion of the quantum loss function. The protocol can be efficiently implemented both in hardware and in simulations. We observe significant and robust improvements of solution quality across various problem types. Our method can be combined with existing techniques mitigating the local minima, such as the quantum natural gradient optimizer, and adds to the toolbox of methods for optimizing quantum loss functions.

Related papers

• Deep-learned error mitigation via partially knitted circuits for the variational quantum eigensolver [0.4999814847776097]
  variational quantum eigensolver (VQE) is generally regarded as a promising quantum algorithm for near-term noisy quantum computers.<n>We show how to make VQE functional via a tailored error mitigation technique based on deep learning.
  arXiv  Detail & Related papers  (2025-06-04T16:40:18Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Application of zero-noise extrapolation-based quantum error mitigation to a silicon spin qubit [0.08603957004874943]
  We report the implementation of a zero-noise extrapolation-based error mitigation technique on a silicon spin qubit platform. This technique has been successfully demonstrated for other platforms such as superconducting qubits, trapped-ion qubits, and photonic processors.
  arXiv  Detail & Related papers  (2024-10-14T09:51:21Z)
• 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)
• Training variational quantum algorithms with random gate activation [2.297921151044199]
  Variational quantum algorithms (VQAs) hold great potentials for near-term applications. VQAs suffer from severe barren plateau problem as well as have a large probability of being trapped in local minima. We propose a novel training algorithm with random quantum gate activation for VQAs to efficiently address these two issues.
  arXiv  Detail & Related papers  (2023-03-14T18:01:46Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Limitations of variational quantum algorithms: a quantum optimal transport approach [11.202435939275675]
  We obtain extremely tight bounds for standard NISQ proposals in both the noisy and noiseless regimes. The bounds limit the performance of both circuit model algorithms, such as QAOA, and also continuous-time algorithms, such as quantum annealing.
  arXiv  Detail & Related papers  (2022-04-07T13:58:44Z)
• Surviving The Barren Plateau in Variational Quantum Circuits with Bayesian Learning Initialization [0.0]
  Variational quantum-classical hybrid algorithms are seen as a promising strategy for solving practical problems on quantum computers in the near term. Here, we introduce the fast-and-slow algorithm, which uses gradients to identify a promising region in Bayesian space. Our results move variational quantum algorithms closer to their envisioned applications in quantum chemistry, optimization, and quantum simulation problems.
  arXiv  Detail & Related papers  (2022-03-04T17:48:57Z)
• 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)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Learning-based quantum error mitigation [3.615369748154691]
  NISQ-era quantum computers will need to employ powerful error mitigation techniques. We present a method by which the proper compensation strategy can be learned ab initio. We demonstrate the power of the technique both with real quantum hardware (IBM devices) and exactly-emulated imperfect quantum computers.
  arXiv  Detail & Related papers  (2020-05-15T15:45:10Z)

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.