arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv quant-ph/0502138quant-phcs.ET
收藏

刻薄国王的新故事

New Tales of the Mean King

Andreas Klappenecker, Martin Roetteler

AI总结:

本文回顾刻薄国王问题并提出组合解法,证明仿射可分解设计可定义并求解类似的态重构问题,且无需辅助量子比特即可确定三量子比特系统中九次测量的结果。

摘要:

刻薄国王问题要求确定从一组互补可观测量的测量中随机选择的结果。我们回顾了这一问题并给出了一种组合解法。更一般地,我们证明只要存在仿射可分解设计,就可以定义并求解一个类似于刻薄国王问题的态重构问题。作为该一般框架的应用,我们考虑了一个涉及三个量子比特的问题,其中九次不同测量的结果无需使用辅助量子比特即可确定。该解法基于源自Hadamard设计的测量。

英文摘要:

The Mean King's problem asks to determine the outcome of a measurement that is randomly selected from a set of complementary observables. We review this problem and offer a combinatorial solution. More generally, we show that whenever an affine resolvable design exists, then a state reconstruction problem similar to the Mean King's problem can be defined and solved. As an application of this general framework we consider a problem involving three qubits in which the outcome of nine different measurements can be determined without using ancillary qubits. The solution is based on a measurement derived from Hadamard designs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑