Geometric Complexity of Quantum Channels via Unitary Dilations

• URL: http://arxiv.org/abs/2601.00735v1
• Date: Fri, 02 Jan 2026 16:28:36 GMT
• Title: Geometric Complexity of Quantum Channels via Unitary Dilations
• Authors: Alberto Acevedo, Antonio Falcó,
• Abstract summary: We introduce and analyze a geometric complexity functional for families of quantum channels based on unitary dilations.<n>We quantify the loss of geometric complexity relative to a prescribed ideal closed evolution.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Nielsen's geometric approach to quantum circuit complexity provides a Riemannian framework for quantifying the cost of implementing unitary (closed--system) dynamics. For open dynamics, however, the reduced evolution is described by quantum channels and admits many inequivalent Stinespring realizations, so any meaningful complexity notion must specify which microscopic resources are counted as accessible and which transformations are regarded as gauge. We introduce and analyze a geometric complexity functional for families of quantum channels based on unitary dilations. We distinguish an implementation-dependent complexity, defined relative to explicit dilation data, from an intrinsic channel complexity obtained by minimizing over a physically motivated class of admissible dilations (e.g. bounded environment dimension, energy or norm constraints, and penalty structures). The functional has a subtractive form: it compares the geometric cost of the total unitary realization with a canonical surrogate term that removes purely environmental contributions. We justify this subtraction from concise postulates, including closed-system consistency, environment-only neutrality, and invariance under dilation gauge transformations that leave the channel unchanged. This leads to a companion quantity, noise complexity, quantifying the loss of geometric complexity relative to a prescribed ideal closed evolution. We establish a coherence-based lower bound for unitary geometric complexity, derive structural properties such as linear time scaling under time-homogeneous dilations, and obtain dissipator--controlled bounds in the Markovian (GKSL/Lindblad) regime under a standard dilation construction. Finally, we illustrate the framework on canonical benchmark noise models, including dephasing, amplitude damping, and depolarizing (Pauli) channels.

Related papers

• Phase-space complexity of discrete-variable quantum states and operations [0.0]
  We introduce a quantifier of phase-space complexity for discrete-variable quantum systems.<n>The complexity is normalized such that coherent states have unit complexity, while the completely mixed state has zero complexity.<n>We extend the framework to quantum channels, defining measures for both the generation and breaking of complexity.
  arXiv  Detail & Related papers  (2026-03-03T19:00:02Z)
• Exact formula for geometric quantum complexity of cosmological perturbations [0.0]
  In this work, complexity is defined as the length of the minimal geodesic in a suitably constructed geometric space associated with the Lie group of relevant operators.<n>We focus on the $mathfraksu (1,1)$ Lie algebra, relevant for quantum fields evolving on homogeneous and isotropic cosmological backgrounds.
  arXiv  Detail & Related papers  (2025-12-16T19:39:36Z)
• Implementing a Universal Set of Geometric Quantum Gates through Dressed-State assisted STA [39.27725073249277]
  We analyze the implementation of single-qubit gates in a two-level system driven by a microwave field.<n>We show how the dynamical phase can be canceled to obtain purely geometric operations.<n>We extend the protocol to construct non two-qubit gates, highlighting its feasibility for scalable quantum information processing.
  arXiv  Detail & Related papers  (2025-09-10T16:14:34Z)
• Direct probing of the simulation complexity of open quantum many-body dynamics [42.085941481155295]
  We study the role of dissipation in simulating open-system dynamics using both quantum and classical methods.<n>Our results show that dissipation affects correlation length and mixing time in distinct ways at intermediate and long timescales.
  arXiv  Detail & Related papers  (2025-08-27T15:14:36Z)
• CFT Complexity and Penalty Factors [0.0]
  We present a framework for studying the complexity of circuits in Lie groups, where penalty factors assign relative weights to different generators.<n>Our approach constructs a metric on the coset space of quantum states, induced from a (pseudo-)Riemannian norm on the space of unitary circuits.<n>As a concrete application, we compute state complexity for states in one- and two-dimensional CFTs.
  arXiv  Detail & Related papers  (2025-07-29T18:00:02Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• The Complexity of Being Entangled [0.0]
  Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations. For a bipartite system, we investigate binding complexity, which corresponds to norms in which gates acting on a single subsystem are free of cost.
  arXiv  Detail & Related papers  (2023-11-07T19:00:02Z)
• Unitary Complexity and the Uhlmann Transformation Problem [39.6823854861458]
  We introduce a framework for unitary synthesis problems, including notions of reductions and unitary complexity classes.<n>We use this framework to study the complexity of transforming one entangled state into another via local operations.<n>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)
• DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusion [66.21290235237808]
  We introduce an energy constrained diffusion model which encodes a batch of instances from a dataset into evolutionary states. We provide rigorous theory that implies closed-form optimal estimates for the pairwise diffusion strength among arbitrary instance pairs. Experiments highlight the wide applicability of our model as a general-purpose encoder backbone with superior performance in various tasks.
  arXiv  Detail & Related papers  (2023-01-23T15:18:54Z)
• 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)
• Solution to the Quantum Symmetric Simple Exclusion Process : the Continuous Case [0.0]
  We present a solution for the invariant probability measure of the one dimensional Q-SSEP in the infinite size limit. We incidentally point out a possible interpretation of the Q-SSEP correlation functions via a surprising conneatorics and the associahedron polytopes.
  arXiv  Detail & Related papers  (2020-06-22T13:20:40Z)

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.