The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Circuit complexity for free fermions
Open accessAbstract
We study circuit complexity for free fermionic field theories and Gaussian states. Our definition of circuit complexity is based on the notion of geodesic distance on the Lie group of special orthogonal transformations equipped with a right-invariant metric. After analyzing the differences and similarities to bosonic circuit complexity, we develop a comprehensive mathematical framework to compute circuit complexity between arbitrary fermionic Gaussian states. We apply this framework to the free Dirac field in four dimensions where we compute the circuit complexity of the Dirac ground state with respect to several classes of spatially unentangled reference states. Moreover, we show that our methods can also be applied to compute the complexity of excited energy eigenstates of the free Dirac field. Finally, we discuss the relation of our results to alternative approaches based on the Fubini-Study metric, the relevance to holography and possible extensions.
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
Orús, R. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.06.013 · Cited by 2,255
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Towards a derivation of holographic entanglement entropy
Casini, H., Huerta, M., & Myers, R. C. (2011) · Journal of High Energy Physics · doi:10.1007/jhep05(2011)036 · Cited by 1,347
Self-citationThe Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
Generalized gravitational entropy
Lewkowycz, A., & Maldacena, J. (2013) · Journal of High Energy Physics · doi:10.1007/jhep08(2013)090 · Cited by 1,183
Bravyi, S. B., & Kitaev, A. Y. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6254 · Cited by 1,033
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
Deriving covariant holographic entanglement
Dong, X., Lewkowycz, A., & Rangamani, M. (2016) · Journal of High Energy Physics · doi:10.1007/jhep11(2016)028 · Cited by 268
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.”
BackgroundSelf-citationGeometry of variational methods: dynamics of closed quantum systems
Hackl, L., Guaita, T., Shi, T., Haegeman, J., Demler, E., & Cirac, J. I. (2020) · SciPost Physics · doi:10.21468/scipostphys.9.4.048 · Cited by 110
“This allowed for a unified formulation of bosonic and fermionic Gaussian states [77,78], which enabled new results in the context of their entanglement dynamics [79–81], the typicality of energy eigenstate entanglement [82–84] and in the study of circuit complexity in quantum field theory [85,86].”
BackgroundSelf-citation
Metadata
- Authors
- Hackl, L., & Myers, R. C.
- Venue
- Journal of High Energy Physics
- Published
- 2018-07
- Volume
- 2018
- Issue
- 7
- ISSN
- 1029-8479 (ISSN-L)
- OpenAlex
- W2794633558
- Cited by
- 196
- References
- 11
- FWCI
- 13.63
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Circuit complexity for free fermions. https://app.cochat.ai/papers/10.1007/jhep07(2018)139
- The paper
- Hackl, L., & Myers, R. C. (2018). Circuit complexity for free fermions. Journal of High Energy Physics. https://doi.org/10.1007/jhep07(2018)139
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.