Publisher
Springer Berlin Heidelberg
Reference53 articles.
1. Adleman, L.M., DeMarrais, J., Huang, M.-D.A.: Quantum computability. SIAM Journal of Computing 26(5), 1524–1540 (1997)
2. Aharonov, D.: A simple proof that Toffoli and Hadamard are quantum universal, quant-ph/0301040 (2003)
3. Aho, A.V., Svore, K.M.: Computing quantum circuits using the palindrom transformation, quant-ph/0311008 (2003)
4. Barenco, A.: A universal two-bit gate for quantum computation. Proceedings of Royal Society London A 449, 679–683 (1995)
5. Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P.W., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates of quantum computation. Physical Review A 52(5), 3457–3467 (1995)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algebraic Methods in Quantum Informatics;Algebraic Informatics
2. From Informatics to Quantum Informatics;Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006