2021-03-262008-01-010277786X1996756XWOS;000258327300013SCOPUS;2-s2.0-43649088083http://hdl.handle.net/10784/27422Three possible quantum algorithms, for the computation of the Bollobás-Riordan-Tutte polynomial of a given ribbon graph, are presented and discussed. The first possible algorithm is based on the spanning quasi-trees expansion for generalized Tutte polynomials of generalized graphs and on a quantum version of the Binary Decision Diagram (BDD) for quasi-trees . The second possible algorithm is based on the relation between the Kauffman bracket and the Tutte polynomial; and with an application of the recently introduced Aharonov-Arad-Eban-Landau quantum algorithm. The third possible algorithm is based on the relation between the HOMFLY polynomial and the Tutte polynomial; and with an application of the Wocjan-Yard quantum algorithm. It is claimed that these possible algorithms may be more efficient that the best known classical algorithms. These three algorithms may have interesting applications in computer science at general or in computational biology and bio-informatics in particular. A line for future research based on the categorification project is mentioned.enghttps://v2.sherpa.ac.uk/id/publication/issn/0277-786Xinfo:eu-repo/semantics/conferencePaperPotts problemSigned graphTutte polynomialAlgorithmsComputer sciencePolynomial approximationQuantum theoryGraph theory2021-03-26Velez, M.Ospina, J.10.1117/12.777401