Oversimplifying quantum factoring

Article

关键词: EXPERIMENTAL REALIZATION;    ALGORITHM;    QUBIT;    COMPUTATION;   

DOI  :  10.1038/nature12290

来源: SCIE

【 摘 要 】

Shor's quantum factoring algorithm exponentially outperforms known classical methods. Previous experimental implementations have used simplifications dependent on knowing the factors in advance. However, as we show here, all composite numbers admit simplification of the algorithm to a circuit equivalent to flipping coins. The difficulty of a particular experiment therefore depends on the level of simplification chosen, not the size of the number factored. Valid implementations should not make use of the answer sought.

【 授权许可】

Free