Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1801.07620 · Physical review. D/Physical review. D.

Circuit complexity in fermionic field theory

Rifath Khan, Chethan Krishnan, Sanchita Sharma

Published Dec 4, 2018• 215 citations
arXivHTMLPDF

Abstract

We define and calculate versions of complexity for free fermionic quantum field theories in $1+1$ and $3+1$ dimensions, adopting Nielsen's geodesic perspective in the space of circuits. We do this both by discretizing and identifying appropriate classes of Bogoliubov-Valatin transformations, and also directly in the continuum by defining squeezing operators and their generalizations. As a closely related problem, we consider cMERA tensor networks for fermions: viewing them as paths in circuit space, we compute their path lengths. Certain ambiguities that arise in some of these results because of cutoff dependence are discussed.

DOI
10.1103/physrevd.98.126001

Related papers

Circuit complexity in U(1) gauge theory

Amir Moghimnejad, Shahrokh Parvizi

In this paper, we study circuit complexity for a free vector field of a [Formula: see text] gauge theory in Coulomb gauge, and Gaussian states. We introduce a quantum circuit model with Gaussian states, including reference and target states. Using Nielsen’s geometric approach, the complexity then can be found as the shortest geodesic in the space of states. This geodesic is based on the notion of geodesic distance on the Lie group of Bogoliubov transformations equipped with a right-invariant metric. We use the framework of the covariance matrix to compute circuit complexity between Gaussian states. We apply this framework to the free vector field in general dimensions where we compute the circuit complexity of the ground state of the Hamiltonian.

arXiv:2108.08208•Modern Physics Letters A•Nov 10, 2021•5 citations

Circuit Complexity in Z2 EEFT

Kiran Adhikari, Sayantan Choudhury, Sourabh Kumar +6 more

Motivated by recent studies of circuit complexity in weakly interacting scalar field theory, we explore the computation of circuit complexity in Z2 Even Effective Field Theories (Z2 EEFTs). We consider a massive free field theory with higher-order Wilsonian operators such as ϕ4, ϕ6, and ϕ8. To facilitate our computation, we regularize the theory by putting it on a lattice. First, we consider a simple case of two oscillators and later generalize the results to N oscillators. This study was carried out for nearly Gaussian states. In our computation, the reference state is an approximately Gaussian unentangled state, and the corresponding target state, calculated from our theory, is an approximately Gaussian entangled state. We compute the complexity using the geometric approach developed by Nielsen, parameterizing the path-ordered unitary transformation and minimizing the geodesic in the space of unitaries. The contribution of higher-order operators to the circuit complexity in our theory is discussed. We also explore the dependency of complexity on other parameters in our theory for various cases.

arXiv:2109.09759•Symmetry•Dec 22, 2022•10 citations

Circuit complexity in quantum field theory

Ro Jefferson, Robert C. Myers

Motivated by recent studies of holographic complexity, we examine the question of circuit complexity in quantum field theory. We provide a quantum circuit model for the preparation of Gaussian states, in particular the ground state, in a free scalar field theory for general dimensions. Applying the geometric approach of Nielsen to this quantum circuit model, the complexity of the state becomes the length of the shortest geodesic in the space of circuits. We compare the complexity of the ground state of the free scalar field to the analogous results from holographic complexity, and find some surprising similarities.

arXiv:1707.08570•Journal of High Energy Physics•Oct 1, 2017•476 citations

Circuit complexity for free fermions

Lucas Hackl, Robert C. Myers

A bstract 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.

arXiv:1803.10638•Journal of High Energy Physics•Jul 1, 2018•264 citations

Circuit complexity in interacting QFTs and RG flows

Arpan Bhattacharyya, Arvind Shekar, Aninda Sinha

Abstract We consider circuit complexity in certain interacting scalar quantum field theories, mainly focusing on theϕ4theory. 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 thed= 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ϕ4interaction eventually causing the perturbative calculation to breakdown. We discuss how circuit complexity relates with the renormalization group.

arXiv:1808.03105•Journal of High Energy Physics•Oct 1, 2018•161 citations

Complexity functionals and complexity growth limits in continuous MERA circuits

J. Molina-Vilaplana, A. del Campo

Abstract Using the path integral associated to a cMERA tensor network, we provide an operational definition for the complexity of a cMERA circuit/state which is relevant to investigate the complexity of states in quantum field theory. In this framework, it is possible to explicitly establish the correspondence (Minimal) Complexity = (Least) Action. Remarkably, it is also shown how the cMERA complexity action functional can be seen as the action of a Liouville field theory, thus establishing a connection with two dimensional quantum gravity. Concretely, the Liouville mode is identified with the variational parameter defining the cMERA circuit. The rate of complexity growth along the cMERA renormalization group flow is obtained and shown to saturate limits which are in close resemblance to the fundamental bounds to the speed of evolution in unitary quantum dynamics, known as quantum speed limits. We also show that the complexity of a cMERA circuit measured through these complexity functionals, can be cast in terms of the variationally-optimized amount of left-right entanglement created along the cMERA renormalization flow. Our results suggest that the patterns of entanglement in states of a QFT could determine their dual gravitational descriptions through a principle of least complexity.

arXiv:1803.02356•Journal of High Energy Physics•Aug 1, 2018•31 citations
We define and calculate versions of complexity for free fermionic quantum field theories in 1+11+11+1 and 3+13+13+1 dimensions, adopting Nielsen's geodesic perspective in the space of circuits. We do this both by discretizing and identifying appropriate classes of Bogoliubov-Valatin transformations, and also directly in the continuum by defining squeezing operators and their generalizations. As a closely related problem, we consider cMERA tensor networks for fermions: viewing them as paths in circuit space, we compute their path lengths. Certain ambiguities that arise in some of these results because of cutoff dependence are discussed.
In this paper, we study circuit complexity for a free vector field of a [Formula: see text] gauge theory in Coulomb gauge, and Gaussian states. We introduce a quantum circuit model with Gaussian states, including reference and target states. Using Nielsen’s geometric approach, the complexity then can be found as the shortest geodesic in the space of states. This geodesic is based on the notion of geodesic distance on the Lie group of Bogoliubov transformations equipped with a right-invariant metric. We use the framework of the covariance matrix to compute circuit complexity between Gaussian states. We apply this framework to the free vector field in general dimensions where we compute the circuit complexity of the ground state of the Hamiltonian.
Motivated by recent studies of circuit complexity in weakly interacting scalar field theory, we explore the computation of circuit complexity in Z2 Even Effective Field Theories (Z2 EEFTs). We consider a massive free field theory with higher-order Wilsonian operators such as ϕ4, ϕ6, and ϕ8. To facilitate our computation, we regularize the theory by putting it on a lattice. First, we consider a simple case of two oscillators and later generalize the results to N oscillators. This study was carried out for nearly Gaussian states. In our computation, the reference state is an approximately Gaussian unentangled state, and the corresponding target state, calculated from our theory, is an approximately Gaussian entangled state. We compute the complexity using the geometric approach developed by Nielsen, parameterizing the path-ordered unitary transformation and minimizing the geodesic in the space of unitaries. The contribution of higher-order operators to the circuit complexity in our theory is discussed. We also explore the dependency of complexity on other parameters in our theory for various cases.
Motivated by recent studies of holographic complexity, we examine the question of circuit complexity in quantum field theory. We provide a quantum circuit model for the preparation of Gaussian states, in particular the ground state, in a free scalar field theory for general dimensions. Applying the geometric approach of Nielsen to this quantum circuit model, the complexity of the state becomes the length of the shortest geodesic in the space of circuits. We compare the complexity of the ground state of the free scalar field to the analogous results from holographic complexity, and find some surprising similarities.
A bstract 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.
Abstract We consider circuit complexity in certain interacting scalar quantum field theories, mainly focusing on theϕ4theory. 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 thed= 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ϕ4interaction eventually causing the perturbative calculation to breakdown. We discuss how circuit complexity relates with the renormalization group.
Abstract Using the path integral associated to a cMERA tensor network, we provide an operational definition for the complexity of a cMERA circuit/state which is relevant to investigate the complexity of states in quantum field theory. In this framework, it is possible to explicitly establish the correspondence (Minimal) Complexity = (Least) Action. Remarkably, it is also shown how the cMERA complexity action functional can be seen as the action of a Liouville field theory, thus establishing a connection with two dimensional quantum gravity. Concretely, the Liouville mode is identified with the variational parameter defining the cMERA circuit. The rate of complexity growth along the cMERA renormalization group flow is obtained and shown to saturate limits which are in close resemblance to the fundamental bounds to the speed of evolution in unitary quantum dynamics, known as quantum speed limits. We also show that the complexity of a cMERA circuit measured through these complexity functionals, can be cast in terms of the variationally-optimized amount of left-right entanglement created along the cMERA renormalization flow. Our results suggest that the patterns of entanglement in states of a QFT could determine their dual gravitational descriptions through a principle of least complexity.