% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Bazavov:1049489,
      author       = {Bazavov, Alexei and Henke, Brandon and Hostetler, Leon and
                      Lee, Dean and Lin, Huey-Wen and Pederiva, Giovanni and
                      Shindler, Andrea},
      title        = {{E}fficient state preparation for the {S}chwinger model
                      with a theta term},
      journal      = {Physical review / D},
      volume       = {111},
      number       = {7},
      issn         = {2470-0010},
      address      = {Ridge, NY},
      publisher    = {American Physical Society},
      reportid     = {FZJ-2025-05297},
      pages        = {074515},
      year         = {2025},
      abstract     = {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 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.},
      cin          = {JSC},
      ddc          = {530},
      cid          = {I:(DE-Juel1)JSC-20090406},
      pnm          = {5111 - Domain-Specific Simulation $\&$ Data Life Cycle Labs
                      (SDLs) and Research Groups (POF4-511) / DFG project
                      G:(GEPRIS)460248186 - PUNCH4NFDI - Teilchen, Universum,
                      Kerne und Hadronen für die NFDI (460248186)},
      pid          = {G:(DE-HGF)POF4-5111 / G:(GEPRIS)460248186},
      typ          = {PUB:(DE-HGF)16},
      doi          = {10.1103/PhysRevD.111.074515},
      url          = {https://juser.fz-juelich.de/record/1049489},
}