A Catalytic Algorithm for Transposing Unknown Qutrit Unitaries with Tight Query Bounds
Abstract
We construct exact deterministic circuits for transposing and inverting an unknown qutrit unitary U∈SU(3) using only forward queries. Three queries prepare a catalyst independently of the input state. Four further queries implement transposition while returning the catalyst unchanged and uncorrelated with the output. Two uses within an antisymmetric encoding implement inversion with eight processing queries and return the same catalyst. Reusing the catalyst implements m transpositions or inversions with 3+4m or 3+8m total queries, respectively. More generally, we prove that exact transposition and inversion of an unknown U∈SU(d), d≥2, require at least d+1 and d2−1 processing queries, respectively, in fixed causal order. These processing bounds hold for any program state prepared independently of the input state using finitely many forward queries, even if that state is consumed during processing. Both our catalytic qutrit algorithms attain their respective bounds. Moreover, exact qutrit transposition with four processing queries requires at least three preparation queries, and our construction attains this bound.
Related
- Two-qutrit Werner state is always local
- Geometric Characterization and Feasible Region Analysis of Bipartite Qutrit Bound Entanglement
- Qubit-Qutrit Quantum Tomography of hadronic Λϕ and ΛK∗ 0 systems
- Maximum purity of absolutely separable and absolutely PPT states in qutrit--qudit systems
- Unitary-accessible coherence-erasure distance: Exact qubit solution and a tight qutrit bound
BibTeX
@misc{chen2026catalytic,
title = {{A Catalytic Algorithm for Transposing Unknown Qutrit Unitaries with Tight Query Bounds}},
author = {Yu-Ao Chen},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.12664},
eprint = {2610.12664},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.12664},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - A Catalytic Algorithm for Transposing Unknown Qutrit Unitaries with Tight Query Bounds
AU - Yu-Ao Chen
PY - 2026
DA - 2026/10/08
PB - arXiv
DO - 10.48550/arxiv.2610.12664
UR - https://arxiv.org/abs/2610.12664
AB - We construct exact deterministic circuits for transposing and inverting an unknown qutrit unitary U∈SU(3) using only forward queries. Three queries prepare a catalyst independently of the input state. Four further queries implement transposition while returning the catalyst unchanged and uncorrelated with the output. Two uses within an antisymmetric encoding implement inversion with eight processing queries and return the same catalyst. Reusing the catalyst implements m transpositions or inversions with 3+4m or 3+8m total queries, respectively. More generally, we prove that exact transposition and inversion of an unknown U∈SU(d), d≥2, require at least d+1 and d^2−1 processing queries, respectively, in fixed causal order. These processing bounds hold for any program state prepared independently of the input state using finitely many forward queries, even if that state is consumed during processing. Both our catalytic qutrit algorithms attain their respective bounds. Moreover, exact qutrit transposition with four processing queries requires at least three preparation queries, and our construction attains this bound.
ER -