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

Circuit Complexity of Mixed States

Shan-Ming Ruan

Published Jul 20, 2021• 6 citations
OpenAlex

Abstract

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.

Related papers

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

Purification complexity without purifications

Shan-Ming Ruan

Abstract We generalize the Fubini-Study method for pure-state complexity to generic quantum states by taking Bures metric or quantum Fisher information metric (QFIM) 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 purification. We also find the purification complexity is non-increasing under any trace-preserving quantum operations. We also study the mixed Gaussian states as an example to explicitly illustrate our conclusions for purification complexity.

arXiv:2006.01088•Journal of High Energy Physics•Jan 18, 2021•19 citations

Complexity of mixed Gaussian states from Fisher information geometry

Giuseppe Di Giulio, Erik Tonni C

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.

arXiv:2006.00921•Journal of High Energy Physics•Dec 1, 2020•41 citations

Subsystem complexity and holography

César A. Agón, Matthew Headrick, Brian G. Swingle

Abstract As a probe of circuit complexity in holographic field theories, we study sub-system analogues based on the entanglement wedge of the bulk quantities appearing in the “complexity = volume” and “complexity = action” conjectures. We calculate these quantities for one exterior region of an eternal static neutral or charged black hole in general dimensions, dual to a thermal state on one boundary with or without chemical potential respectively, as well as for a shock wave geometry. We then define several analogues of circuit complexity for mixed states, and use tensor networks to gain intuition about them. In the action approach, we find two possible cases depending on an ambiguity in the definition of the action associated with a counterterm. In one case, there is a promising qualitative match between the holographic action and what we call the purification complexity, the minimum number of gates required to prepare an arbitrary purification of the given mixed state. In the other case, the match is to what we call the basis complexity, the minimum number of gates required to prepare the given mixed state starting from a minimal complexity state with the same eigenvalue spectrum. One way to fix this ambiguity is to choose an action definition such that UV divergent part is positive, in which case the best match to the action result is the basis complexity. In contrast, the holographic volume does not appear to match any of our definitions of mixed-state complexity.

arXiv:1804.01561•Journal of High Energy Physics•Feb 1, 2019•127 citations

Krylov Complexity of Purification

Rathindra Nath Das, Takato Mori

In quantum systems, purification can map mixed states into pure states and a nonunitary evolution into a unitary one by enlarging the Hilbert space. We establish a connection between the complexities of mixed quantum states and their purification, proposing new inequalities among these complexities. By examining single qubits, two-qubit Werner states, eight-dimensional Gaussian random unitary ensembles, and infinite-dimensional systems, we demonstrate how these relationships manifest across a broad class of systems. We find that the spread complexity of purification of a vacuum state evolving into a thermal state equals the average number of Rindler particles. This complexity is also shown to adhere to the Lloyd-like bound, indicating a further relation to the quantum speed limit. Finally, using mutual Krylov complexity, we observe subadditivity of the Krylov complexities, which contrasts with known results from holographic volume complexity. We put forward Krylov mutual complexity as a diagnosis of a potential gravity dual of Krylov complexities.

arXiv:2408.00826•Physical Review Letters•Dec 15, 2025•4 citations

Circuit complexity for coherent states

Minyong Guo, Juan Hernandez, Robert C. Myers +1 more

Abstract We examine the circuit complexity of coherent states in a free scalar field theory, applying Nielsen’s geometric approach as in [1]. The complexity of the coherent states have the same UV divergences as the vacuum state complexity and so we consider the finite increase of the complexity of these states over the vacuum state. One observation is that generally, the optimal circuits introduce entanglement between the normal modes at intermediate stages even though our reference state and target states are not entangled in this basis. We also compare our results from Nielsen’s approach with those found using the Fubini-Study method of [2]. For general coherent states, we find that the complexities, as well as the optimal circuits, derived from these two approaches, are different.

arXiv:1807.07677•Journal of High Energy Physics•Oct 1, 2018•161 citations
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.
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 generalize the Fubini-Study method for pure-state complexity to generic quantum states by taking Bures metric or quantum Fisher information metric (QFIM) 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 purification. We also find the purification complexity is non-increasing under any trace-preserving quantum operations. We also study the mixed Gaussian states as an example to explicitly illustrate our conclusions for purification complexity.
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.
Abstract As a probe of circuit complexity in holographic field theories, we study sub-system analogues based on the entanglement wedge of the bulk quantities appearing in the “complexity = volume” and “complexity = action” conjectures. We calculate these quantities for one exterior region of an eternal static neutral or charged black hole in general dimensions, dual to a thermal state on one boundary with or without chemical potential respectively, as well as for a shock wave geometry. We then define several analogues of circuit complexity for mixed states, and use tensor networks to gain intuition about them. In the action approach, we find two possible cases depending on an ambiguity in the definition of the action associated with a counterterm. In one case, there is a promising qualitative match between the holographic action and what we call the purification complexity, the minimum number of gates required to prepare an arbitrary purification of the given mixed state. In the other case, the match is to what we call the basis complexity, the minimum number of gates required to prepare the given mixed state starting from a minimal complexity state with the same eigenvalue spectrum. One way to fix this ambiguity is to choose an action definition such that UV divergent part is positive, in which case the best match to the action result is the basis complexity. In contrast, the holographic volume does not appear to match any of our definitions of mixed-state complexity.
In quantum systems, purification can map mixed states into pure states and a nonunitary evolution into a unitary one by enlarging the Hilbert space. We establish a connection between the complexities of mixed quantum states and their purification, proposing new inequalities among these complexities. By examining single qubits, two-qubit Werner states, eight-dimensional Gaussian random unitary ensembles, and infinite-dimensional systems, we demonstrate how these relationships manifest across a broad class of systems. We find that the spread complexity of purification of a vacuum state evolving into a thermal state equals the average number of Rindler particles. This complexity is also shown to adhere to the Lloyd-like bound, indicating a further relation to the quantum speed limit. Finally, using mutual Krylov complexity, we observe subadditivity of the Krylov complexities, which contrasts with known results from holographic volume complexity. We put forward Krylov mutual complexity as a diagnosis of a potential gravity dual of Krylov complexities.
Abstract We examine the circuit complexity of coherent states in a free scalar field theory, applying Nielsen’s geometric approach as in [1]. The complexity of the coherent states have the same UV divergences as the vacuum state complexity and so we consider the finite increase of the complexity of these states over the vacuum state. One observation is that generally, the optimal circuits introduce entanglement between the normal modes at intermediate stages even though our reference state and target states are not entangled in this basis. We also compare our results from Nielsen’s approach with those found using the Fubini-Study method of [2]. For general coherent states, we find that the complexities, as well as the optimal circuits, derived from these two approaches, are different.