具有群对称性的顺序量子过程
Sequential quantum processes with group symmetries
AI总结:
本文利用Clebsch-Gordan变换给出了(G×H)-不变量子梳的规范电路分解,并推广到G-协变量子梳,进而设计了具有群对称性的参数化量子梳,用于最优地实现未知酉操作U的逆或转置,在d=3时仅需7次查询。
摘要:
对称性在量子协议的设计和分析中起着至关重要的作用。本文结果展示了对于紧致群$G$和$H$,利用相应的Clebsch-Gordan变换,$(G\times H)$-不变量子梳的一种规范电路分解,该分解自然地推广到$G$-协变量子梳。通过使用这种电路分解,我们提出了一种具有群对称性的参数化量子梳,并推导出了最优量子梳,该梳将未知酉操作$U\in \mathrm{SU}(d)$变换为其逆$U^\dagger$或转置$U^\top$。从数值计算中,我们发现了对于$d=3$,仅需对$U$进行7次查询即可实现确定性的精确酉转置协议。该协议改进了先前工作中需要13次查询的协议。
英文摘要:
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$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。