图态的局部等价性
Local Equivalences of Graph States
AI总结:
研究图态的局部等价性,引入局部互补性推广刻画LU等价,证明存在局部等价层次结构,设计判定算法,证明特定条件下图态的LC等价性,研究通用图态并给出相关结果。
摘要:
图态是与数学图一一对应的大量量子态,在基于测量的量子计算等多体纠缠资源应用中至关重要。理解何时两个图态具有相同纠缠(即仅通过局部操作可相互转换,此时称它们是LU等价的)很关键。若局部操作限于Clifford群,则称图态是LC等价的,局部互补性完全刻画LC等价性,但曾猜想的LU等价与LC等价的关系存在反例。本文引入完全刻画LU等价性的局部互补性推广,证明了LC与LU等价之间存在无限严格的局部等价层次结构,设计了判定两个图态是否LU等价的拟多项式算法,证明了至多19个量子比特上定义的两个LU等价图态是LC等价的,还研究了通用图态并给出界限和最优概率构造。
英文摘要:
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled resources. It is thus crucial to understand when two such states have the same entanglement, i.e. when they can be transformed into each other using only local operations. In this case, we say that the graph states are LU-equivalent (local unitary). If the local operations are restricted to the so-called Clifford group, we say that the graph states are LC-equivalent (local Clifford). Interestingly, a simple graph rule called local complementation fully captures LC-equivalence, in the sense that two graph states are LC-equivalent if and only if the underlying graphs are related by a sequence of local complementations. While it was once conjectured that two LU-equivalent graph states are always LC-equivalent, counterexamples do exist and local complementation fails to fully capture the entanglement of graph states. We introduce in this thesis a generalization of local complementation that does fully capture LU-equivalence. Using this characterization, we prove the existence of an infinite strict hierarchy of local equivalences between LC- and LU-equivalence. This also leads to the design of a quasi-polynomial algorithm for deciding whether two graph states are LU-equivalent, and to a proof that two LU-equivalent graph states are LC-equivalent if they are defined on at most 19 qubits. Furthermore, we study graph states that are universal in the sense that any smaller graph state, defined on any small enough set of qubits, can be induced using only local operations. We provide bounds and an optimal, probabilistic construction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。