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:2006.00921 · Journal of High Energy Physics

Complexity of mixed Gaussian states from Fisher information geometry

Giuseppe Di Giulio, Erik Tonni C

Published Dec 1, 2020• 41 citations
arXivHTMLPDF

Abstract

Abstract We study the circuit complexity for mixed bosonic Gaussian states in harmonic lattices in any number of dimensions. By employing the Fisher information geometry for the covariance matrices, we consider the optimal circuit connecting two states with vanishing first moments, whose length is identified with the complexity to create a target state from a reference state through the optimal circuit. Explicit proposals to quantify the spectrum complexity and the basis complexity are discussed. The purification of the mixed states is also analysed. In the special case of harmonic chains on the circle or on the infinite line, we report numerical results for thermal states and reduced density matrices.

DOI
10.1007/jhep12(2020)101

Related papers

Circuit Complexity of Mixed States

Shan-Ming Ruan

Quantum information has produced fresh insights into foundational questions about the AdS/CFT correspondence. One fascinating concept, which has captured increasing attention, is quantum circuit complexity. As a natural generalization for the complexity of pure states, we investigate the circuit complexity of mixed states in this thesis. \n \nFirst of all, we explore the so-called purification complexity which is defined as the lowest value of the circuit complexity, optimized over all possible purifications of a given mixed state. We focus on studying the complexity of Gaussian mixed states in a free scalar field theory using the ‘purification complexity’. We argue that the optimal purifications only contain the essential number of ancillary degrees of freedom necessary in order to purify the mixed state. We also introduce the concept of ‘mode-by-mode purifications’ where each mode in the mixed state is purified separately and examine the extent to which such purifications are optimal. In order to compare with the results from using the various holographic proposals for the complexity of subregions, we explore the purification complexity for thermal states of a free scalar QFT, and for subregions of the vacuum state in two dimensions. We find a number of qualitative similarities between the two in terms of the structure of divergences and the presence of a volume law. We also examine the ‘mutual complexity’ in the various cases studied in this thesis. \n \nIn addition, we propose to generalize the Fubini-Study method for pure-state complexity to generic quantum states including mixed states by taking Bures metric or quantum Fisher information metric on the space of density matrices as the complexity measure. Due to Uhlmann’s theorem, we show that the mixed-state complexity exactly equals the purification complexity measured by the Fubini-Study metric for purified states but without explicitly applying any purifications. We also find that the purification complexity is nonincreasing under any trace-preserving quantum operations. As an illustration, we study the mixed Gaussian states as an example to explicitly show our conclusions for purification complexity.

•Jul 20, 2021•6 citations

Circuit complexity and entanglement in many-body quantum systems

Giuseppe Di Giulio

Entanglement and circuit complexity are fundamental concepts in quantum information theory which turned out to have considerable applications in various contexts ranging from many-body systems and condensed matter theory to quantum gravity and black hole physics. In order to find connections between these aspects, an insightful approach consists in comparing the complexity with some entanglement measures of a given bipartition, as for instance the Von Neumann entanglement entropy. Since, for a system in a given quantum state, the bipartite entanglement can be determined once a spatial subsystem and its complement are chosen, this comparison has to be made considering the complexity of reduced density matrices. This motivates the development of techniques for determining the circuit complexity of mixed states. In this thesis, focussing on free bosonic systems, we study the circuit complexity of mixed Gaussian states by employing the Fisher information geometry for the covariance matrices. This approach allows computing the complexity between reduced density matrices (subsystem complexity), as well as the complexity between thermal states. It also leads to a precise prescription for computing the spectrum and the basis complexity and the temporal evolution of the subsystem complexity after global and local quantum quenches. The study of the subsystem complexity of a given bipartition and a complete characterisation of its entanglement requires the detailed knowledge of the corresponding reduced density matrix, or, equivalently, of the entanglement Hamiltonian. A part of this thesis is devoted to determining the entanglement Hamiltonians in free theories. At equilibrium, we consider gapless systems, with the aim of recovering the underlying CFT results, and gapped lattice models. The evolution of entanglement Hamiltonians in quantum chains after a global quench is also studied. In addition, other entanglement quantifiers, as the entanglement spectrum and the contour for the entanglement entropies, are discussed in some of these settings. Finally, motivated by theoretical and experimental advances, we also address the issue of how the entanglement splits into the different charge sectors of a system endowed with a U(1) symmetry. We focus in particular on massive theories, either continuous or on the lattice, and we try to understand whether the entanglement equipartition, which is known to characterise gapless systems, survives away from criticality.

•Sep 27, 2021•0 citations

Subsystem complexity after a global quantum quench

Giuseppe Di Giulio, Erik Tonni C

Abstract We study the temporal evolution of the circuit complexity for a subsystem in harmonic lattices after a global quantum quench of the mass parameter, choosing the initial reduced density matrix as the reference state. Upper and lower bounds are derived for the temporal evolution of the complexity for the entire system. The subsystem complexity is evaluated by employing the Fisher information geometry for the covariance matrices. We discuss numerical results for the temporal evolutions of the subsystem complexity for a block of consecutive sites in harmonic chains with either periodic or Dirichlet boundary conditions, comparing them with the temporal evolutions of the entanglement entropy. For infinite harmonic chains, the asymptotic value of the subsystem complexity is studied through the generalised Gibbs ensemble.

arXiv:2102.02764•Journal of High Energy Physics•May 1, 2021•25 citations

Circuit complexity for generalized coherent states in thermal field dynamics

Minyong Guo, Zhong-Ying Fan, Jie Jiang +2 more

In this work, we study the circuit complexity for generalized coherent states in thermal systems by adopting the covariance matrix approach. We focus on the coherent thermal (CT) state, which is non-Gaussian and has a nonvanishing one-point function. We find that even though the CT state cannot be fully determined by the symmetric two-point function, the circuit complexity can still be computed in the framework of the covariance matrix formalism by properly enlarging the covariance matrix. Now the group generated by the unitary is the semiproduct of translation and the symplectic group. If the reference state is Gaussian, the optimal geodesic is still be generated by a horizontal generator such that the circuit complexity can be read from the generalized covariance matrix associated to the target state by taking the cost function to be ${F}_{2}$. For a single harmonic oscillator, we discuss carefully the complexity and its formation in the cases that the reference states are Gaussian and the target space is excited by a single mode or double modes. We show that the study can be extended to the free scalar field theory.

arXiv:2004.00344•Physical review. D/Physical review. D.•Jun 12, 2020•32 citations

Complexity of mixed states in QFT and holography

Elena Cáceres, Shira Chapman, Josiah Couch +3 more

Abstract We study the complexity of Gaussian mixed states in a free scalar field theory using the ‘purification complexity’. The latter is defined as the lowest value of the circuit complexity, optimized over all possible purifications of a given mixed state. We argue that the optimal purifications only contain the essential number of ancillary degrees of freedom necessary in order to purify the mixed state. We also introduce the concept of ‘mode-by- mode purifications’ where each mode in the mixed state is purified separately and examine the extent to which such purifications are optimal. We explore the purification complexity for thermal states of a free scalar QFT in any number of dimensions, and for subregions of the vacuum state in two dimensions. We compare our results to those found using the various holographic proposals for the complexity of subregions. We find a number of qualitative similarities between the two in terms of the structure of divergences and the presence of a volume law. We also examine the ‘mutual complexity’ in the various cases studied in this paper.

arXiv:1909.10557•Journal of High Energy Physics•Mar 3, 2020•111 citations

Subsystem complexity after a local quantum quench

Giuseppe Di Giulio, Erik Tonni C

Abstract We study the temporal evolution of the circuit complexity after the local quench where two harmonic chains are suddenly joined, choosing the initial state as the reference state. We discuss numerical results for the complexity for the entire chain and the subsystem complexity for a block of consecutive sites, obtained by exploiting the Fisher information geometry of the covariance matrices. The qualitative behaviour of the temporal evolutions of the subsystem complexity depends on whether the joining point is inside the subsystem. The revivals and a logarithmic growth observed during these temporal evolutions are discussed. When the joining point is outside the subsystem, the temporal evolutions of the subsystem complexity and of the corresponding entanglement entropy are qualitatively similar.

arXiv:2106.08282•Journal of High Energy Physics•Aug 25, 2021•8 citations
Abstract We study the circuit complexity for mixed bosonic Gaussian states in harmonic lattices in any number of dimensions. By employing the Fisher information geometry for the covariance matrices, we consider the optimal circuit connecting two states with vanishing first moments, whose length is identified with the complexity to create a target state from a reference state through the optimal circuit. Explicit proposals to quantify the spectrum complexity and the basis complexity are discussed. The purification of the mixed states is also analysed. In the special case of harmonic chains on the circle or on the infinite line, we report numerical results for thermal states and reduced density matrices.
Quantum information has produced fresh insights into foundational questions about the AdS/CFT correspondence. One fascinating concept, which has captured increasing attention, is quantum circuit complexity. As a natural generalization for the complexity of pure states, we investigate the circuit complexity of mixed states in this thesis. \n \nFirst of all, we explore the so-called purification complexity which is defined as the lowest value of the circuit complexity, optimized over all possible purifications of a given mixed state. We focus on studying the complexity of Gaussian mixed states in a free scalar field theory using the ‘purification complexity’. We argue that the optimal purifications only contain the essential number of ancillary degrees of freedom necessary in order to purify the mixed state. We also introduce the concept of ‘mode-by-mode purifications’ where each mode in the mixed state is purified separately and examine the extent to which such purifications are optimal. In order to compare with the results from using the various holographic proposals for the complexity of subregions, we explore the purification complexity for thermal states of a free scalar QFT, and for subregions of the vacuum state in two dimensions. We find a number of qualitative similarities between the two in terms of the structure of divergences and the presence of a volume law. We also examine the ‘mutual complexity’ in the various cases studied in this thesis. \n \nIn addition, we propose to generalize the Fubini-Study method for pure-state complexity to generic quantum states including mixed states by taking Bures metric or quantum Fisher information metric on the space of density matrices as the complexity measure. Due to Uhlmann’s theorem, we show that the mixed-state complexity exactly equals the purification complexity measured by the Fubini-Study metric for purified states but without explicitly applying any purifications. We also find that the purification complexity is nonincreasing under any trace-preserving quantum operations. As an illustration, we study the mixed Gaussian states as an example to explicitly show our conclusions for purification complexity.
Entanglement and circuit complexity are fundamental concepts in quantum information theory which turned out to have considerable applications in various contexts ranging from many-body systems and condensed matter theory to quantum gravity and black hole physics. In order to find connections between these aspects, an insightful approach consists in comparing the complexity with some entanglement measures of a given bipartition, as for instance the Von Neumann entanglement entropy. Since, for a system in a given quantum state, the bipartite entanglement can be determined once a spatial subsystem and its complement are chosen, this comparison has to be made considering the complexity of reduced density matrices. This motivates the development of techniques for determining the circuit complexity of mixed states. In this thesis, focussing on free bosonic systems, we study the circuit complexity of mixed Gaussian states by employing the Fisher information geometry for the covariance matrices. This approach allows computing the complexity between reduced density matrices (subsystem complexity), as well as the complexity between thermal states. It also leads to a precise prescription for computing the spectrum and the basis complexity and the temporal evolution of the subsystem complexity after global and local quantum quenches. The study of the subsystem complexity of a given bipartition and a complete characterisation of its entanglement requires the detailed knowledge of the corresponding reduced density matrix, or, equivalently, of the entanglement Hamiltonian. A part of this thesis is devoted to determining the entanglement Hamiltonians in free theories. At equilibrium, we consider gapless systems, with the aim of recovering the underlying CFT results, and gapped lattice models. The evolution of entanglement Hamiltonians in quantum chains after a global quench is also studied. In addition, other entanglement quantifiers, as the entanglement spectrum and the contour for the entanglement entropies, are discussed in some of these settings. Finally, motivated by theoretical and experimental advances, we also address the issue of how the entanglement splits into the different charge sectors of a system endowed with a U(1) symmetry. We focus in particular on massive theories, either continuous or on the lattice, and we try to understand whether the entanglement equipartition, which is known to characterise gapless systems, survives away from criticality.
Abstract We study the temporal evolution of the circuit complexity for a subsystem in harmonic lattices after a global quantum quench of the mass parameter, choosing the initial reduced density matrix as the reference state. Upper and lower bounds are derived for the temporal evolution of the complexity for the entire system. The subsystem complexity is evaluated by employing the Fisher information geometry for the covariance matrices. We discuss numerical results for the temporal evolutions of the subsystem complexity for a block of consecutive sites in harmonic chains with either periodic or Dirichlet boundary conditions, comparing them with the temporal evolutions of the entanglement entropy. For infinite harmonic chains, the asymptotic value of the subsystem complexity is studied through the generalised Gibbs ensemble.
In this work, we study the circuit complexity for generalized coherent states in thermal systems by adopting the covariance matrix approach. We focus on the coherent thermal (CT) state, which is non-Gaussian and has a nonvanishing one-point function. We find that even though the CT state cannot be fully determined by the symmetric two-point function, the circuit complexity can still be computed in the framework of the covariance matrix formalism by properly enlarging the covariance matrix. Now the group generated by the unitary is the semiproduct of translation and the symplectic group. If the reference state is Gaussian, the optimal geodesic is still be generated by a horizontal generator such that the circuit complexity can be read from the generalized covariance matrix associated to the target state by taking the cost function to be F2{F}_{2}F2​. For a single harmonic oscillator, we discuss carefully the complexity and its formation in the cases that the reference states are Gaussian and the target space is excited by a single mode or double modes. We show that the study can be extended to the free scalar field theory.
Abstract We study the complexity of Gaussian mixed states in a free scalar field theory using the ‘purification complexity’. The latter is defined as the lowest value of the circuit complexity, optimized over all possible purifications of a given mixed state. We argue that the optimal purifications only contain the essential number of ancillary degrees of freedom necessary in order to purify the mixed state. We also introduce the concept of ‘mode-by- mode purifications’ where each mode in the mixed state is purified separately and examine the extent to which such purifications are optimal. We explore the purification complexity for thermal states of a free scalar QFT in any number of dimensions, and for subregions of the vacuum state in two dimensions. We compare our results to those found using the various holographic proposals for the complexity of subregions. We find a number of qualitative similarities between the two in terms of the structure of divergences and the presence of a volume law. We also examine the ‘mutual complexity’ in the various cases studied in this paper.
Abstract We study the temporal evolution of the circuit complexity after the local quench where two harmonic chains are suddenly joined, choosing the initial state as the reference state. We discuss numerical results for the complexity for the entire chain and the subsystem complexity for a block of consecutive sites, obtained by exploiting the Fisher information geometry of the covariance matrices. The qualitative behaviour of the temporal evolutions of the subsystem complexity depends on whether the joining point is inside the subsystem. The revivals and a logarithmic growth observed during these temporal evolutions are discussed. When the joining point is outside the subsystem, the temporal evolutions of the subsystem complexity and of the corresponding entanglement entropy are qualitatively similar.