Extremal jumps of circuit complexity of unitary evolutions generated by random Hamiltonians

• URL: http://arxiv.org/abs/2303.17538v3
• Date: Mon, 29 Jul 2024 14:36:56 GMT
• Title: Extremal jumps of circuit complexity of unitary evolutions generated by random Hamiltonians
• Authors: Marcin Kotowski, Michał Oszmaniec, Michał Horodecki,
• Abstract summary: We investigate circuit complexity of unitaries generated by time evolution of randomly chosen strongly interacting Hamiltonians in finite dimensional Hilbert spaces. We prove that the complexity of $exp(-it H)$ exhibits a surprising behaviour -- with high probability it reaches the maximal allowed value on the same time scale as needed to escape the neighborhood of the identity consisting of unitaries with trivial (zero) complexity.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate circuit complexity of unitaries generated by time evolution of randomly chosen strongly interacting Hamiltonians in finite dimensional Hilbert spaces. Specifically, we focus on two ensembles of random generators -- the so called Gaussian Unitary Ensemble (GUE) and the ensemble of diagonal Gaussian matrices conjugated by Haar random unitary transformations. In both scenarios we prove that the complexity of $\exp(-it H)$ exhibits a surprising behaviour -- with high probability it reaches the maximal allowed value on the same time scale as needed to escape the neighborhood of the identity consisting of unitaries with trivial (zero) complexity. We furthermore observe similar behaviour for quantum states originating from time evolutions generated by above ensembles and for diagonal unitaries generated from the ensemble of diagonal Gaussian Hamiltonians. To establish these results we rely heavily on structural properties of the above ensembles (such as unitary invariance) and concentration of measure techniques. This gives us a much finer control over the time evolution of complexity compared to techniques previously employed in this context: high-degree moments and frame potentials.

Related papers

• Upper bounds on quantum complexity of time-dependent oscillators [0.0]
  An explicit formula for an upper bound on the quantum complexity of a harmonic oscillator Hamiltonian with time-dependent frequency is derived. This result aligns with the gate complexity and earlier studies of de Sitter complexity. It provides a proof of concept for the application of Nielsen complexity in cosmology, together with a systematic setting in which higher-order terms can be included.
  arXiv  Detail & Related papers  (2024-07-01T18:00:03Z)
• Complexity is not Enough for Randomness [0.0]
  We study the dynamical generation of randomness in Brownian systems as a function of the degree of locality of the Hamiltonian. We find that the generation of randomness persists for exponentially long times in the system size, even for systems governed by highly non-local time-dependent Hamiltonians.
  arXiv  Detail & Related papers  (2024-05-27T18:00:00Z)
• Accelerated Discovery of Machine-Learned Symmetries: Deriving the Exceptional Lie Groups G2, F4 and E6 [55.41644538483948]
  This letter introduces two improved algorithms that significantly speed up the discovery of symmetry transformations. Given the significant complexity of the exceptional Lie groups, our results demonstrate that this machine-learning method for discovering symmetries is completely general and can be applied to a wide variety of labeled datasets.
  arXiv  Detail & Related papers  (2023-07-10T20:25:44Z)
• 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)
• Sampled Transformer for Point Sets [80.66097006145999]
  sparse transformer can reduce the computational complexity of the self-attention layers to $O(n)$, whilst still being a universal approximator of continuous sequence-to-sequence functions. We propose an $O(n)$ complexity sampled transformer that can process point set elements directly without any additional inductive bias.
  arXiv  Detail & Related papers  (2023-02-28T06:38:05Z)
• 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)
• Growth of entanglement of generic states under dual-unitary dynamics [77.34726150561087]
  Dual-unitary circuits are a class of locally-interacting quantum many-body systems. In particular, they admit a class of solvable" initial states for which, in the thermodynamic limit, one can access the full non-equilibrium dynamics. We show that in this case the entanglement increment during a time step is sub-maximal for finite times, however, it approaches the maximal value in the infinite-time limit.
  arXiv  Detail & Related papers  (2022-07-29T18:20:09Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Operator complexity: a journey to the edge of Krylov space [0.0]
  Krylov complexity, or K-complexity', quantifies this growth with respect to a special basis. We study the evolution of K-complexity in finite-entropy systems for time scales greater than the scrambling time.
  arXiv  Detail & Related papers  (2020-09-03T18:10:20Z)
• 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)

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.