测试量子门的上下文无关性
Testing the context-independence of quantum gates
摘要:
比如说,在量子计算机中的量子比特上执行的实际门可能不仅取决于我们编程来实现门的实际激光脉冲和电压,还取决于它的{ \em上下文}。例如,它可能取决于什么门刚刚被应用于同一个量子位,或者取决于一长串先前的激光脉冲已经加热了量子位的环境。本文分析了几种测试来检测这种上下文相关的错误(其中包括各种类型的非马尔可夫错误)。这些测试的一个关键特征是它们对状态准备和测量(SPAM)错误和门相关错误都是鲁棒的。由于上下文相关的错误预计在实践中是小的,它变得重要的是要仔细分析统计波动的影响,所以我们调查的权力和精度的测试作为重复次数和门序列的长度的函数。从我们的测试中出现了一个重要的量:概率(相对频率)矩阵$\mathcal{P}.$的行列式(log-det)的对数出于这个原因,我们推导出log-det估计的概率分布,然后使用它来检查我们对各种单量子比特和双量子比特测量集和初始状态的测试性能。最后,我们强调了log-det和上下文无关操作的可逆性(酉性)程度之间的联系。
英文摘要:
The actual gate performed on, say, a qubit in a quantum computer may depend, not just on the actual laser pulses and voltages we programmed to implement the gate, but on its {\em context} as well. For example, it may depend on what gate has just been applied to the same qubit, or on how much a long series of previous laser pulses has been heating up the qubit's environment. This paper analyzes several tests to detect such context-dependent errors (which include various types of non-Markovian errors). A key feature of these tests is that they are robust against both state preparation and measurement (SPAM) errors and gate-dependent errors. Since context-dependent errors are expected to be small in practice, it becomes important to carefully analyze the effects of statistical fluctuations and so we investigate the power and precision of our tests as functions of the number of repetitions and the length of the sequences of gates. From our tests an important quantity emerges: the logarithm of the determinant (log-det) of a probability (relative frequency) matrix $\mathcal{P}.$ For this reason, we derive the probability distribution of the log-det estimates which we then use to examine the performance of our tests for various single- and two-qubit sets of measurements and initial states. Finally, we emphasize the connection between the log-det and the degree of reversibility (the unitarity) of a context-independent operation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。