2021
DOI: 10.48550/arxiv.2109.05547
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Some variational recipes for quantum field theories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(8 citation statements)
references
References 74 publications
0
8
0
Order By: Relevance
“…An important outstanding challenge is to find physical applications of the scheme which exhibit an advantage compared to the best known algorithm. Aspirational targets include charged scalar fields at finite chemical potential [39] or variational calculation of scattering [22].…”
Section: Discussion and Future Directionsmentioning
confidence: 99%
See 2 more Smart Citations
“…An important outstanding challenge is to find physical applications of the scheme which exhibit an advantage compared to the best known algorithm. Aspirational targets include charged scalar fields at finite chemical potential [39] or variational calculation of scattering [22].…”
Section: Discussion and Future Directionsmentioning
confidence: 99%
“…Starting from the definition of the loss function (42) (32). Using (22) and (31) Plug these expressions into the evolution equations (26) and consider a linear combination consisting of the θ 1 rows superposed with an imaginary unit multiplying the θ 2 rows to obtain (32).…”
Section: Appendix B Justification For Choice Of Baselinementioning
confidence: 99%
See 1 more Smart Citation
“…[40,116,189,191] for several gauge-theory examples. They can also be taken advantage of in scattering problems as recently proposed [207]. On the other hand, classical computers may prepare non-trivial states through the use of conventional lattice-field-theory methods (as long as sign and signal-to-noise problems are not encountered) or tensor-network-inspired methods (as long as states are area-law entangled).…”
Section: Underlying Simulationsmentioning
confidence: 99%
“…While this algorithms shows the true advantage of a quantum computer, that is to enable a direct evaluation of real-time cross sections in QFTs, its resource requirement will likely prohibit its implementation for even small systems for the foreseeable future. Research is in progress to devise and benchmark less resource-intensive approaches to the scattering problem in the near term, including proposals for variational approaches [207], obtaining phase shifts in prototype spin models via time delay [448], or the use of Lüscher's method [105,106] in extracting low-energy few-body scattering parameters from energy spectra of particles in a finite volume, as is done in the conventional lattice-QCD program [107][108][109][110]. A complete resource analysis of scattering problems in gauge theories, including QCD, is still lacking and the problem is complicated by the absence of fully developed and efficient state-preparation algorithms for a range of non-trivial states in gauge theories, from the interacting vacuum to the scattering wavepackets of confined hadrons.…”
Section: Algorithmic Research For Digital Quantum Computing and Resou...mentioning
confidence: 99%