Publication details
Quantum computing of the electronic structure of crystals by the Variational Quantum Deflation algorithm
| Authors | |
|---|---|
| Year of publication | 2025 |
| Type | Article in Periodical |
| Magazine / Source | Physica Scripta |
| MU Faculty or unit | |
| Citation | |
| web | https://dx.doi.org/10.1088/1402-4896/adbb29 |
| Doi | https://doi.org/10.1088/1402-4896/adbb29 |
| Keywords | Robustness; optimization; quantum; computing; crystals; qubit |
| Attached files | |
| Description | Variational Quantum Eigensolver (VQE) and its extension, Variational Quantum Deflation (VQD), have emerged as promising algorithms for computing ground and excited state energy eigenvalues of Hamiltonians, particularly in quantum physics, chemistry, and materials science. Recently, the VQE and VQD algorithms were implemented to calculate the electronic band structure described by the tight-binding Hamiltonian. Despite their success for simple models, scalability remains a challenge due to the need for a large number of circuit executions, limited qubit coherence times, and low gate fidelities. In this work, we implemented the VQE and VQD algorithms for tight-binding models of diamond and zincblende crystal structures (Sn, C, Si, Ge, AlP, AlAs, AlSb, and GaP) using a quantum computer simulator. We investigate the scalability challenges, focusing on the significant overhead caused by a large number of quantum circuit executions required to find the energy eigenvalues. Our analysis highlights the substantial amount of both measurement and optimization overheads in VQD, particularly as the number of excited states increases. Based on our findings, we critically discuss the implications of implementing VQD on current noisy intermediate-scale quantum (NISQ) devices. |