A universal approach to Krylov State and Operator complexities

• URL: http://arxiv.org/abs/2212.10583v3
• Date: Wed, 28 Jun 2023 14:37:42 GMT
• Title: A universal approach to Krylov State and Operator complexities
• Authors: Mohsen Alishahiha and Souvik Banerjee
• Abstract summary: In our formalism, the Krylov complexity is defined in terms of the density matrix of the associated state. This unified definition of complexity enables us to extend the notion of Krylov complexity to subregion or mixed state complexities.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a general framework in which both Krylov state and operator complexities can be put on the same footing. In our formalism, the Krylov complexity is defined in terms of the density matrix of the associated state which, for the operator complexity, lives on a doubled Hilbert space obtained through the channel-state map. This unified definition of complexity in terms of the density matrices enables us to extend the notion of Krylov complexity, to subregion or mixed state complexities and also naturally to the Krylov mutual complexity. We show that this framework also encompasses nicely the holographic notions of complexity.

Related papers

• Inducing Systematicity in Transformers by Attending to Structurally Quantized Embeddings [60.698130703909804]
  Transformers generalize to novel compositions of structures and entities after being trained on a complex dataset. We propose SQ-Transformer that explicitly encourages systematicity in the embeddings and attention layers. We show that SQ-Transformer achieves stronger compositional generalization than the vanilla Transformer on multiple low-complexity semantic parsing and machine translation datasets.
  arXiv  Detail & Related papers  (2024-02-09T15:53:15Z)
• Discovering modular solutions that generalize compositionally [55.46688816816882]
  We show that identification up to linear transformation purely from demonstrations is possible without having to learn an exponential number of module combinations. We further demonstrate empirically that meta-learning from finite data can discover modular policies that generalize compositionally in a number of complex environments.
  arXiv  Detail & Related papers  (2023-12-22T16:33:50Z)
• Krylov Complexity of Fermionic and Bosonic Gaussian States [9.194828630186072]
  This paper focuses on emphKrylov complexity, a specialized form of quantum complexity. It offers an unambiguous and intrinsically meaningful assessment of the spread of a quantum state over all possible bases.
  arXiv  Detail & Related papers  (2023-09-19T07:32:04Z)
• Krylov complexity in a natural basis for the Schrödinger algebra [0.0]
  We investigate operator growth in quantum systems with two-dimensional Schr"odinger group symmetry. Cases such as the Schr"odinger algebra which is characterized by a semi-direct sum structure are complicated. We compute Krylov complexity for this algebra in a natural orthonormal basis.
  arXiv  Detail & Related papers  (2023-06-05T18:00:03Z)
• Building Krylov complexity from circuit complexity [4.060731229044571]
  We show that Krylov complexity can be rigorously established from circuit complexity when dynamical symmetries exist. Multiple Krylov complexity may be exploited jointly to fully describe operator dynamics.
  arXiv  Detail & Related papers  (2023-03-13T17:59:43Z)
• Krylov complexity in quantum field theory, and beyond [44.99833362998488]
  We study Krylov complexity in various models of quantum field theory. We find that the exponential growth of Krylov complexity satisfies the conjectural inequality, which generalizes the Maldacena-Shenker-Stanford bound on chaos.
  arXiv  Detail & Related papers  (2022-12-29T19:00:00Z)
• Krylov Complexity in Quantum Field Theory [0.9998361283909821]
  We study the Krylov complexity in quantum field theory and make a connection with the holographic "Complexity equals Volume" conjecture. When Krylov basis matches with Fock basis, for several interesting settings, we observe that the Krylov complexity equals the average particle number showing that complexity scales with volume.
  arXiv  Detail & Related papers  (2022-04-05T14:42:10Z)
• Ultimate Speed Limits to the Growth of Operator Complexity [0.0]
  We introduce a fundamental and universal limit to the growth of the Krylov complexity. We show the conditions for this bound to be saturated and illustrate its validity in paradigmatic models of quantum chaos.
  arXiv  Detail & Related papers  (2022-02-10T13:05:11Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• Toda chain flow in Krylov space [77.34726150561087]
  We show that the singularity along the imaginary axis, which is a generic behavior for quantum non-integrable many-body system, is due to delocalization in Krylov space.
  arXiv  Detail & Related papers  (2019-12-27T16:40:10Z)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.