Abstract
The recently proposed Cohesive Homotopy Type Theory is exploited as a formal foundation for central concepts in Topological and Geometrical Quantum Computation. Specifically the Cohesive Homotopy Type Theory provides a formal, logical approach to concepts like smoothness, cohomology and Khovanov homology; and such approach permits to clarify the quantum algorithms in the context of Topological and Geometrical Quantum Computation. In particular we consider the so-called “open-closed stringy topological quantum computer” which is a theoretical topological quantum computer that employs a system of open-closed strings whose worldsheets are open-closed cobordisms. The open-closed stringy topological computer is able to compute the Khovanov homology for tangles and for hence it is a universal quantum computer given than any quantum computation is reduced to an instance of computation of the Khovanov homology for tangles. The universal algebra in this case is the Frobenius Algebra and the possible open-closed stringy topological quantum computers are forming a symmetric monoidal category which is equivalent to the category of knowledgeable Frobenius algebras. Then the mathematical design of an open-closed stringy topological quantum computer is involved with computations and theorem proving for generalized Frobenius algebras. Such computations and theorem proving can be performed automatically using the Automated Theorem Provers with the TPTP language and the SMT-solver Z3 with the SMT-LIB language. Some examples of application of ATPs and SMT-solvers in the mathematical setup of an open-closed stringy topological quantum computer will be provided.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.