Resource-Dependent Complexity of Quantum Channels

Abstract

We introduce a new framework for quantifying the complexity of quantum channels, grounded in a suitably chosen resource set. This class of convex functions is designed to analyze the complexity of both open and closed quantum systems. By leveraging Lipschitz norms inspired by quantum optimal transport theory, we rigorously establish the fundamental properties of this complexity measure. The flexibility in selecting the resource set allows us to derive effective lower bounds for gate complexities and simulation costs of both Hamiltonian simulations and dynamics of open quantum systems. Additionally, we demonstrate that this complexity measure exhibits linear growth for random quantum circuits and finite-dimensional quantum simulations, up to the Brown-Susskind threshold.

Final version, to appear in Quantum

References in corpus (28)

• Quantum Computation as Geometry
• A Theory of Trotter Error
• Circuit complexity in quantum field theory
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A Universal Operator Growth Hypothesis
• A random compiler for fast Hamiltonian simulation
• The Second Law of Quantum Complexity
• Holographic Complexity
• Operator complexity: a journey to the edge of Krylov space
• Faster quantum simulation by randomization
• Linear growth of quantum circuit complexity
• Krylov complexity from integrability to chaos
• Optimal control, geometry, and quantum computing
• The Complexity Geometry of a Single Qubit
• The Quantum Wasserstein Distance of Order 1
• Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems
• Krylov complexity in quantum field theory, and beyond
• Resource theory of quantum uncomplexity
• Complexity of quantum circuits via sensitivity, magic, and coherence
• Extremal eigenvalues of local Hamiltonians
• Circuit complexity of quantum access models for encoding classical data
• Relative entropy for von Neumann subalgebras
• Lower Bounds for the Trotter Error
• Quantum Optimal Transport: Quantum Channels and Qubits
• Complexity in algebraic QFT
• Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach
• On the average-case complexity of learning output distributions of quantum circuits
• Wasserstein Complexity of Quantum Circuits