Complexity in One- and Two-Qubit Systems

Abstract

We numerically analyze the complexity of unitary time-evolution and precursor operators in one- and two-qubit systems using the framework of Nielsen complexity geometry. We find that, as expected, the complexities of unitary time evolution operators grow linearly with time, at least initially, for both the one- and two-qubit cases. The precursor operators display switchback-effect-like behavior provided we choose our cost factors so that the resulting complexity geometry is negatively curved.

References in corpus (8)

• Complexity and Shock Wave Geometries
• Quantum Computation as Geometry
• Gravitational action with null boundaries
• Quantum Complexity and Negative Curvature
• Optimal control, geometry, and quantum computing
• Switchbacks and the Bridge to Nowhere
• A geometric approach to quantum circuit lower bounds
• Quantum Control via Geometry: An explicit example