aiqbench analysis
This research presents a canonical circuit decomposition for quantum combs with group symmetries, leveraging Clebsch-Gordan transforms to optimize unitary transposition protocols. The study achieves a deterministic, exact inversion for 3-dimensional systems using only seven queries to an unknown unitary operation, representing a significant efficiency gain over previous methods that required thirteen. By reducing query complexity through symmetry exploitation, this work advances the theoretical framework for designing compact and resource-efficient quantum circuits.
Sequential quantum processes with group symmetries
arXiv:2510.07100v2 Announce Type: replace Abstract: Symmetry plays a crucial role in the design and analysis of quantum protocols. This result shows a canonical circuit decomposition of a $(G\times H)$-invariant quantum comb for compact groups $G$ and $H$ using the corresponding Clebsch--Gordan transforms, which naturally extends to the $G$-covariant quantum comb. By using this circuit decomposition, we propose a parametrized quantum comb with group symmetry, and derive the optimal quantum comb which transforms an unknown unitary operation $U\in \mathrm{SU}(d)$ into its inverse $U^\dagger$ or transpose $U^\top$. From numerics, we find a deterministic and exact unitary transposition protocol for $d=3$ with $7$ queries to $U$. This protocol improves upon the protocol shown in the previous work, which requires $13$ queries to $U$.
Abstract:Symmetry plays a crucial role in the design and analysis of quantum protocols. This result shows a canonical circuit decomposition of a $(G\times H)$-invariant quantum comb for compact groups $G$ and $H$ using the corresponding Clebsch--Gordan transforms, which naturally extends to the $G$-covariant quantum comb. By using this circuit decomposition, we propose a parametrized quantum comb with group symmetry, and derive the optimal quantum comb which transforms an unknown unitary operation $U\in \mathrm{SU}(d)$ into its inverse $U^\dagger$ or transpose $U^\top$. From numerics, we find a deterministic and exact unitary transposition protocol for $d=3$ with $7$ queries to $U$. This protocol improves upon the protocol shown in the previous work, which requires $13$ queries to $U$.
arXiv:2510.07100 [quant-ph]
(or arXiv:2510.07100v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2510.07100 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 204 words
Related coverage
Sequential Circuits as Generalized Symmetry on the Lattice
arXiv · Oct 2, 2026
Invariants of Sequential Circuits and Generalized Non-Abelian Statistics
arXiv · Jun 11, 2026
Move First, Commit Later: Selective LiDAR-to-BIM Global Initialization via Sequential Consensus with Symmetry-Aware Abstention
arXiv · Jul 21, 2026
Terminal Symmetry as a Carrier of Asymmetric Process Knowledge: Statewise Refinement for Anytime Verified Construction
arXiv · Sep 1, 2026