Topology-dependent compilation asymmetry in equivariant quantum neural networks: a compile-once-and-relabel solution
Quantum Science and Technology · 01.12.2026 · 11 (4) · 0450a4
DOI: 10.1088/2058-9565/aeb8ef ↗Kurz gefasst
Fachartikel in der Zeitschrift Quantum Science and Technology, online erschienen am 30.10.2026. Verfasst von Hassan Ugail und 1 weiteren Autor:innen. Die Arbeit nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Equivariant quantum neural networks are designed to preserve symmetries in quantum machine-learning data, but this property is usually verified only before hardware compilation. We show that a transpiler can preserve the expected unitary symmetry relation while compiling symmetry-related inputs into circuits with different two-qubit gate counts and physical-qubit layouts, so ideal-circuit equivariance does not guarantee symmetry at the level of compiled circuit structure. We formalise this gap with a three-level compliance hierarchy and a taxonomy separating topology-input ansätze, where the symmetry changes the gate topology the compiler sees, from parameter-input ansätze, where it changes only numerical gate parameters and provably leaves controlled- Z counts unchanged under topology-based transpilation. Auditing four published ansatz families, we observe the effect only in the topology-input case. For the Skolik permutation-equivariant weighted-graph ansatz compiled to the IBM Heron Fez simulator target at twelve qubits, sparse graph inputs produce a mean relative controlled- Z asymmetry of 7.3% across fifty random vertex permutations, with a worst case of 22.5%. The effect persists across all four Qiskit optimisation levels and is not removed by matched-layout compilation, implicating routing-stage sensitivity to the ordered sparse-edge gate sequence. A density sweep shows that the asymmetry is comparable across intermediate graph densities and vanishes for complete graphs, where the ansatz degenerates into the parameter-input class, and stochastic baselines attribute the realised differences to heuristic routing sensitivity rather than to differing optimal compiled costs. Finally, we propose compile-once-and-relabel, a deployment pattern that removes controlled- Z count asymmetry by construction and reduces compilation cost for orbit-based workflows.
Zitieren
APA
Ugail, H., & Howard, N. (2026). Topology-dependent compilation asymmetry in equivariant quantum neural networks: a compile-once-and-relabel solution. Quantum Science and Technology, 11(4), 0450a4. https://doi.org/10.1088/2058-9565/aeb8ef
Vancouver
Ugail H, Howard N. Topology-dependent compilation asymmetry in equivariant quantum neural networks: a compile-once-and-relabel solution. Quantum Science and Technology. 2026;11(4):0450a4. doi:10.1088/2058-9565/aeb8ef
BibTeX
@article{Ugail2026,
author = {Ugail, Hassan and Howard, Newton},
title = {Topology-dependent compilation asymmetry in equivariant quantum neural networks: a compile-once-and-relabel solution},
journal = {Quantum Science and Technology},
year = {2026},
volume = {11},
number = {4},
pages = {0450a4},
doi = {10.1088/2058-9565/aeb8ef}
}
EUVIMED