| Preprint | |
| Report number | TIF-UNIMI-2024-6 ; arXiv:2408.03987 |
| Title | Double-bracket quantum algorithms for high-fidelity ground state preparation |
| Author(s) | Robbiati, Matteo (CERN ; Milan U.) ; Pedicillo, Edoardo (Milan U. ; Technol. Innovation Inst., UAE) ; Pasquale, Andrea (Milan U. ; Technol. Innovation Inst., UAE) ; Li, Xiaoyue (Nanyang Technol. U.) ; Wright, Andrew (LPHE, Lausanne) ; Farias, Renato M.S. (Technol. Innovation Inst., UAE ; Rio de Janeiro Federal U.) ; Giang, Khanh Uyen (Nanyang Technol. U.) ; Son, Jeongrak (Nanyang Technol. U.) ; Knörzer, Johannes (Zurich, ETH) ; Goh, Siong Thye (A-STAR, Singapore) ; Khoo, Jun Yong (A-STAR, Singapore) ; Ng, Nelly H.Y. (Nanyang Technol. U.) ; Holmes, Zoë (LPHE, Lausanne) ; Carrazza, Stefano (CERN ; Milan U. ; Technol. Innovation Inst., UAE ; INFN, Milan) ; Gluza, Marek (Nanyang Technol. U.) |
| Imprint | 2024-08-07 |
| Number of pages | 18 |
| Note | 5 pages + appendix, 4 figures, code available at: https://github.com/qiboteam/boostvqe |
| Subject category | quant-ph ; General Theoretical Physics |
| Abstract | Ground state preparation is a key area where quantum computers are expected to prove advantageous. Double-bracket quantum algorithms (DBQAs) have been recently proposed to diagonalize Hamiltonians and in this work we show how to use them to prepare ground states. We propose to improve an initial state preparation by adding a few steps of DBQAs. The interfaced method systematically achieves a better fidelity while significantly reducing the computational cost of the procedure. For a Heisenberg model, we compile our algorithm using CZ and single-qubit gates into circuits that match capabilities of near-term quantum devices. Moreover, we show that DBQAs can benefit from the experimental availability of increasing circuit depths. Whenever an approximate ground state can be prepared without exhausting the available circuit depth, then DBQAs can be enlisted to algorithmically seek a higher fidelity preparation. |
| Other source | Inspire |
| Copyright/License | preprint: (License: CC BY 4.0) |
Record created 2024-08-22, last modified 2024-11-11
