Universality in Quantum Computation
量子物理
2015-06-26 v1
摘要
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.
引用
@article{arxiv.quant-ph/9505018,
title = {Universality in Quantum Computation},
author = {D. Deutsch and A. Barenco and A. Ekert},
journal= {arXiv preprint arXiv:quant-ph/9505018},
year = {2015}
}
备注
11 pages, LaTeX