Operator Growth and Symmetry-Resolved Coefficient Entropy in Quantum Maps

• URL: http://arxiv.org/abs/2111.08729v1
• Date: Tue, 16 Nov 2021 19:04:29 GMT
• Title: Operator Growth and Symmetry-Resolved Coefficient Entropy in Quantum Maps
• Authors: Laimei Nie
• Abstract summary: We show that under a generic choice of operator basis, the coefficient entropy fails to capture the suppression of operator growth caused by the symmetries. We propose "symmetry-resolved coefficient entropy" as the proper diagnosis of operator complexity.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Operator growth, or operator spreading, describes the process where a "simple" operator acquires increasing complexity under the Heisenberg time evolution of a chaotic dynamics, therefore has been a key concept in the study of quantum chaos in both single-particle and many-body systems. An explicit way to quantify the complexity of an operator is the Shannon entropy of its operator coefficients over a chosen set of operator basis, dubbed "coefficient entropy". However, it remains unclear if the basis-dependency of the coefficient entropy may result in a false diagnosis of operator growth, or the lack thereof. In this paper, we examine the validity of coefficient entropy in the presence of hidden symmetries. Using the quantum cat map as an example, we show that under a generic choice of operator basis, the coefficient entropy fails to capture the suppression of operator growth caused by the symmetries. We further propose "symmetry-resolved coefficient entropy" as the proper diagnosis of operator complexity, which takes into account robust unknown symmetries, and demonstrate its effectiveness in the case of quantum cat map.

Related papers

• Operator delocalization in disordered spin chains via exact MPO marginals [0.0]
  We introduce a complementary measure of operator complexity: the operator length.<n>Both quantities are defined from the expansion of time-evolved operators in the Pauli basis.<n>We show that both the operator mass and length can be computed efficiently and exactly within a matrix-productoperator framework.
  arXiv  Detail & Related papers  (2026-01-18T15:03:25Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• Exploiting emergent symmetries in disorder-averaged quantum dynamics [0.0]
  We develop schemes for efficiently constructing symmetric sectors of the disorder-averaged dynamical map.<n>After disorder averaging, this system becomes effectively permutation-invariant, allowing for the simulation of large system.
  arXiv  Detail & Related papers  (2025-07-13T12:38:19Z)
• Predicting symmetries of quantum dynamics with optimal samples [41.42817348756889]
  Identifying symmetries in quantum dynamics is a crucial challenge with profound implications for quantum technologies. We introduce a unified framework combining group representation theory and subgroup hypothesis testing to predict these symmetries with optimal efficiency. We prove that parallel strategies achieve the same performance as adaptive or indefinite-causal-order protocols.
  arXiv  Detail & Related papers  (2025-02-03T15:57:50Z)
• Singularity and universality from von Neumann to Rényi entanglement entropy and disorder operator in Motzkin chains [13.286899418567023]
  We show that the scaling of the disorder operators also follows $logl$ as the leading behavior, matching that of the R'enyi entropy. We propose that the coefficient of the term $logl$ is a universal constant shared by both the R'enyi entropies and disorder operators.
  arXiv  Detail & Related papers  (2025-01-29T01:33:07Z)
• Quantum Circuits, Feature Maps, and Expanded Pseudo-Entropy: Analysis of Encoding Real-World Data into a Quantum Computer [0.8493762124830675]
  The technique analyzes quantum operators, through an extension of the functions of von Neumann entropy and state-transition pseudo-entropy.<n>The characteristics of a class of quantum feature maps are rigorously shown.
  arXiv  Detail & Related papers  (2024-10-29T14:38:01Z)
• Operator entanglement in $\mathrm{SU}(2)$-symmetric dissipative quantum many-body dynamics [4.927579219242575]
  Presence of symmetries can lead to nontrivial dynamics of operator entanglement in open quantum many-body systems. We numerically study the far-from-equilibrium dynamics of operator entanglement in a dissipative quantum many-body system.
  arXiv  Detail & Related papers  (2024-10-24T06:33:15Z)
• Quantum Tensor Product Decomposition from Choi State Tomography [0.0]
  We present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor product decomposition of a unitary. This quantum algorithm may be used to make predictions about operator non-locality, effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries.
  arXiv  Detail & Related papers  (2024-02-07T16:36:47Z)
• Operator dynamics in Lindbladian SYK: a Krylov complexity perspective [0.0]
  We analytically establish the linear growth of two sets of coefficients for any generic jump operators. We find that the Krylov complexity saturates inversely with the dissipation strength, while the dissipative timescale grows logarithmically.
  arXiv  Detail & Related papers  (2023-11-01T18:00:06Z)
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• Chaotic Roots of the Modular Multiplication Dynamical System in Shor's Algorithm [0.0]
  Shor's factoring algorithm, believed to provide an exponential speedup over classical computation, relies on finding period of quantum modular multiplication operator. We consider whether signatures of ergodicity and chaos may indeed be encoded in such an "integrable" quantization of a chaotic system. This work suggests that the integrability of Shor's modular multiplication operator may stem from the interference of other "chaotic" quantizations of the same family of maps.
  arXiv  Detail & Related papers  (2023-06-28T18:00:01Z)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• Probing the entanglement of operator growth [0.0]
  We probe the operator growth for systems with Lie symmetry using tools from quantum information. Namely, we investigate the Krylov complexity, entanglement negativity, von Neumann entropy and capacity of entanglement for systems with SU(1,1) and SU(2) symmetry.
  arXiv  Detail & Related papers  (2021-11-05T11:58:46Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Out-of-time-order correlations and the fine structure of eigenstate thermalisation [58.720142291102135]
  Out-of-time-orderors (OTOCs) have become established as a tool to characterise quantum information dynamics and thermalisation. We show explicitly that the OTOC is indeed a precise tool to explore the fine details of the Eigenstate Thermalisation Hypothesis (ETH) We provide an estimation of the finite-size scaling of $omega_textrmGOE$ for the general class of observables composed of sums of local operators in the infinite-temperature regime.
  arXiv  Detail & Related papers  (2021-03-01T17:51:46Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)
• On estimating the entropy of shallow circuit outputs [49.1574468325115]
  Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
  arXiv  Detail & Related papers  (2020-02-27T15:32:08Z)

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.