Quantum Universality from Magic States Distillation Applied to CSS Codes
暂无分享,去创建一个
[1] E. Knill. Fault-Tolerant Postselected Quantum Computation: Threshold Analysis , 2004 .
[2] P. Oscar Boykin,et al. A new universal and fault-tolerant quantum basis , 2000, Inf. Process. Lett..
[3] E. Knill. Fault-Tolerant Postselected Quantum Computation: Schemes , 2004, quant-ph/0402171.
[4] A. Kitaev,et al. Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages) , 2004, quant-ph/0403025.
[5] Yaoyun Shi. Both Toffoli and controlled-NOT need little help to do universal quantum computing , 2003, Quantum Inf. Comput..
[6] Martin B. Plenio,et al. Classical simulability, entanglement breaking, and quantum computation thresholds (11 pages) , 2005 .
[7] E. Knill. Quantum computing with realistically noisy devices , 2005, Nature.
[8] E. Knill,et al. Resilient quantum computation: error models and thresholds , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[9] A. Harrow,et al. Robustness of quantum gates in the presence of noise , 2003, quant-ph/0301108.