利用单个纯量子比特与 $log N$ 个混合量子比特实现高效因数分解
量子物理
2009-11-06 v3
摘要
人们通常认为，Shor 用于大数 高效因数分解的量子算法需要一个纯初态。在此我们证明，单个纯量子比特加上一组处于任意混合态的 个量子比特，就足以高效实现 Shor 的因数分解算法。
引用
@article{arxiv.quant-ph/0001066,
title = {Efficient factorization with a single pure qubit and $log N$ mixed qubits},
author = {S. Parker and M. B. Plenio},
journal= {arXiv preprint arXiv:quant-ph/0001066},
year = {2009}
}
备注
5 pages including 2 figures. Final version submitted to PRL. Now includes additional comments on entanglement and mixedness as algorithm proceeds. Added references to work by Mosca