Studying evaporating black hole using quantum computation algorithms on IBM quantum processor

Analyzing complex quantum systems using quantum computational algorithms is one of the most promising applications of quantum computers. This study focuses on evaluating the performance of a custom variational ansatz in the Variational Quantum Eigensolver (VQE) algorithm compared to predefined ansat...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:AIP advances Ročník 14; číslo 12; s. 125121 - 125121-13
Hlavní autoři: Dhaulakhandi, Ritu, Das, Raikhik, Behera, Bikash K., Seo, Felix J.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Melville American Institute of Physics 01.12.2024
AIP Publishing LLC
Témata:
Algorithms
Hamiltonian functions
Microprocessors
Performance evaluation
Quantum computers
Quantum computing
Test stands
Upper bounds
Wave functions
ISSN:2158-3226, 2158-3226
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Analyzing complex quantum systems using quantum computational algorithms is one of the most promising applications of quantum computers. This study focuses on evaluating the performance of a custom variational ansatz in the Variational Quantum Eigensolver (VQE) algorithm compared to predefined ansatzes. To achieve this, we employ the evaporating black hole model as a test bed for our analysis. Using the VQE approach, which integrates quantum and classical computing techniques, we aim to minimize the energy expectation value of the Hamiltonian. By training the circuit parameters of a trial wave function as a parameterized quantum circuit, we determine the upper bound for the ground state energy and assess the optimal variational form. We define a custom ansatz for the VQE protocol and compare its performance with other predefined ansatzes. Additionally, we test the performance of three different classical optimizers to further understand their impact on the VQE algorithm’s efficiency and accuracy.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2158-3226
2158-3226
DOI:10.1063/5.0231558