Abstract
Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. The basic algebraic properties of this system have been studied in Dalla Chiara et al. (Foundations of Physics 39(6):559–572, 2009), where we have introduced the notion of Shi-Aharonov quantum computational structure. In this paper we propose an algebraic abstraction from the Hilbert-space quantum computational structures, by introducing the notion of Toffoli-Hadamard algebra. From an intuitive point of view, such abstract algebras represent a natural quantum generalization of both classical and fuzzy-like structures.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aharonov, D. (2003). A simple proof that Toffoli and Hadamard are quantum universal. arXiv:quant-ph/0301040.
Aharonov, D., Kitaev, A., Nisan, N. (1998). Quantum cirQ.E.Dtates. In STOC ’98: Proceedings of the thirtieth annual ACM symposium on theory of computing (pp. 20–30). ACM Press.
Cattaneo, G., Dalla Chiara, M.L., Giuntini, R., Leporini, R. (2004). Quantum computational structures. Mathematica Slovaca, 54, 87–108.
Cignoli, R., D’Ottaviano, I.M.L. , Mundici, D. (2000). Algebraic foundations of many-valued reasoning. Dordrecht: Kluwer.
Dalla Chiara, M.L., Giuntini, R., Leporini, R. (2003). Quantum computational logics: a survey. In V.F. Hendricks & J. Malinowski (Eds.), Trends in logic: 50 years of studia logica (pp. 213–255). Dordrecht: Kluwer.
Dalla Chiara, M.L., Giuntini, R., Freytes, H., Ledda, A., Sergioli, G. (2009). The algebraic structure of an approximately universal system of quantum computational gates. Foundations of Physics, 39(6), 559–572.
Dalla Chiara, M.L., Giuntini, R., Leporini, R. (2005). Logics from Quantum Computation. International Journal of Quantum Information, 3, 293–337.
Dawson, C.M., & Nielsen, M.A. (2005). The Solovay-Kitaev algorithm. arXiv:quant-ph/0505030.
Deutsch, D. (1989). Quantum computational networks. Proceedings of the Royal Society of London A, 425, 73–90.
Gudder, G. (2003). Quantum computational logics. International Journal of Theoretical Physics, 42, 39–47.
Kitaev, A.Y. (1997). Quantum computations: algorithms and error correction. Russian Mathematical Surveys, 52(6), 1191–1249.
Kraus, K. (1983). States effects and operations. Berlin: Springer-Verlag.
Ledda, A., Konig, M., Paoli, F., Giuntini, R. (2006). MV algebras quantum computation. Studia Logica, 82(2), 245–270.
Nielsen, M., & Chuang, I. (2000). Quantum computation and quantum information. Cambridge: Cambridge University Press.
Shi, Y. (2002). Both Toffoli and controlled-Not need little help to do universal quantum computation. arXiv:quant-ph/0205115.
Toffoli, T. (1980). Reversible computing. In J.W. de Bakker & J. van Leeuwen (Eds.), Automata, languages and programming (pp. 632–644). Berlin: Springer.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dalla Chiara, M.L., Ledda, A., Sergioli, G. et al. The Toffoli-Hadamard Gate System: an Algebraic Approach. J Philos Logic 42, 467–481 (2013). https://doi.org/10.1007/s10992-013-9271-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10992-013-9271-9