在单向测量模型中查找流
Finding flows in the one-way measurement model
摘要:
单向测量模型是通用量子计算的框架,其中算法部分由量子比特集合上的纠缠关系图G描述。在两个希尔伯特空间之间执行酉嵌入的算法的充分条件是图G连同输入/输出顶点I,O \subset V(G)具有Danos和Kashefi [quant-ph/0506062]引入的意义下的流。对于特殊的情况下,|I| = |O|,使用图论表征,我表明,这样的流量是唯一的,当它们存在。这导致了一个有效的算法,找到流,减少解决问题的图论。
英文摘要:
The one-way measurement model is a framework for universal quantum computation, in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform a unitary embedding between two Hilbert spaces is for the graph G, together with input/output vertices I, O \subset V(G), to have a flow in the sense introduced by Danos and Kashefi [quant-ph/0506062]. For the special case of |I| = |O|, using a graph-theoretic characterization, I show that such flows are unique when they exist. This leads to an efficient algorithm for finding flows, by a reduction to solved problems in graph theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。