Verification of Many-Qubit States
Verification of Many-Qubit States
复制标题
DOI：
10.1103/physrevx.8.021060
复制
发表时间：
2017-09
影响因子：
12.5
通讯作者：
Yuki Takeuchi;T. Morimae
中科院分区：
文献类型：
--
作者：
Yuki Takeuchi;T. Morimae
验证是检查给定量子态是否接近理想态的任务。在本文中，我们证明了各种多量子比特的量子态可以验证只有顺序的单量子比特测量的泡利运营商。首先，我们介绍了一个协议，用于验证哈密顿基态。接下来，我们解释如何验证由某类量子电路产生的量子态。最后，我们提出了一个自适应测试的稳定器，使验证所有多项式时间生成的超图状态，其中包括输出状态的Bremner-Montanaro-Shepherd型瞬时量子多项式时间（IQP）电路。重要的是，我们不做任何假设，即相同状态的相同和独立分布的副本是给定的：我们的协议工作，即使一些高度复杂的纠缠之间创建的副本以任何人为的方式。作为应用，我们考虑了IQP模型的量子计算优越性证明的验证，以及可验证的盲量子计算。
Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli operators. First, we introduce a protocol for verifying ground states of Hamiltonians. We next explain how to verify quantum states generated by a certain class of quantum circuits. We finally propose an adaptive test of stabilizers that enables the verification of all polynomial-time-generated hypergraph states, which include output states of the Bremner-Montanaro-Shepherd-type instantaneous quantum polynomial time (IQP) circuits. Importantly, we do not make any assumption that the identically and independently distributed copies of the same states are given: Our protocols work even if some highly complicated entanglement is created among copies in any artificial way. As applications, we consider the verification of the quantum computational supremacy demonstration with IQP models, and verifiable blind quantum computing.