Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing. Here we consider the question whether one graph ( source ) state can be transformed into another graph ( target ) state, using a specific set of quantum operations (LC + LPM + CC): single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM) and classical communication (CC) between sites holding the individual qubits. This question is of interest for effective routing or state preparation decisions in a quantum network or distributed quantum processor and also in the design of quantum repeater schemes and quantum error-correction codes. We first show that deciding whether a graph state | G ⟩ can be transformed into another graph state | G ′⟩ using LC + LPM + CC is ##IMG## [http://ej.iop.org/images/2058-9565/5/4/045016/qstaba763ieqn1.gif] {$\mathbb{N}\mathbb{P}$} -comple...

中文翻译：

---

如何使用单量子位运算转换图状态：计算复杂度和算法

图态在量子信息中无处不在，其应用范围从量子网络协议到基于测量的量子计算。在这里，我们考虑以下问题：是否可以使用一组特定的量子运算（LC + LPM + CC）将一个图（源）状态转换为另一个图（目标）状态：单量子位Clifford运算（LC），单量子位持有单个量子位的站点之间的Pauli测量（LPM）和经典通信（CC）。对于量子网络或分布式量子处理器中的有效路由选择或状态准备决策以及量子中继器方案和量子纠错码的设计，此问题引起关注。我们首先表明确定一个图是否处于状态。G⟩可以转换成另一个图状态| 使用LC + LPM + CC的G'⟩是## IMG ## [http：