Saved in:
Bibliographic Details
Main Authors: Bazavov, Alexei, Henke, Brandon, Hostetler, Leon, Lee, Dean, Lin, Huey-Wen, Pederiva, Giovanni, Shindler, Andrea
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2411.00243
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916464351510528
author Bazavov, Alexei
Henke, Brandon
Hostetler, Leon
Lee, Dean
Lin, Huey-Wen
Pederiva, Giovanni
Shindler, Andrea
author_facet Bazavov, Alexei
Henke, Brandon
Hostetler, Leon
Lee, Dean
Lin, Huey-Wen
Pederiva, Giovanni
Shindler, Andrea
contents We present a comparison of different quantum state preparation algorithms and their overall efficiency for the Schwinger model with a theta term. While adiabatic state preparation (ASP) is proved to be effective, in practice it leads to large CNOT gate counts to prepare the ground state. The quantum approximate optimization algorithm (QAOA) provides excellent results while keeping the CNOT counts small by design, at the cost of an expensive classical minimization process. We introduce a ``blocked'' modification of the Schwinger Hamiltonian to be used in the QAOA that further decreases the length of the algorithms as the size of the problem is increased. The rodeo algorithm (RA) provides a powerful tool to efficiently prepare any eigenstate of the Hamiltonian, as long as its overlap with the initial guess is large enough. We obtain the best results when combining the blocked QAOA ansatz and the RA, as this provides an excellent initial state with a relatively short algorithm without the need to perform any classical steps for large problem sizes.
format Preprint
id arxiv_https___arxiv_org_abs_2411_00243
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Efficient State Preparation for the Schwinger Model with a Theta Term
Bazavov, Alexei
Henke, Brandon
Hostetler, Leon
Lee, Dean
Lin, Huey-Wen
Pederiva, Giovanni
Shindler, Andrea
High Energy Physics - Lattice
Quantum Physics
We present a comparison of different quantum state preparation algorithms and their overall efficiency for the Schwinger model with a theta term. While adiabatic state preparation (ASP) is proved to be effective, in practice it leads to large CNOT gate counts to prepare the ground state. The quantum approximate optimization algorithm (QAOA) provides excellent results while keeping the CNOT counts small by design, at the cost of an expensive classical minimization process. We introduce a ``blocked'' modification of the Schwinger Hamiltonian to be used in the QAOA that further decreases the length of the algorithms as the size of the problem is increased. The rodeo algorithm (RA) provides a powerful tool to efficiently prepare any eigenstate of the Hamiltonian, as long as its overlap with the initial guess is large enough. We obtain the best results when combining the blocked QAOA ansatz and the RA, as this provides an excellent initial state with a relatively short algorithm without the need to perform any classical steps for large problem sizes.
title Efficient State Preparation for the Schwinger Model with a Theta Term
topic High Energy Physics - Lattice
Quantum Physics
url https://arxiv.org/abs/2411.00243