Upper bounds on quantum complexity of time-dependent oscillators

• URL: http://arxiv.org/abs/2407.01677v1
• Date: Mon, 1 Jul 2024 18:00:03 GMT
• Title: Upper bounds on quantum complexity of time-dependent oscillators
• Authors: Satyaki Chowdhury, Martin Bojowald, Jakub Mielczarek,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In Nielsen's geometric approach to quantum complexity, the introduction of a suitable geometrical space, based on the Lie group formed by fundamental operators, facilitates the identification of complexity through geodesic distance in the group manifold. Earlier work had shown that the computation of geodesic distance can be challenging for Lie groups relevant to harmonic oscillators. Here, this problem is approached by working to leading order in an expansion by the structure constants of the Lie group. An explicit formula for an upper bound on the quantum complexity of a harmonic oscillator Hamiltonian with time-dependent frequency is derived. Applied to a massless test scalar field on a cosmological de Sitter background, the upper bound on complexity as a function of the scale factor exhibits a logarithmic increase on super-Hubble scales. 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.

Related papers

• Quantum Walks on Simplicial Complexes and Harmonic Homology: Application to Topological Data Analysis with Superpolynomial Speedups [9.538251541300028]
  We introduce a novel quantum walk that encodes the Laplacian, a key mathematical object whose spectral properties reflect the underlying simplicial complex. Our results achieve superpolynomial quantum speedup with quantum walks without relying on quantum oracles for large datasets.
  arXiv  Detail & Related papers  (2024-04-23T18:00:17Z)
• Taming Quantum Time Complexity [45.867051459785976]
  We show how to achieve both exactness and thriftiness in the setting of time complexity. We employ a novel approach to the design of quantum algorithms based on what we call transducers.
  arXiv  Detail & Related papers  (2023-11-27T14:45:19Z)
• Spectral Convergence of Complexon Shift Operators [38.89310649097387]
  We study the transferability of Topological Signal Processing via a generalized higher-order version of graphon, known as complexon. Inspired by the graphon shift operator and message-passing neural network, we construct a marginal complexon and complexon shift operator. We prove that when a simplicial complex signal sequence converges to a complexon signal, the eigenvalues, eigenspaces, and Fourier transform of the corresponding CSOs converge to that of the limit complexon signal.
  arXiv  Detail & Related papers  (2023-09-12T08:40:20Z)
• Geometric quantum complexity of bosonic oscillator systems [0.0]
  The length of the minimal geodesic in a geometric realization of a suitable operator space provides a measure of the quantum complexity of an operation. New insights about complexity can be found in a low-dimensional setting, with the potential of systematic extensions to higher dimensions as well as interactions.
  arXiv  Detail & Related papers  (2023-07-25T18:00:07Z)
• 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)
• Bounds on quantum evolution complexity via lattice cryptography [0.0]
  We address the difference between integrable and chaotic motion in quantum theory as manifested by the complexity of the corresponding evolution operators. Complexity is understood here as the shortest geodesic distance between the time-dependent evolution operator and the origin within the group of unitaries.
  arXiv  Detail & Related papers  (2022-02-28T16:20:10Z)
• Orthogonal Group Synchronization with Incomplete Measurements: Error Bounds and Linear Convergence of the Generalized Power Method [22.901235010786287]
  Group synchronization refers to estimating a collection of group elements from the noisy pairwise measurements. In this paper, we focus on the group synchronization problem with general additive noise models under incomplete measurements.
  arXiv  Detail & Related papers  (2021-12-13T10:57:09Z)
• Operator Complexity for Quantum Scalar Fields and Cosmological Perturbations [0.0]
  We study the complexity of the unitary evolution of quantum cosmological perturbations in de Sitter space. The complexity of cosmological perturbations scales as the square root of the (exponentially) growing volume of de Sitter space.
  arXiv  Detail & Related papers  (2021-10-15T20:37:36Z)
• Entanglement dynamics of spins using a few complex trajectories [77.34726150561087]
  We consider two spins initially prepared in a product of coherent states and study their entanglement dynamics. We adopt an approach that allowed the derivation of a semiclassical formula for the linear entropy of the reduced density operator.
  arXiv  Detail & Related papers  (2021-08-13T01:44:24Z)
• 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)
• Operator-algebraic renormalization and wavelets [62.997667081978825]
  We construct the continuum free field as the scaling limit of Hamiltonian lattice systems using wavelet theory. A renormalization group step is determined by the scaling equation identifying lattice observables with the continuum field smeared by compactly supported wavelets.
  arXiv  Detail & Related papers  (2020-02-04T18:04:51Z)

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.