Performance of Grover's search algorithm with diagonalizable collective
noises
- URL: http://arxiv.org/abs/2111.12219v2
- Date: Wed, 17 May 2023 01:02:05 GMT
- Title: Performance of Grover's search algorithm with diagonalizable collective
noises
- Authors: Minghua Pan, Taiping Xiong and Shenggen Zheng
- Abstract summary: Grover's search algorithm (GSA) is known to experience a loss of its quadratic speedup when exposed to quantum noise.
We show that the performance of GSA can be improved by certain types of noise, such as bit flip and bit-phase flip noise.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Grover's search algorithm (GSA) is known to experience a loss of its
quadratic speedup when exposed to quantum noise. In this study, we partially
agree with this result and present our findings. First, we examine different
typical diagonalizable noises acting on the oracles in GSA and find that the
success probability decreases and oscillates around $1/2$ as the number of
iterations increases. Secondly, our results show that the performance of GSA
can be improved by certain types of noise, such as bit flip and bit-phase flip
noise. Finally, we determine the noise threshold for bit-phase flip noise to
achieve a desired success probability and demonstrate that GSA with bit-phase
flip noise still outperforms its classical counterpart. These results suggest
new avenues for research in noisy intermediate-scale quantum (NISQ) computing,
such as evaluating the feasibility of quantum algorithms with noise and
exploring their applications in machine learning.
Related papers
- Already Moderate Population Sizes Provably Yield Strong Robustness to Noise [53.27802701790209]
We show that two evolutionary algorithms can tolerate constant noise probabilities without increasing the runtime on the OneMax benchmark.
Our results are based on a novel proof argument that the noiseless offspring can be seen as a biased uniform crossover between the parent and the noisy offspring.
arXiv Detail & Related papers (2024-04-02T16:35:52Z) - 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) - Layering and subpool exploration for adaptive Variational Quantum
Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise [0.0]
Adaptive variational quantum eigensolvers (ADAPT-VQEs) are promising candidates for simulations of strongly correlated systems.
Recent efforts have been directed towards compactifying, or layering, their ansatz circuits.
We show that layering leads to an improved noise resilience with respect to amplitude-damping and dephasing noise.
arXiv Detail & Related papers (2023-08-22T18:00:02Z) - Quantum Advantage of Noisy Grover's Algorithm [3.803244458097104]
Grover's search algorithm is the only quantum algorithm with proven advantage to any possible classical search algorithm.
We present a noise-tolerant method that exponentially improves the noise threshold of Grover's algorithm.
arXiv Detail & Related papers (2023-06-19T11:17:32Z) - Scalable noisy quantum circuits for biased-noise qubits [41.78224056793453]
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) - Evaluating the Resilience of Variational Quantum Algorithms to Leakage
Noise [6.467585493563487]
Leakage noise is a damaging source of error that error correction approaches cannot handle.
The impact of this noise on the performance of variational quantum algorithms (VQAs) is yet unknown.
arXiv Detail & Related papers (2022-08-10T14:50:14Z) - 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) - High-Order Qubit Dephasing at Sweet Spots by Non-Gaussian Fluctuators:
Symmetry Breaking and Floquet Protection [55.41644538483948]
We study the qubit dephasing caused by the non-Gaussian fluctuators.
We predict a symmetry-breaking effect that is unique to the non-Gaussian noise.
arXiv Detail & Related papers (2022-06-06T18:02:38Z) - Learning Noise via Dynamical Decoupling of Entangled Qubits [49.38020717064383]
Noise in entangled quantum systems is difficult to characterize due to many-body effects involving multiple degrees of freedom.
We develop and apply multi-qubit dynamical decoupling sequences that characterize noise that occurs during two-qubit gates.
arXiv Detail & Related papers (2022-01-26T20:22:38Z) - Shape Matters: Understanding the Implicit Bias of the Noise Covariance [76.54300276636982]
Noise in gradient descent provides a crucial implicit regularization effect for training over parameterized models.
We show that parameter-dependent noise -- induced by mini-batches or label perturbation -- is far more effective than Gaussian noise.
Our analysis reveals that parameter-dependent noise introduces a bias towards local minima with smaller noise variance, whereas spherical Gaussian noise does not.
arXiv Detail & Related papers (2020-06-15T18:31:02Z) - A deep learning model for noise prediction on near-term quantum devices [137.6408511310322]
We train a convolutional neural network on experimental data from a quantum device to learn a hardware-specific noise model.
A compiler then uses the trained network as a noise predictor and inserts sequences of gates in circuits so as to minimize expected noise.
arXiv Detail & Related papers (2020-05-21T17:47:29Z)
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.