New Python package calculates geometric cost in quantum circuits, highlighting efficient unitary transformations.
We present a new Python package that uses the formalism of geometric quantum complexity to numerically compute metric-dependent geometric cost and control functions associated with preparing a given unitary transformation on a quantum computer. The numerical procedure we implement is presented and discussed. Analyzed quantum circuits include: the quantum Fourier transform for up to four qubits, a random circuit with depth 100, and a circuit for analyzing the evolution of a fermionic chain with several lattice sites.
No takes yet. Share an insight, caveat, or question.
Crowe et al. (2026) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: