Geometric Measures of Complexity for Open and Closed Quantum Systems

• URL: http://arxiv.org/abs/2507.18440v1
• Date: Thu, 24 Jul 2025 14:22:57 GMT
• Title: Geometric Measures of Complexity for Open and Closed Quantum Systems
• Authors: Alberto Acevedo, Antonio Falco,
• Abstract summary: We present a definition of geometric complexity for a fairly generic family of quantum channels.<n>These channels are useful for modeling noise in quantum circuits, among other things, and analyze the geometric complexity of these quantum channels.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The unitary dynamics of quantum systems can be modeled as a trajectory on a Riemannian manifold. This theoretical framework naturally yields a purely geometric interpretation of computational complexity for quantum algorithms, a notion originally developed by Michael Nielsen (Circa, 2007). However, for nonunitary dynamics, it is unclear how one can recover a completely geometric characterization of Nielsen-like geometric complexity. The main obstacle to overcome is that nonunitary dynamics cannot be characterized by Lie groups (which are Riemannian manifolds), as is the case for unitary dynamics. Building on Nielsen's work, we present a definition of geometric complexity for a fairly generic family of quantum channels. These channels are useful for modeling noise in quantum circuits, among other things, and analyze the geometric complexity of these quantum channels.

Related papers

• Solving graph problems using permutation-invariant quantum machine learning [35.99391901074448]
  In quantum machine learning, the ansatz can be tuned to correspond to the specific symmetry of the problem.<n>We show how the symmetry can be included in the quantum circuit in a straightforward constructive method.
  arXiv  Detail & Related papers  (2025-05-19T06:44:03Z)
• Hilbert space geometry and quantum chaos [39.58317527488534]
  We consider the symmetric part of the QGT for various multi-parametric random matrix Hamiltonians. We find for a two-dimensional parameter space that, while the ergodic phase corresponds to the smooth manifold, the integrable limit marks itself as a singular geometry with a conical defect.
  arXiv  Detail & Related papers  (2024-11-18T19:00:17Z)
• Benchmarking quantum chaos from geometric complexity [0.23436632098950458]
  We consider a new method to study geometric complexity for interacting non-Gaussian quantum mechanical systems.<n>Within some limitations, geometric complexity can indeed be a good indicator of quantum chaos.
  arXiv  Detail & Related papers  (2024-10-24T14:04:58Z)
• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• Quantum geometry embedded in unitarity of evolution: revealing its impacts as geometric oscillation and dephasing in spin resonance and crystal bands [0.29127054707887967]
  We show how geometry emerges in quantum as an intrinsic consequence of unitary evolution.<n>We exemplify geometric observables, such as oscillation, dephasing, in spin and band scenarios.
  arXiv  Detail & Related papers  (2024-06-22T13:16:51Z)
• Non-adiabatic holonomies as photonic quantum gates [36.136619420474766]
  We present the quantum-optical realization of non-adiabatic holonomies that can be used as single-qubit quantum gates. The inherent non-adiabaticity of the structures paves the way for unprecedented miniaturization.
  arXiv  Detail & Related papers  (2024-01-08T16:44:45Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Fluctuations, uncertainty relations, and the geometry of quantum state manifolds [0.0]
  The complete quantum metric of a parametrized quantum system has a real part and a symplectic imaginary part. We show that for a mixed quantum-classical system both real and imaginary parts of the quantum metric contribute to the dynamics.
  arXiv  Detail & Related papers  (2023-09-07T10:31:59Z)
• Unitary Complexity and the Uhlmann Transformation Problem [41.67228730328207]
  We introduce a framework for unitary synthesis problems, including notions of reductions and unitary complexity classes. We use this framework to study the complexity of transforming one entangled state into another via local operations. Our framework for unitary complexity thus provides new avenues for studying the computational complexity of many natural quantum information processing tasks.
  arXiv  Detail & Related papers  (2023-06-22T17:46:39Z)
• Geometrically robust linear optics from non-Abelian geometric phases [0.0]
  We construct a unified operator framework for quantum holonomies generated from bosonic systems. For a system whose Hamiltonian is bilinear in the creation and operators, we find a holonomy group determined only by a set of selected orthonormal modes.
  arXiv  Detail & Related papers  (2022-04-07T16:08:08Z)
• A singular Riemannian geometry approach to Deep Neural Networks I. Theoretical foundations [77.86290991564829]
  Deep Neural Networks are widely used for solving complex problems in several scientific areas, such as speech recognition, machine translation, image analysis. We study a particular sequence of maps between manifold, with the last manifold of the sequence equipped with a Riemannian metric. We investigate the theoretical properties of the maps of such sequence, eventually we focus on the case of maps between implementing neural networks of practical interest.
  arXiv  Detail & Related papers  (2021-12-17T11:43:30Z)
• A Quantum Complexity Lowerbound from Differential Geometry [0.0]
  I apply the Bishop-Gromov bound to Nielsen's complexity geometry to prove lowerbounds on the quantum complexity of a typical unitary. For a broad class of penalty schedules, the typical complexity is shown to be exponentially large in the number of qubits. This method realizes the original vision of Nielsen, which was to apply the tools of differential geometry to study quantum complexity.
  arXiv  Detail & Related papers  (2021-12-10T18:28:01Z)
• 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)
• How smooth is quantum complexity? [0.0]
  The "quantum complexity" of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. In this paper, we present a unified perspective on various notions of quantum complexity, viewed as functions on the space of unitary operators.
  arXiv  Detail & Related papers  (2021-06-15T17:58: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.