Systematic Approaches for Precise and Approximate Quantum State Runtime Assertion
Systematic Approaches for Precise and Approximate Quantum State Runtime Assertion
复制标题
DOI：
10.1109/hpca51647.2021.00025
复制
发表时间：
2021-02
期刊：
影响因子：
--
通讯作者：
Ji Liu;Huiyang Zhou
中科院分区：
文献类型：
--
作者：
Ji Liu;Huiyang Zhou
随着量子计算技术的快速发展，程序员需要新的工具来调试量子程序。最近的工作表明，断言是一种很有前途的方法来调试量子程序。然而，现有方案存在两个主要缺点。首先，现有的方案，包括统计和动态断言，只能断言有限类型的状态，即经典，叠加和特定的纠缠态。其次，这些断言的用例是有限的，因为程序员必须知道确切/精确的状态来断言。在这项工作中，我们提出了两个系统的方法来动态量子态断言，他们可以断言更广泛的量子态，包括纯态和混合态。我们还介绍了近似量子态断言的情况下，程序员只有有限的量子态知识的想法。近似断言能够检查一组状态$\{|\psi\rangle，\|\phi\rangle，\ldots\}$.虽然精确的量子态断言可以检查特定的量子态，但近似断言允许检查感兴趣的量子位是否处于某些预期状态的超集中，这类似于经典计算中用于成员资格检查的众所周知的布隆过滤器。我们的实验表明，我们的系统方法可以断言更多的量子态，并可以用于各种断言位置的量子比特状态检查。
With the rapid growth of quantum computing technology, programmers need new tools for debugging quantum programs. Recent works show that assertions are a promising way for debugging quantum programs. However, there are two main drawbacks with the existing schemes. First, the existing schemes, including both statistical and dynamic assertions are only capable of asserting limited types of states, namely classical, superposition, and specific entanglement states. Second, the use cases of these assertions are limited, since the programmer has to know the exact/precise state to assert.In this work, we propose two systematic approaches for dynamic quantum state assertion and they can assert a much broader range of quantum states including both pure states and mixed states. We also introduce the idea of approximate quantum state assertion for the cases where the programmers only have limited knowledge of the quantum states. Approximate assertion is capable of checking membership in a set of states $\{|\psi\rangle,\ |\phi\rangle,\ldots\}$. While precise quantum state assertion can check a specific quantum state, approximate assertion enables a way to check whether the qubits of interest are in a super-set of some expected states, which is analogous to the well-known Bloom filter for membership checking in classical computing. Our experiments demonstrate that our systematic approaches can assert many more quantum states and can be used in various assertion locations for qubit state checking.