Article
Adaptive random quantum eigensolver
Author/s | Barraza, N.
Pan, C.-Y. Lamata Manuel, Lucas ![]() ![]() ![]() ![]() ![]() ![]() Solano, E. Albarrán Arriagada, Francisco |
Department | Universidad de Sevilla. Departamento de Física Atómica, Molecular y Nuclear |
Publication Date | 2022 |
Deposit Date | 2022-05-09 |
Published in |
|
Abstract | We propose an adaptive random quantum algorithm to obtain an optimized eigensolver. Specifically, we introduce a general method to parametrize and optimize the probability density function of a random number generator, ... We propose an adaptive random quantum algorithm to obtain an optimized eigensolver. Specifically, we introduce a general method to parametrize and optimize the probability density function of a random number generator, which is the core of stochastic algorithms. We follow a bioinspired evolutionary mutation method to introduce changes in the involved matrices. Our optimization is based on two figures of merit: learning speed and learning accuracy. This method provides high fidelities for the searched eigenvectors and faster convergence on the way to quantum advantage with current noisy intermediate-scaled quantum computers. |
Funding agencies | Junta de Andalucía Science and Technology Commission of Shanghai Municipality |
Project ID. | P20-00617
![]() US-1380840 ![]() 2019SHZDZX01-ZX04 ![]() |
Citation | Barraza, N., Pan, C.-., Lamata Manuel, L., Solano, E. y Albarrán Arriagada, F. (2022). Adaptive random quantum eigensolver. Physical Review A, 105 (5), 052406. |
Files | Size | Format | View | Description |
---|---|---|---|---|
PhysRevA.105.052406.pdf | 948.7Kb | ![]() | View/ | |