Generalization of Modular Spread Complexity for Non-Hermitian Density Matrices

• URL: http://arxiv.org/abs/2410.05264v1
• Date: Mon, 7 Oct 2024 17:59:16 GMT
• Title: Generalization of Modular Spread Complexity for Non-Hermitian Density Matrices
• Authors: Aneek Jana, Maitri Ganguli,
• Abstract summary: In this work we generalize the concept of modular spread complexity to the cases where the reduced density matrix is non-Hermitian. We define the quantity pseudo-capacity which generalizes capacity of entanglement, and corresponds to the early modular-time measure of pseudo-modular complexity. We show some analytical calculations for 2-level systems and 4-qubit models and then do numerical investigations on the quantum phase transition of transverse field Ising model.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work we generalize the concept of modular spread complexity to the cases where the reduced density matrix is non-Hermitian. This notion of complexity and associated Lanczos coefficients contain richer information than the pseudo-entropy, which turns out to be one of the first Lanczos coefficients. We also define the quantity pseudo-capacity which generalizes capacity of entanglement, and corresponds to the early modular-time measure of pseudo-modular complexity. We describe how pseudo-modular complexity can be calculated using a slightly modified bi-Lanczos algorithm. Alternatively, the (complex) Lanczos coefficients can also be obtained from the analytic expression of the pseudo-R\'enyi entropy, which can then be used to calculate the pseudo-modular spread complexity. We show some analytical calculations for 2-level systems and 4-qubit models and then do numerical investigations on the quantum phase transition of transverse field Ising model, from the (pseudo) modular spread complexity perspective. As the final example, we consider the $3d$ Chern-Simon gauge theory with Wilson loops to understand the role of topology on modular complexity. The concept of pseudo-modular complexity introduced here can be a useful tool for understanding phases and phase transitions in quantum many body systems, quantum field theories and holography.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Krylov complexity for 1-matrix quantum mechanics [0.0]
  This paper investigates the notion of Krylov complexity, a measure of operator growth, within the framework of 1-matrix quantum mechanics (1-MQM) We analyze the Lanczos coefficients derived from the correlation function, revealing their linear growth even in this integrable system. Our findings in both ground and thermal states of 1-MQM provide new insights into the nature of complexity in quantum mechanical models.
  arXiv  Detail & Related papers  (2024-06-28T18:00:03Z)
• Krylov complexity of modular Hamiltonian evolution [0.0]
  We find that the spread complexity is universally governed by the modular Lyapunov exponent $lambdamod_L=2pi$ and is proportional to the local temperature of the modular Hamiltonian. Our analysis provides explicit examples where entanglement entropy is indeed not enough, however the entanglement spectrum is, and encodes the same information as complexity.
  arXiv  Detail & Related papers  (2023-06-26T14:33:40Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Chaos and multifold complexity for an inverted harmonic oscillator [0.0]
  We prove that complexity is dominated by the longest permutation of the given time combination in an alternating zig-zag'' order. We conjecture that the general structure for multifold complexity should hold true universally for generic quantum systems.
  arXiv  Detail & Related papers  (2022-11-06T14:19:48Z)
• Partial Counterfactual Identification from Observational and Experimental Data [83.798237968683]
  We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data. Our algorithms are validated extensively on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-10-12T02:21:30Z)
• Kolmogorov complexity of unitary transformations in quantum computing [0.0]
  Kolmogorov complexity of unitary transformation is built upon Kolmogorov "qubit complexity" of Berthiaume, W. Van Dam and S. Laplante. In the context of quantum computing, it corresponds to the least possible amount of data to define and describe a quantum circuit or quantum computer program.
  arXiv  Detail & Related papers  (2021-10-10T06:22:58Z)
• 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)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Aspects of The First Law of Complexity [0.0]
  We investigate the first law of complexity proposed in arXiv:1903.04511, i.e., the variation of complexity when the target state is perturbed. Based on Nielsen's geometric approach to quantum circuit complexity, we find the variation only depends on the end of the optimal circuit.
  arXiv  Detail & Related papers  (2020-02-13T21:15:57Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.