Quantum Natural Gradient optimizer on noisy platforms: QAOA as a case study
- URL: http://arxiv.org/abs/2502.20288v1
- Date: Thu, 27 Feb 2025 17:14:32 GMT
- Title: Quantum Natural Gradient optimizer on noisy platforms: QAOA as a case study
- Authors: Federico Dell'Anna, Rafael Gomez-Lurbe, Armando Perez, Elisa Ercolessi,
- Abstract summary: We evaluate the efficacy of Quantum Natural Gradient (QNG) in finding the ground state of the Transverse Field Ising Model (TFIM)<n>Our analysis includes simulations under both idealized noise-free conditions and realistic noisy environments based on calibration data from actual devices.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We investigate the performance of the Quantum Natural Gradient (QNG) optimizer in the presence of noise. Specifically, we evaluate the efficacy of QNG within the Quantum Approximate Optimization Algorithm (QAOA) for finding the ground state of the Transverse Field Ising Model (TFIM). Its performance is benchmarked against the Vanilla Gradient Descent optimizer across two prominent quantum computing platforms: Rydberg atoms and superconducting circuits. Our analysis includes simulations under both idealized noise-free conditions and realistic noisy environments based on calibration data from actual devices. Results demonstrate that QNG consistently outperforms Vanilla Gradient Descent, exhibiting faster convergence on average and greater robustness against random initializations of parameters. This robustness is attributed to the distance regularization in parameter space inherent to QNG. Additionally, QNG achieves a higher convergence rate to the solution, effectively avoiding certain local minima. These findings highlight QNG as a promising tool for optimizing variational quantum algorithms in noisy intermediate-scale quantum (NISQ) devices.
Related papers
- Bayesian Quantum Amplitude Estimation [49.1574468325115]
We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation.
We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
arXiv Detail & Related papers (2024-12-05T18:09:41Z) - Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm [47.47843839099175]
A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently.<n>Momentum-QNG is more effective to escape local minima and plateaus in the variational parameter space.
arXiv Detail & Related papers (2024-09-03T15:21:16Z) - Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - QAOA Performance in Noisy Devices: The Effect of Classical Optimizers and Ansatz Depth [0.32985979395737786]
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm for Near-term Intermediate-Scale Quantum computers (NISQ)
This paper presents an investigation into the impact realistic noise on the classical vectors.
We find that while there is no significant difference in the performance of classicals in a state simulation, the Adam and AMSGrads perform best in the presence of shot noise.
arXiv Detail & Related papers (2023-07-19T17:22:44Z) - Error Mitigation-Aided Optimization of Parameterized Quantum Circuits:
Convergence Analysis [42.275148861039895]
Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors.
gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias.
Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits.
QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
arXiv Detail & Related papers (2022-09-23T10:48:04Z) - Improving the performance of quantum approximate optimization for
preparing non-trivial quantum states without translational symmetry [10.967081346848687]
We study the performance of the quantum approximate optimization algorithm (QAOA) for preparing ground states of target Hamiltonians.
We propose a generalized QAOA assisted by the parameterized resource Hamiltonian to achieve a better performance.
Our work paves the way for performing QAOA on programmable quantum processors without translational symmetry.
arXiv Detail & Related papers (2022-06-06T14:17:58Z) - Quantum Approximate Optimization Algorithm applied to the binary
perceptron [0.46664938579243564]
We apply digitized Quantum Annealing (QA) and Quantum Approximate Optimization Algorithm (QAOA) to a paradigmatic task of supervised learning in artificial neural networks.
We provide evidence for the existence of optimal smooth solutions for the QAOA parameters, which are transferable among typical instances of the same problem.
We prove numerically an enhanced performance of QAOA over traditional QA.
arXiv Detail & Related papers (2021-12-19T18:33:22Z) - 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) - Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices.
We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT)
Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
arXiv Detail & Related papers (2020-10-01T18:14:11Z) - Classical Optimizers for Noisy Intermediate-Scale Quantum Devices [1.43494686131174]
We present a collection of tunings tuned for usage on Noisy Intermediate-Scale Quantum (NISQ) devices.
We analyze the efficiency and effectiveness of different minimizes in a VQE case study.
While most results to date concentrated on tuning the quantum VQE circuit, we show that, in the presence of quantum noise, the classical minimizer step needs to be carefully chosen to obtain correct results.
arXiv Detail & Related papers (2020-04-06T21:31:22Z)
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.