Circuit complexity in interacting QFTs and RG flows
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
We consider circuit complexity in certain interacting scalar quantum field theories, mainly focusing on the ϕ4 theory. We work out the circuit complexity for evolving from a nearly Gaussian unentangled reference state to the entangled ground state of the theory. Our approach uses Nielsen’s geometric method, which translates into working out the geodesic equation arising from a certain cost functional. We present a general method, making use of integral transforms, to do the required lattice sums analytically and give explicit expressions for the d= 2,3 cases. Our method enables a study of circuit complexity in the epsilon expansion for the Wilson-Fisher fixed point. We find that with increasing dimensionality the circuit depth increases in the presence of the ϕ4 interaction eventually causing the perturbative calculation to breakdown. We discuss how circuit complexity relates with the renormalization group.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Sachdev, S. (2011) · doi:10.1017/cbo9780511973765 · Cited by 2,842
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120
Entanglement renormalization and holography
Swingle, B. (2012) · Physical Review D · doi:10.1103/physrevd.86.065007 · Cited by 915 · cited 1×
“calculations have been generalized for free fermions in [17,19]. Interesting connections were found with holographic proposals in spite of the fact that these were free theories. It was suggested in [69] that tensor network approach maybe useful to derive qualitative features of holography, especially to understand th…”
Quantum Computation as Geometry
Nielsen, M. A., Dowling, M. R., Gu, M., & Doherty, A. C. (2006) · Science · doi:10.1126/science.1121541 · Cited by 539
Susskind, L. (2016) · Fortschritte der Physik · doi:10.1002/prop.201500095 · Cited by 427
Second law of quantum complexity
Brown, A. R., & Susskind, L. (2018) · Physical Review D · doi:10.1103/physrevd.97.086015 · Cited by 292
Quantum Hamiltonian Complexity
Gharibian, S., Huang, Y., Landau, Z., & Shin, S. W. (2015) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000066 · Cited by 144
Cited by
Holographic complexity equals which action?
Goto, K., Marrochio, H., Myers, R. C., Queimada, L., & Yoshida, B. (2019) · Journal of High Energy Physics · doi:10.1007/jhep02(2019)160 · Cited by 121
“, see [56–73] Developing a proper understanding of complexity in the boundary theory is essential to properly test the various holographic proposals and ultimately, to produce a derivation of one (or more) of these conjectures.”
Background
Metadata
- Authors
- Bhattacharyya, A., Shekar, A., & Sinha, A.
- Venue
- Journal of High Energy Physics
- Published
- 2018-10
- Volume
- 2018
- Issue
- 10
- ISSN
- 1029-8479 (ISSN-L)
- OpenAlex
- W2885303178
- Cited by
- 158
- References
- 9
- FWCI
- 11.72
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.