It is found that the stability of the algorithm in the presence of noise is dependent on its variational parameters, and an upper bound on the total variation distance between the noisy and noiseless circuit output is derived as a function of these parameters.
Abstract
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm used for solving combinatorial optimization problems, which is thought to be a promising application of near-term quantum hardware. However, high rates of noise in these devices can obscure meaningful results. Therefore, it is crucial to understand and suppress the effects of noise on the algorithm's output. Here, we find that the stability of the algorithm in the presence of noise is dependent on its variational parameters. Using a Pauli noise model, we derive an upper bound on the total variation distance between the noisy and noiseless circuit output as a function of these parameters. Results from noisy simulations support this bound and give insight into the best methods to use for parameter generation in the presence of noise. We also introduce new methods of optimization using error penalties and truncated search based on this bound to manufacture error resilience. We extend this analysis to the quantum adiabatic algorithm (QAA) by taking the continuous limit of the QAOA.
In this paper, we prove that the Mean-Field Approximate Optimization Algorithm (MF-AOA), a quantum-inspired classical algorithm of the Quantum Approximate Optimization Algorithm (QAOA), is unable to give arbitrary near optimal solution for problems exhibiting the Overlap Gap Property (OGP). We show this by relating the...
This paper compares bit-flip and phase-flip Pauli noise under both layer-level and gate-level noise models, and shows that a smaller asymmetric code can achieve nearly the same improvement as a larger symmetric choice.
Abhishek Yadav, Peter K. Schuhmacher, Michael Epping· 0 citations
This work examines the impact of a variety of noise channels on the critical operator selection step of ADAPT-VQE, showing that, despite the selection criterion's natural resilience to some noise, both coherent and incoherent noise can prevent convergence for sufficiently high noise rates.
Noise accumulation remains a central limitation on the reliable execution of quantum algorithms. This study analyzes the sensitivity of Deutsch’s algorithm to global depolarizing noise using the density-matrix formalism. First, a general analytical expression is derived for the success probability of a quantum circuit...
Jia-Rui Shang· International Journal of App...· 0 citations
Heuristic QAA works even at a single iteration, reducing circuit depth by orders of magnitude compared to standard QAA, and the problem-dependent parameters necessary for reaching optimal algorithmic performance can be reliably approximated with minimal upfront classical computing overhead.
This work constructs a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes.
Sourav Dutta, A. Rudra, Manav Seksaria et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.