Noise tolerance via reinforcement in the quantum search problem

• URL: http://arxiv.org/abs/2604.04137v1
• Date: Sun, 05 Apr 2026 14:48:40 GMT
• Title: Noise tolerance via reinforcement in the quantum search problem
• Abstract summary: We find that reinforcement exponentially reduces computation time of the quantum search problem from $sqrtD$ to $ln D$ in a $D$-dimensional system.<n>Therefor, a reinforced quantum search is expected to exhibit an exponentially larger noise threshold compared to a standard search algorithm in a noisy environment.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We find that reinforcement exponentially reduces computation time of the quantum search problem from $\sqrt{D}$ to $\ln D$ in a $D$-dimensional system. Therefor, a reinforced quantum search is expected to exhibit an exponentially larger noise threshold compared to a standard search algorithm in a noisy environment. We use numerical simulations to characterize the level of noise tolerance via reinforcement in the presence of both coherent and incoherent noise, considering a system of $N$ qubits and a single $D$-level (qudit) system. Our results show that reinforcement significantly enhances the algorithm's success probability and improves the scaling of its computation time with system size. These findings indicate that reinforcement offers a promising strategy for error mitigation, especially when a precise noise model is unavailable.

Related papers

• Variational noise mitigation in quantum circuits: the case of Quantum Fourier Transform [35.18016233072556]
  We perform numerical simulations for two qubits under both coherent and incoherent noise.<n>Our results show that the variational circuit can reproduce the QFT with higher fidelity in scenarios dominated by coherent noise.<n>This demonstrates the potential of the approach as an effective error-mitigation strategy for small- to medium-scale quantum systems.
  arXiv  Detail & Related papers  (2025-11-07T14:35:55Z)
• Complexity of Bernstein--Vazirani algorithm in the presence of noise [0.0]
  We analytically investigated the robustness of the Bernstein--Vazirani algorithm in the presence of depolarizing noise.<n>It was seen that scaling up quantum systems without simultaneously improving qubit quality leads to a sharp decline in the quantum advantage for this algorithm.
  arXiv  Detail & Related papers  (2025-08-03T18:36:01Z)
• Boosting-Enabled Robust System Identification of Partially Observed LTI Systems Under Heavy-Tailed Noise [2.07180164747172]
  We consider the problem of system identification of partially observed linear time-invariant (LTI) systems.<n>We provide non-asymptotic guarantees for identifying the system parameters under general heavy-tailed noise processes.<n>We show that our proposed algorithm achieves sample complexity bounds that nearly match those derived under sub-Gaussian noise.
  arXiv  Detail & Related papers  (2025-04-25T15:57:13Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• General noise-resilient quantum amplitude estimation [0.0]
  We present a novel algorithm that enhances the estimation of amplitude and observable under noise. Remarkably, our algorithm exhibits robustness against noise that varies across different depths of the quantum circuits.
  arXiv  Detail & Related papers  (2023-12-02T09:27:40Z)
• Accurate and Honest Approximation of Correlated Qubit Noise [39.58317527488534]
  We propose an efficient systematic construction of approximate noise channels, where their accuracy can be enhanced by incorporating noise components with higher qubit-qubit correlation degree.<n>We find that, for realistic noise strength typical for fixed-frequency superconducting qubits, correlated noise beyond two-qubit correlation can significantly affect the code simulation accuracy.
  arXiv  Detail & Related papers  (2023-11-15T19:00:34Z)
• Error-mitigated fermionic classical shadows on noisy quantum devices [0.3775283002059579]
  Classical shadow (CS) algorithms offer a solution by reducing the number of quantum state copies needed. We propose an error-mitigated CS algorithm assuming gate-independent, time-stationary, and Markovian (GTM) noise. Our algorithm efficiently estimates $k$-RDMs with $widetildemathcal O(knk)$ state copies and $widetildemathcal O(sqrtn)$ calibration measurements for GTM noise.
  arXiv  Detail & Related papers  (2023-10-19T13:27:19Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Characterizing low-frequency qubit noise [55.41644538483948]
  Fluctuations of the qubit frequencies are one of the major problems to overcome on the way to scalable quantum computers. The statistics of the fluctuations can be characterized by measuring the correlators of the outcomes of periodically repeated Ramsey measurements. This work suggests a method that allows describing qubit dynamics during repeated measurements in the presence of evolving noise.
  arXiv  Detail & Related papers  (2022-07-04T22:48:43Z)
• On the Cryptographic Hardness of Learning Single Periodic Neurons [42.86685497609574]
  We show a simple reduction which demonstrates the cryptographic hardness of learning a single neuron over isotropic Gaussian distributions in the presence of noise. Our proposed algorithm is not a gradient-based or an adversarial SQ-time algorithm, but is rather based on the celebrated Lenstra-LenstraLov'asz (LLL) lattice basis reduction algorithm.
  arXiv  Detail & Related papers  (2021-06-20T20:03:52Z)
• Learning based signal detection for MIMO systems with unknown noise statistics [84.02122699723536]
  This paper aims to devise a generalized maximum likelihood (ML) estimator to robustly detect signals with unknown noise statistics. In practice, there is little or even no statistical knowledge on the system noise, which in many cases is non-Gaussian, impulsive and not analyzable. Our framework is driven by an unsupervised learning approach, where only the noise samples are required.
  arXiv  Detail & Related papers  (2021-01-21T04:48:15Z)
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm [0.0]
  Noise mitigation can be performed up to some error for which we derive upper bounds. Experiments on 15 (23) qubits using IBM's devices to test both the noise model and the error-mitigation scheme. We show that similar effects are expected for Haar-random quantum states and states generated by shallow-depth random circuits.
  arXiv  Detail & Related papers  (2021-01-07T02:19:58Z)

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.