论文标题
双重单位作为与当地产品门的距离的最大化器
Dual unitaries as maximizers of the distance to local product gates
论文作者
论文摘要
解决了与任何两部分统一门$ u $免费找到资源的问题。先前被讨论为非局部性的量度,距离$ k_d(u)$ to最近产品统一的距离对电路复杂性和相关数量有影响。双重单位,目前对复杂量子多体系统的模型非常感兴趣,被证明具有首选作用,因为这些角色是最大和同样远离本地一级人群的首选。在这里为Qubits证明了这一点,我们提出了强有力的数值和分析证据,通常是事实。对$ k_d(u)$的分析评估是针对一般的两分之一门的。对于任意的本地维度,$ k_d(u)$对于双重单位是最大的,它通过其对双重单生的重要家庭和某些非双重盖茨的分析评估得到了证实。对于任何两分统一的统一,都有一个紧密相关的结果,它存在一对最大纠缠的状态。我们提供有效的数值算法以找到此类状态并总体上找到$ k_d(u)$。
TThe problem of finding the resource free, closest local unitary, to any bipartite unitary gate $U$ is addressed. Previously discussed as a measure of nonlocality, the distance $K_D(U)$ to the nearest product unitary has implications for circuit complexity and related quantities. Dual unitaries, currently of great interest in models of complex quantum many-body systems, are shown to have a preferred role as these are maximally and equally away from the set of local unitaries. This is proved here for the case of qubits and we present strong numerical and analytical evidence that it is true in general. An analytical evaluation of $K_D(U)$ is presented for general two-qubit gates. For arbitrary local dimensions, that $K_D(U)$ is largest for dual unitaries, is substantiated by its analytical evaluations for an important family of dual-unitary and for certain non-dual gates. A closely allied result concerns, for any bipartite unitary, the existence of a pair of maximally entangled states that it connects. We give efficient numerical algorithms to find such states and to find $K_D(U)$ in general.