A quantum‐enhanced implementation of the binary inversion method for gravity data acquisition is discussed. The subsurface structure of a single density anomaly with an assigned density contrast is calculated by using a D‐Wave adiabatic quantum computer. In particular, an iterative heuristic based on quantum annealing that recovers a sharp shape of the subsurface anomaly is developed. Such a task is accomplished by collecting partial images obtained by quantum annealing processes for optimal Lagrange penalty coefficients. The results are compared with those obtained according to the same cost function minimized via genetic algorithms by conventional hardware on a realistic 2D dataset. The outcomes of this work are promising as the reconstructed model is obtained in tenths of iterations instead of the hundreds required in conventional methods. Moreover, for the part of the computation that resides in the quantum processing unit, the computational cost of the single quantum annealing descent is constant with respect to the number of degrees of freedom of the subsurface grid. The implemented method is likely to reveal its full potential on forthcoming quantum annealing devices, outperforming existing techniques.
Gravity Data Inversion by Adiabatic Quantum Computing / G. Siddi Moreau, L. Pisani, A. Mameli, C. Podda, G. Cao, E. Prati. - In: ADVANCED QUANTUM TECHNOLOGIES. - ISSN 2511-9044. - (2023), pp. 2300152.1-2300152.13. [Epub ahead of print] [10.1002/qute.202300152]
Gravity Data Inversion by Adiabatic Quantum Computing
E. PratiUltimo
2023
Abstract
A quantum‐enhanced implementation of the binary inversion method for gravity data acquisition is discussed. The subsurface structure of a single density anomaly with an assigned density contrast is calculated by using a D‐Wave adiabatic quantum computer. In particular, an iterative heuristic based on quantum annealing that recovers a sharp shape of the subsurface anomaly is developed. Such a task is accomplished by collecting partial images obtained by quantum annealing processes for optimal Lagrange penalty coefficients. The results are compared with those obtained according to the same cost function minimized via genetic algorithms by conventional hardware on a realistic 2D dataset. The outcomes of this work are promising as the reconstructed model is obtained in tenths of iterations instead of the hundreds required in conventional methods. Moreover, for the part of the computation that resides in the quantum processing unit, the computational cost of the single quantum annealing descent is constant with respect to the number of degrees of freedom of the subsurface grid. The implemented method is likely to reveal its full potential on forthcoming quantum annealing devices, outperforming existing techniques.File | Dimensione | Formato | |
---|---|---|---|
2023-AQT-SiddiPrati.pdf
accesso aperto
Descrizione: Research Article
Tipologia:
Publisher's version/PDF
Dimensione
1.69 MB
Formato
Adobe PDF
|
1.69 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.