Abstract In the geometric approach to defining complexity, operator complexity is defined as the distance in the operator space. In this paper, based on the analogy with the circuit complexity, the operator size is adopted as the metric of the operator space where the path length is the complexity. The typical sectional curvatures of this complexity geometry are positive. It is further proved that the typical sectional curvatures are always positive if the metric is an arbitrary function of operator size, while complexity geometry is usually expected to be defined on negatively curved manifolds. By analyzing the sectional curvatures distribution for the N-qubit system, it is shown that surfaces generated by Hamiltonians of size smaller than the typical size can have negative curvatures. In the large N limit, the form of complexity metric is uniquely constrained up to constant corrections if we require sectional curvatures are of order 1/N2. With the knowledge of states, the operator size should be modified due to the redundant action of operators, and thus is generalized to be state-dependent. Then we use this state-dependent operator size as the metric of the Hilbert space to define state complexity. It can also be shown that in the Hilbert space, 2-surfaces generated by operators of size much smaller than the typical size acting on typical states also have negative curvatures.
Abstract In the geometric approach to defining complexity, operator complexity is defined as the distance in the operator space. In this paper, based on the analogy with the circuit complexity, the operator size is adopted as the metric of the operator space where the path length is the complexity. The typical sectional curvatures of this complexity geometry are positive. It is further proved that the typical sectional curvatures are always positive if the metric is an arbitrary function of operator size, while complexity geometry is usually expected to be defined on negatively curved manifolds. By analyzing the sectional curvatures distribution for the N-qubit system, it is shown that surfaces generated by Hamiltonians of size smaller than the typical size can have negative curvatures. In the large N limit, the form of complexity metric is uniquely constrained up to constant corrections if we require sectional curvatures are of order 1/N2. With the knowledge of states, the operator size should be modified due to the redundant action of operators, and thus is generalized to be state-dependent. Then we use this state-dependent operator size as the metric of the Hilbert space to define state complexity. It can also be shown that in the Hilbert space, 2-surfaces generated by operators of size much smaller than the typical size acting on typical states also have negative curvatures.
Computational complexity is a quantum information concept that recently has found applications in the holographic understanding of the black hole interior. We consider quantum computational complexity for n qubits using Nielsen's geometrical approach. In the definition of complexity there is a big amount of arbitrariness due to the choice of the penalty factors, which parametrizes the cost of the elementary computational gates. In order to reproduce desired features in holography, such as ergodicity and exponential maximal complexity for large number of qubits n, negative curvatures are required. With the simplest choice of penalties, this is achieved at the price of singular sectional curvatures in the large n limit. We investigate a choice of penalties in which we can obtain negative curvatures in a smooth way. We also analyze the relation between operator and state complexities, framing the discussion with the language of Riemannian submersions. This provides a direct relation between geodesics and curvatures in the unitaries and the states spaces, which we also exploit to give a closed-form expression for the metric on the states in terms of the one for the operators. Finally, we study conjugate points for a large number of qubits in the unitary space and we provide a strong indication that maximal complexity scales exponentially with the number of qubits in a certain regime of the penalties space.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.
We extend Nielsen's geometric approach for quantum complexity from closed to open quantum systems, whose dynamics is governed by Lindbladian evolution. In this framework, complexity is defined through an optimal-control problem on the space of mixed states, with a cost assigned to both unitary and non-unitary generators. We show that the resulting geometric structure differs fundamentally from the Riemannian geometry that emerges in the case of unitary evolution. In the open-system setting, the natural geometry is typically sub-Finslerian. Dissipation makes the geodesics non-reversible, while the admissible tangent directions are restricted by the physically allowed controls. We analyze several physically motivated examples, including a single qubit subject to depolarizing and amplitude-damping channels, as well as the damped harmonic oscillator. We show that, similarly to the unitary case, varying the penalty factors in the cost functional modifies the geometric properties through changes in the flag curvature, the Finslerian analog of sectional curvature. Our results provide a geometric framework for quantifying the abstract notion of complexity in dissipative quantum systems, with potential connections to experimentally realizable setups.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.
The complete quantum metric of a parametrized quantum system has a real part (usually known as the Provost-Vallee metric) and a symplectic imaginary part (known as the Berry curvature). In this paper, we first investigate the relation between the Riemann curvature tensor of the space described by the metric, and the Berry curvature, by explicit parallel transport of a vector in Hilbert space. Subsequently, we write a generating function from which the complex metric, as well as higher-order geometric tensors (affine connection, Riemann curvature tensor), can be obtained in terms of gauge-invariant cumulants. The generating function explicitly relates the quantities which characterize the geometry of the parameter space to quantum fluctuations. We also show that for a mixed quantum-classical system both real and imaginary parts of the quantum metric contribute to the dynamics, if the mass tensor is Hermitian. A many-operator generalization of the uncertainty principle results from taking the determinant of the complex quantum metric. We also calculate the quantum metric for a number of Lie group coherent states, including several representations of the SU(1,1) group. In our examples nontrivial complex geometry results for generalized coherent states. A pair of oscillator states corresponding to the SU(1,1) group gives a double series for its spectrum. The two minimal uncertainty coherent states show trivial geometry, but, again, for generalized coherent states nontrivial geometry results.
In this paper, we introduce the Quantum Geometry Conjecture Generator (QGCG), a theoretical framework designed to bridge the gap between abstract quantum mechanics and differential geometry. Traditional geometry investigates spatial manifolds endowed with metrics and curvature, whereas quantum mechanics operates within complex Hilbert spaces governed by state vectors and operators. We propose a systematic methodology to construct a new mathematical discipline: Quantum Space Geometry. By mapping quantum state spaces, entanglement structures, and operator algebras onto geometric manifolds, QGCG automatically generates novel mathematical conjectures regarding the intrinsic curvature, topological invariants, and dualities of quantum systems. We formalize the foundational definitions, explore the interplay between quantum fidelity and metric tensors, and establish a series of unproven conjectures that outline a comprehensive roadmap for future research in quantum mathematics.