论文标题
猜想C仍然存在
Conjecture C Still Stands
论文作者
论文摘要
十多年前，作者描述了一个参数$ k（ρ）$的复杂性，$ n $ qubit量子状态$ρ$，并提出了猜想（称为“猜测C”），当该参数在$ n $中是$ n $中的超级元素时，$ρ$的$ρ$并非实验性可行（并且没有实验性的量子）。不久之后[6]（Arxiv：1204.3404），Steve Flammia和Aram Harrow声称，简单的易于构造的$ W $状态是“猜想C”的反例。我们指出，Flammia和Harrow关于$ W $ states的论点是不完整的。此外，在过去十年中，在嘈杂的中间尺度量子（NISQ）计算机上，从实验进步的出现图片表明，NISQ计算机无法在实验中实现$ W $ state，并且无法在没有量子故障的情况下构造。
More than ten years ago the author described a parameter $K(ρ)$ for the complexity of $n$-qubit quantum state $ρ$ and raised the conjecture (referred to as "Conjecture C") that when this parameter is superpolynomial in $n$, the state $ρ$ is not experimentally feasible (and will not be experimentally achieved without quantum fault-tolerance). Shortly afterward [6] (arXiv:1204.3404), Steve Flammia and Aram Harrow claimed that the simple easy-to-construct $W$ states are counterexamples to "Conjecture C." We point out that Flammia and Harrow's argument regarding $W$-states is incomplete. Moreover, the emergent picture from experimental progress of the past decade on noisy intermediate scale quantum (NISQ) computers suggests that $W$-states, as simple as they appear, cannot be achieved experimentally by NISQ computers, and can not be constructed without quantum fault-tolerance.
