Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.16157 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- We present a new Python package that uses the established notion of geometric quantum complexity to numerically compute the difficulty 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. This package can be found for download at https://github.com/JAGDiaz/quantum-geodesics