Krylov Complexity of Fermionic and Bosonic Gaussian States
- URL: http://arxiv.org/abs/2309.10382v3
- Date: Mon, 4 Mar 2024 11:31:41 GMT
- Title: Krylov Complexity of Fermionic and Bosonic Gaussian States
- Authors: Kiran Adhikari, Adwait Rijal, Ashok Kumar Aryal, Mausam Ghimire,
Rajeev Singh, Christian Deppe
- Abstract summary: 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.
- Score: 9.194828630186072
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The concept of \emph{complexity} has become pivotal in multiple disciplines,
including quantum information, where it serves as an alternative metric for
gauging the chaotic evolution of a quantum state. This paper focuses on
\emph{Krylov complexity}, a specialized form of quantum complexity that offers
an unambiguous and intrinsically meaningful assessment of the spread of a
quantum state over all possible orthogonal bases. Our study is situated in the
context of Gaussian quantum states, which are fundamental to both Bosonic and
Fermionic systems and can be fully described by a covariance matrix. We show
that while the covariance matrix is essential, it is insufficient alone for
calculating Krylov complexity due to its lack of relative phase information.
Our findings suggest that the relative covariance matrix can provide an upper
bound for Krylov complexity for Gaussian quantum states. We also explore the
implications of Krylov complexity for theories proposing complexity as a
candidate for holographic duality by computing Krylov complexity for the
thermofield double States (TFD) and Dirac field.
Related papers
- On the Complexity of Quantum Field Theory [0.0]
We show that from minimal assertions, one is naturally led to measure complexity by two integers, called format and degree.
We discuss the physical interpretation of our approach in the context of perturbation theory, symmetries, and the renormalization group.
arXiv Detail & Related papers (2024-10-30T18:00:00Z) - A relation between Krylov and Nielsen complexity [0.0]
Krylov complexity and Nielsen complexity are successful approaches to quantifying quantum evolution complexity.
We show that there is a relation between the two quantities.
Namely, the time average of Krylov complexity of state evolution can be expressed as a trace of a certain matrix.
arXiv Detail & Related papers (2023-11-30T09:51:22Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Krylov complexity and chaos in quantum mechanics [0.0]
We numerically evaluate Krylov complexity for operators and states.
We find a clear correlation between variances of Lanczos coefficients and classical Lyapunov exponents.
Our work provides a firm bridge between Krylov complexity and classical/quantum chaos.
arXiv Detail & Related papers (2023-05-26T06:32:45Z) - 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) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - 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) - The complexity of a quantum system and the accuracy of its description [0.0]
The complexity of the quantum state of a multiparticle system is connected by a relation similar to the coordinate-momentum uncertainty relation.
The coefficient in this relation is equal to the maximum number of qubits whose dynamics can be adequately described by quantum theory.
arXiv Detail & Related papers (2021-05-06T09:16:40Z) - Entanglement and Complexity of Purification in (1+1)-dimensional free
Conformal Field Theories [55.53519491066413]
We find pure states in an enlarged Hilbert space that encode the mixed state of a quantum field theory as a partial trace.
We analyze these quantities for two intervals in the vacuum of free bosonic and Ising conformal field theories.
arXiv Detail & Related papers (2020-09-24T18:00:13Z) - Preferred basis, decoherence and a quantum state of the Universe [77.34726150561087]
We review a number of issues in foundations of quantum theory and quantum cosmology.
These issues can be considered as a part of the scientific legacy of H.D. Zeh.
arXiv Detail & Related papers (2020-06-28T18:07:59Z)
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.